Skip to content
Tutorials Center
My learning

Topics

Lesson 17 of 39 ยท Entanglement

Quantum Teleportation

Learn the quantum teleportation protocol: how an unknown qubit state moves from Alice to Bob using a Bell pair and two classical bits, with a full NumPy simulation and corrections.

Quantum teleportation transfers an unknown quantum state from one place to another without sending the qubit itself. Alice holds a qubit in a state she does not know. She and Bob share an entangled pair. By measuring two of her qubits and sending Bob two ordinary classical bits, she lets Bob reconstruct the exact state on his half of the pair. The original is destroyed in the process.

No matter is transported and nothing travels faster than light: Bob needs the classical bits before he can fix his qubit. Yet the protocol is a cornerstone of quantum communication and quantum networking, and an elegant demonstration of how entanglement, measurement and gates combine.

The setup

Three qubits are involved:

  • Qubit 0 (Alice): the message |psi> = alpha|0> + beta|1>, unknown to everyone.
  • Qubit 1 (Alice) and qubit 2 (Bob): a Bell pair (|00> + |11>)/sqrt(2) created earlier and then separated.

The goal is to end with |psi> on qubit 2.

The protocol

  1. Entangle: Alice applies CNOT with qubit 0 as control and qubit 1 as target.
  2. Rotate: Alice applies a Hadamard to qubit 0.
  3. Measure: Alice measures qubits 0 and 1, obtaining two classical bits m0 m1.
  4. Send: She sends the two bits to Bob over a classical channel.
  5. Correct: Bob applies X to his qubit if m1 = 1, then Z if m0 = 1.
flowchart LR
    P["|psi> (q0)"] --> C1["CNOT control"]
    B1["Bell pair, q1"] --> C2["CNOT target"]
    C1 --> HG["H on q0"]
    HG --> M0["measure q0 = m0"]
    C2 --> M1["measure q1 = m1"]
    M1 -- "m1 = 1: X" --> BOB["q2 = |psi>"]
    M0 -- "m0 = 1: Z" --> BOB
    B2["Bell pair, q2"] --> BOB

Two classical bits tell Bob which correction to apply.

Why it works

Write the total state before measurement and expand it in the Bell basis of Alice's two qubits. After Alice's CNOT and Hadamard, the state is an equal-weight sum of four terms:

(1/2) * [ |00> (alpha|0> + beta|1>) + |01> (alpha|1> + beta|0>) + |10> (alpha|0> - beta|1>) + |11> (alpha|1> - beta|0>) ]

where the first two bits are Alice's qubits (0 and 1) and the last factor is Bob's qubit. Each of Alice's four outcomes occurs with probability 1/4, and Bob's qubit is left in one of four related states, each obtained from |psi> by one of I, X, Z or XZ. The classical bits say which, and the correction undoes it. Importantly, the measurement outcomes are uniformly random and independent of alpha and beta, so Alice's bits reveal nothing about the state.

Python Teleporting a state: all four measurement outcomes

Press Run (or Ctrl + Enter) to see the result here.

Program input ยท what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

Every outcome has probability 0.25, and after the right correction Bob's qubit matches the original state with fidelity 1.

No-cloning is respected

After the measurement, Alice's original qubit has collapsed: the state exists only on Bob's side. Teleportation moves the state, it does not copy it, which is consistent with the no-cloning theorem you will meet in Superdense Coding and No-Cloning.

Deferred measurement: a fully quantum version

Because measurement can be postponed, the classical communication and corrections can be replaced by controlled gates: instead of measuring qubit 1 and applying X conditionally, apply a CNOT from qubit 1 to qubit 2; instead of measuring qubit 0 and conditionally applying Z, apply a CZ from qubit 0 to qubit 2. The result then holds |psi> on qubit 2 deterministically, which is easy to verify with the simulator from Building a Circuit Simulator. (This variant is a good test, but it is not a real communication protocol: it needs a quantum connection between the parties.)

Python Teleportation without measurement (deferred)

Press Run (or Ctrl + Enter) to see the result here.

Program input ยท what you'd type while the program runs

Type the answers before you press Run, one per line. Each time the program reads a line (with input()), it gets the next line from this box.

Each of the four branches shows fidelity 1: Bob's qubit is correct in all of them.

Resource accounting

Teleportation costs one shared Bell pair and two classical bits per qubit sent. You cannot send quantum information with fewer resources, and you cannot send it faster than the classical bits travel. This is exactly the kind of statement that quantum information theory makes rigorous.

Teleportation is a practical tool: it moves qubits between modules of a distributed quantum computer, underlies quantum repeaters for long-distance networks, and is used inside fault-tolerant gate constructions (gate teleportation).

Check your understanding

Quick check ยท 4 questions

of 4 answered You scored / 4 ยท perfect!

  1. 1. How many classical bits does Alice send Bob in the teleportation of one qubit?

    Her two measurement results (four possibilities) tell Bob which of I, X, Z, XZ to apply.
  2. 2. Which corrections does Bob apply for m0 = 1 and m1 = 1?

    X is applied when m1 = 1 and Z when m0 = 1, in that order.
  3. 3. What happens to the original qubit's state at Alice's side?

    Teleportation moves the state; it does not clone it.
  4. 4. Why can't teleportation be used for faster-than-light communication?

    Without the two classical bits, Bob's qubit is a maximally mixed state independent of the message.

Summary

  • Teleportation sends an unknown qubit state using a shared Bell pair plus two classical bits.
  • Alice applies CNOT and H to her two qubits, measures, and sends the results.
  • Bob applies X (if m1 = 1) then Z (if m0 = 1) to recover the state exactly.
  • The measurement outcomes are uniformly random and carry no information about the state.
  • The state is moved, not copied; nothing travels faster than the classical bits.

Next: Superdense Coding and No-Cloning