Skip to content
Quantum ComputingAN INTERACTIVE OPEN TEXTBOOK
charithj.com.au

Quantum teleportation

Transfer an unknown qubit state using a shared Bell pair and two ordinary bits.

Core18 min lessonDr. Charith Jayasekara↓ Chapter PDF
By the end, you’ll be able to
  • Trace all four measurement branches and their corrections.
  • Explain the shared entanglement and classical communication resources.
  • Test preservation of relative phase.

Before you begin: Qubit states, H and X/Z gates, CNOT, Bell pairs, measurement.

Suppose a quantum sensor prepares a qubit that another processor needs. Measuring it once gives one outcome, so sending that outcome cannot preserve all its quantum information. Teleportation solves a different task: it transfers the state to an existing receiver qubit, using entanglement shared earlier and two classical bits sent afterwards.

Think of the sender and receiver as two project teams. They prepare a shared resource before the task begins, then a short message tells the receiving team which correction completes the task. This analogy describes coordination; the shared resource here is a quantum Bell pair, whose correlations must be described by the circuit.

The input can be any normalised qubit:

∣ψ⟩=α∣0⟩+β∣1⟩,∣α∣2+∣β∣2=1.|\psi\rangle=\alpha|0\rangle+\beta|1\rangle,\qquad |\alpha|^2+|\beta|^2=1.

Alice holds the input QQ and an auxiliary qubit AA. Bob holds BB. Initially, AA and BB share

∣Φ+⟩AB=∣00⟩+∣11⟩2.|\Phi^+\rangle_{AB}=\frac{|00\rangle+|11\rangle}{\sqrt2}.

Checkpoint. Which two systems must already be entangled? AA and BB. The unknown input QQ is a separate system at the start.

Use the fixed wire order Q,A,BQ,A,B, from top to bottom. Prepare the Bell pair with HH on AA, followed by CNOT from AA to BB. Alice then applies CNOT from QQ to AA, followed by HH on QQ. She measures QQ to obtain mm, and AA to obtain nn. She sends both bits to Bob. Bob applies XX when n=1n=1, then ZZ when m=1m=1.

The important identity is that Alice’s two measurements select one of four correctable branches:

12∑m,n∈{0,1}∣mn⟩QA XnZm∣ψ⟩B.\frac12\sum_{m,n\in\{0,1\}}|mn\rangle_{QA}\,X^nZ^m|\psi\rangle_B.

Each pair mnmn has probability 1/41/4, regardless of α\alpha and β\beta. Applying XnX^n and then ZmZ^m means the combined correction is ZmXnZ^mX^n, which reverses the branch operation.

Alice’s bits mnmnBob’s state before correctionApply, in time order
00$\psi\rangle$
01$X\psi\rangle$
10$Z\psi\rangle$
11$XZ\psi\rangle$
Teleportation: one input, four correctable branchesThree quantum wires Q, A, B. Bell pair preparation H on A and CNOT A to B. Alice applies CNOT Q to A and H on Q, then measures Q as m and A as n. Classical n controls X on B, then m controls Z on B. All four branches are equally likely. Teleportation: one input, four correctable branches Q |ψ⟩ A |0⟩ B |0⟩ H H Xⁿ Zᵐ m n Share Bell pair Alice's measurement Bob's corrections Classical bits Before correction Probability 00 |ψ⟩ ¼ 01 X|ψ⟩ ¼ 10 Z|ψ⟩ ¼ 11 XZ|ψ⟩ ¼ Each correction restores the same state |ψ⟩ on B.
Three-wire teleportation circuit with classical corrections and all four branch probabilities.

The doubled lines carry classical bits. The lower quantum output carries the restored input state; the upper two measurements choose its correction.

Choose an input with unequal probabilities and a visible complex phase:

∣ψ⟩=32∣0⟩+i2∣1⟩.|\psi\rangle=\frac{\sqrt3}{2}|0\rangle+\frac{i}{2}|1\rangle.

If Alice obtains mn=11mn=11, Bob’s state is

XZ∣ψ⟩=−i2∣0⟩+32∣1⟩.XZ|\psi\rangle=-\frac{i}{2}|0\rangle+\frac{\sqrt3}{2}|1\rangle.

After XX, it becomes 3∣0⟩/2−i∣1⟩/2\sqrt3|0\rangle/2-i|1\rangle/2. After ZZ, it becomes the original input. Thus both the magnitudes and the relative phase survive. A Z-basis test alone would miss many phase errors, so a simulator should compare the complete state or measure several bases on repeated preparations.

In an ideal simulator, freely choose an input, then inspect all four branches. Keep your input visible while switching branches. Temporarily omit each correction and compare the output in X, Y and Z bases. For the input ∣+⟩|+\rangle, omitting the phase correction can turn ∣+⟩|+\rangle into ∣−⟩|-\rangle: their Z histograms match, while their X outcomes differ completely.

Before Alice’s message arrives, Bob’s state averaged over the unknown outcomes is I/2I/2. Therefore he cannot read the input or a message from his qubit alone. Alice’s measurements also consume the original quantum state and the Bell pair. Resource accounting is one shared Bell pair plus two transmitted classical bits per ideal teleported qubit. This explains both the communication requirement and why the process produces one usable output state.

  1. For input ∣0⟩|0\rangle and bits 0101, find Bob’s state before and after correction.

  2. Why is testing only ∣0⟩|0\rangle and ∣1⟩|1\rangle insufficient?

Worked answers
  1. ∣1⟩|1\rangle, then ∣0⟩|0\rangle after XX.

  2. phase mistakes can preserve both; also test superpositions such as ∣+⟩|+\rangle and (∣0⟩+i∣1⟩)/2(|0\rangle+i|1\rangle)/\sqrt2.

PAUSE & THINK

Alice measures m=1,n=0. What should Bob do?

Choose your answer

Teleportation transfers quantum information through a shared entangled resource and a classical message. The four branch equations explain why every measurement outcome can succeed.

Bennett et al., original teleportation paper, 1993; IBM Quantum Learning, teleportation. The worked state, activities and figure above are original teaching examples.

ONE IDEA FURTHER

Ready for the next step?

Your progress stays in this browser.

View progress & resume a chapter →