Teleportation & Superdense Coding
Trading entanglement and classical bits for quantum states, and back.
One shared Bell pair plus two classical bits can move an unknown qubit across any distance; one Bell pair plus one qubit can carry two classical bits. In this lesson you derive both protocols line by line, build them as circuits, show why neither beats light, and quantify what noisy entanglement costs.
What you’ll learn
- Use the identities to encode and decode two bits in a Bell pair.
- Derive the teleportation identity and Bob's corrections , and implement them with deferred measurement.
- Show that Bob's qubit is maximally mixed until the classical bits arrive, and that no copy is left behind.
- Compute teleportation fidelity with noisy entanglement, , and explain the classical benchmark.
- State the resource inequalities and argue that both protocols are optimal.
The Bell basis as a Pauli toolkit
The four Bell states form an orthonormal basis of two qubits. Label them by two bits, , so that , , and . The key identity: every Bell state is with a Pauli applied to just one of the qubits, either one.
| Bell state | Pauli on the first qubit | maps it to | |
|---|---|---|---|
| 00 | |||
| 01 | |||
| 10 | |||
| 11 | ( first, then ) |
Alice and Bob share . Alice applies to her qubit and sends it to Bob, who applies CNOT and and measures both qubits. What does he read?
- , because the pair became
- , because the pair became
- : a local cannot change a shared entangled state
- A random result, since only changes a phase
Show the answer
A. , because the pair became
, and the decoder maps .
Superdense coding
Protocol (Bennett & Wiesner 1992). Alice and Bob share in advance.
- To send the bits , Alice applies to her qubit, turning the pair into .
- She sends her qubit to Bob.
- Bob, now holding both qubits, performs the Bell measurement and reads .
Build it below. The first two columns make the shared ; qubit 0 is Alice's and qubit 1 is Bob's.
Think first Could Alice squeeze 3 bits into one transmitted qubit by sharing a bigger entangled state with Bob, say with Bob holding many qubits?
No. With one transmitted qubit and any amount of prior entanglement, at most 2 bits can be conveyed: sending a -dimensional system carries at most bits, even with unlimited shared entanglement. Superdense coding is already optimal.
Teleportation, line by line
Now the protocol of Bennett, Brassard, Crépeau, Jozsa, Peres & Wootters (1993). Alice holds the unknown on qubit 0 and shares on qubits 1 (hers) and 2 (Bob's).
Expand the product state.
Rewrite Alice's two qubits (0 and 1) in the Bell basis.
Collect terms. Nothing physical has happened yet: this is the same state, re-expanded.
Recognize Bob's four states as , , and .
Alice's Bell measurement returns , each with probability ¼ whatever is. Bob applies and then .
No signalling, no cloning, and noisy entanglement
Bob does not know the outcome, so he averages over the four equally likely branches.
, and the phase cancels in the conjugation.
Write . Conjugation by each Pauli keeps its own Bloch component and flips the other two, so the four terms cancel completely. This Pauli twirl is the no-signalling theorem at work.
Real entanglement is noisy. Suppose Alice and Bob share a mixed two-qubit state instead of . Its fully entangled fraction is the largest overlap with any maximally entangled state. Running the standard protocol (with Bob's corrections adjusted to the best ) gives average teleportation fidelity (Horodecki, Horodecki & Horodecki 1999):
Alice and Bob teleport through a Werner state with . What average fidelity do they get?
Show the answer
0.9
, so , which equals . Teleporting through a Werner state acts on as a depolarizing channel that shrinks its Bloch vector by .
Resource accounting
| Conversion | Resource inequality | Protocol |
|---|---|---|
| Entanglement + classical bits → qubit | Teleportation | |
| Entanglement + qubit → classical bits | Superdense coding | |
| Qubit → entanglement | Send half of a Bell pair | |
| Classical communication → entanglement | Impossible | LOCC cannot create entanglement |
Both protocols are optimal. Superdense coding cannot beat 2 bits per qubit (the entanglement-assisted Holevo bound). And teleportation cannot use fewer than 2 classical bits per qubit, by an argument that combines the two protocols:
Why must every teleportation protocol use at least 2 classical bits per qubit?
- Because a qubit stores two real numbers, a magnitude and a phase
- Because Bob's corrections need one bit per Pauli, and there are two Paulis
- Otherwise, followed by superdense coding, it would let shared entanglement boost a classical channel beyond its capacity
- Because with fewer bits Bob's qubit would remain entangled with Alice's
Show the answer
C. Otherwise, followed by superdense coding, it would let shared entanglement boost a classical channel beyond its capacity
If 1 bit plus entanglement could teleport a qubit, using that qubit for superdense coding would deliver 2 bits for 1 bit sent. But before the message arrives, Bob's systems are independent of Alice's data (no-signalling), so everything he learns must flow through the transmitted bits, and bits carry at most bits of information. Hence 2 bits are necessary.
Key takeaways
- : a Bell measurement leaves Bob with a known Pauli of , undone by .
- Superdense coding: on Alice's half makes , and Bob's CNOT plus reads . Two bits per qubit is optimal.
- Before the bits arrive Bob holds (a Pauli twirl), so there is no signalling; Alice keeps nothing, so there is no cloning.
- With noisy entanglement ; beating requires, and certifies, entanglement.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
Alice's Bell measurement returns . Which operation must Bob apply?
- Nothing
Show the answer
A.
For outcome Bob holds , and applying restores .
Alice and Bob teleport through a Werner state with , so . What is the average teleportation fidelity?
Show the answer
D.
: exactly the classical measure-and-prepare benchmark. Werner states with are separable, so this is no surprise.
In superdense coding, Eve intercepts the qubit that Alice sends, but never touches Bob's. What can she learn about the 2-bit message?
- Both bits, by measuring in the Bell basis
- One of the two bits
- Nothing at all
- The parity
Show the answer
C. Nothing at all
The intercepted qubit's reduced state is for all four messages, so no measurement on it alone can reveal anything.
In the deferred-measurement teleportation circuit, what state are Alice's two qubits in after Bob's corrections?
- A state entangled with Bob's qubit
- A copy of on qubit 0
- , independent of
Show the answer
D. , independent of
In every branch Bob ends with , so the total state is : a product state, independent of . No copy remains with Alice.
Which resource conversion is impossible?
- 1 ebit + 2 cbits → 1 qubit
- Unlimited classical communication and local operations → 1 ebit
- 1 ebit + 1 qubit → 2 cbits
- 1 qubit → 1 ebit
Show the answer
B. Unlimited classical communication and local operations → 1 ebit
LOCC cannot create entanglement from scratch. The others are teleportation, superdense coding, and simply sending half of a Bell pair.
Go deeper
- Gate Teleportation · Teleporting operations, not just states.
- Entanglement Swapping & Quantum Repeaters · Building a quantum internet across long distances.
Further reading
- C. H. Bennett, G. Brassard, C. Crépeau, R. Jozsa, A. Peres & W. K. Wootters, "Teleporting an unknown quantum state via dual classical and Einstein–Podolsky–Rosen channels", Physical Review Letters 70, 1895 (1993).
- C. H. Bennett & S. J. Wiesner, "Communication via one- and two-particle operators on Einstein–Podolsky–Rosen states", Physical Review Letters 69, 2881 (1992).
- M. Horodecki, P. Horodecki & R. Horodecki, "General teleportation channel, singlet fraction, and quasidistillation", Physical Review A 60, 1888 (1999).
- M. A. Nielsen & I. L. Chuang, Quantum Computation and Quantum Information, §1.3.7 and §2.3 (Cambridge, 2010).