Superdense coding
Encode two classical bits using a shared Bell pair and one transmitted qubit.
- Encode and decode two bits using a Bell pair.
- Account for the transmitted qubit and previously shared entanglement.
- Distinguish joint information from local measurement statistics.
Before you begin: Bell states, H, X, Z, CNOT and measurement.
Count the resources first
Section titled “Count the resources first”Alice wants to send Bob one of four messages: 00, 01, 10 or 11. An ordinary binary channel needs two bits to distinguish them. Superdense coding uses one transmitted qubit, provided Alice and Bob already share a Bell pair. The pre-shared pair is part of the cost. This is a precise example of entanglement changing what a communication task can accomplish.
Start with Alice’s qubit and Bob’s qubit in
Throughout this guide, the written basis order is Alice first, Bob second. This matters because software often prints bit strings in a different order. Fixing the convention before calculating prevents a correct circuit from appearing to return reversed bits.
Encode two choices in one shared state
Section titled “Encode two choices in one shared state”Let the message be , where is the first bit. Alice applies and then to her qubit. A zero exponent means “skip this gate”; a one exponent means “apply it”. Her operation is therefore .
The two bits select the correlation and phase of the pair:
| Message | Alice’s operation | Shared state |
|---|---|---|
| 00 | $( | |
| 01 | $( | |
| 10 | $( | |
| 11 | $( |
These four Bell states are mutually orthogonal. Bob can distinguish them when he has access to both qubits. Alice sends to Bob, who now decodes the joint state.
Checkpoint. What changes when changes while ? The relative sign between and . Their Z-basis probabilities remain equal, so simply measuring the two wires immediately would lose the phase bit.
Decode with an actual circuit
Section titled “Decode with an actual circuit”Bob applies CNOT with as control and as target, then applies to . In the chosen basis order, the result is
The first output gives the phase bit ; the second gives the correlation bit . The Hadamard acts like the second half of an interferometer: it makes the relative sign visible in an ordinary measurement outcome.
The four panels show signed amplitudes in basis order 00,01,10,11. Blue bars are positive and teal bars negative. Comparing messages 00 and 10 reveals the phase change that the decoding circuit converts into a measured bit.
Worked message: 10
Section titled “Worked message: 10”For message 10, Alice applies and obtains
CNOT maps to itself and to . The state becomes . Because , decoding yields with certainty in the ideal circuit. The phase difference has become the first output bit.
Explore freely, then predict
Section titled “Explore freely, then predict”Select any message and inspect the state after each gate. Keep signed amplitudes visible in the simulator. First compare messages 00 and 10: the middle probabilities are identical, while the amplitude signs differ. Then reveal the decoded outputs. A useful quick prediction is “upper bit changes”, “lower bit changes” or “both change” when toggling one message bit. Exploration can continue without entering a written prediction each time.
Now remove Bob’s and repeat the four messages. He can still learn from parity, but the computational-basis statistics do not distinguish the two possible values of . This locates the essential interference operation rather than treating the protocol as a memorised gate list.
Bob’s original qubit alone has state for every message. Alice’s local encoding leaves that marginal state unchanged. Bob gains the two-bit information when he receives the transmitted qubit and performs a joint decoding operation. Preparing and distributing the entangled pair must therefore be included when comparing communication resources or practical performance.
Exercises
Section titled “Exercises”-
Decode message 01 by hand.
-
What would a gate-order change do for message 11?
Worked answers
-
CNOT transforms into ; yields .
-
, so reversing those two gates changes only the overall sign for that message. Its measurement outcome stays 11. Keep the convention fixed to make the algebra easier to follow.
Check your understanding
Section titled “Check your understanding”Why can Bob recover two bits?
Answer: He receives one qubit and uses a previously shared entangled pair. Both resources belong in the accounting.
The protocol uses four distinguishable joint states. Local gates choose a state, transmission brings the two halves together, and interference reveals the message.
Sources
Section titled “Sources”Bennett and Wiesner, original dense-coding paper, 1992; IBM Quantum Learning, superdense coding. The message convention, worked derivation and exploration above are original.
Ready for the next step?
Your progress stays in this browser.