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

Superdense coding

Encode two classical bits using a shared Bell pair and one transmitted qubit.

Core18 min lessonDr. Charith Jayasekara↓ Chapter PDF
By the end, you’ll be able to
  • 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.

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 AA and Bob’s qubit BB in

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

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.

Let the message be pqpq, where pp is the first bit. Alice applies XqX^q and then ZpZ^p to her qubit. A zero exponent means “skip this gate”; a one exponent means “apply it”. Her operation is therefore ZpXqZ^pX^q.

The two bits select the correlation and phase of the pair:

∣βpq⟩=(ZpXq⊗I)∣Φ+⟩.|\beta_{pq}\rangle=(Z^pX^q\otimes I)|\Phi^+\rangle.
Message pqpqAlice’s operationShared state
00II$(
01XX$(
10ZZ$(
11ZXZX$(

These four Bell states are mutually orthogonal. Bob can distinguish them when he has access to both qubits. Alice sends AA to Bob, who now decodes the joint state.

Checkpoint. What changes when pp changes while q=0q=0? The relative sign between ∣00⟩|00\rangle and ∣11⟩|11\rangle. Their Z-basis probabilities remain equal, so simply measuring the two wires immediately would lose the phase bit.

Bob applies CNOT with AA as control and BB as target, then applies HH to AA. In the chosen basis order, the result is

CNOT⁡A→B∣βpq⟩=∣0q⟩+(−1)p∣1q⟩2,\operatorname{CNOT}_{A\to B}|\beta_{pq}\rangle =\frac{|0q\rangle+(-1)^p|1q\rangle}{\sqrt2}, (HA⊗IB)CNOT⁡A→B∣βpq⟩=∣pq⟩.(H_A\otimes I_B)\operatorname{CNOT}_{A\to B}|\beta_{pq}\rangle=|pq\rangle.

The first output gives the phase bit pp; the second gives the correlation bit qq. The Hadamard acts like the second half of an interferometer: it makes the relative sign visible in an ordinary measurement outcome.

Superdense coding: convert a Bell label into two bitsTwo-wire circuit: shared Bell preparation, message X to the q and Z to the p on A, transmission, then CNOT A to B and H on A. Measurements return p on the upper wire and q on the lower wire. Four signed amplitude panels show each encoded Bell state. Superdense coding: convert a Bell label into two bits A |0⟩ B |0⟩ H X^q Zᵖ Send A H p q Prepare pair Encode Decode Message 00 00 01 10 11 Message 01 00 01 10 11 Message 10 00 01 10 11 Message 11 00 01 10 11 Signed amplitudes: nonzero bars have magnitude 1/√2.
Superdense coding circuit and signed amplitudes of the four encoded Bell states.

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.

For message 10, Alice applies ZZ and obtains

∣00⟩−∣11⟩2.\frac{|00\rangle-|11\rangle}{\sqrt2}.

CNOT maps ∣00⟩|00\rangle to itself and ∣11⟩|11\rangle to ∣10⟩|10\rangle. The state becomes (∣00⟩−∣10⟩)/2=∣−⟩A∣0⟩B(|00\rangle-|10\rangle)/\sqrt2=|-\rangle_A|0\rangle_B. Because H∣−⟩=∣1⟩H|-\rangle=|1\rangle, decoding yields ∣10⟩|10\rangle with certainty in the ideal circuit. The phase difference has become the first output bit.

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 HH and repeat the four messages. He can still learn qq from parity, but the computational-basis statistics do not distinguish the two possible values of pp. This locates the essential interference operation rather than treating the protocol as a memorised gate list.

Bob’s original qubit alone has state I/2I/2 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.

  1. Decode message 01 by hand.

  2. What would a gate-order change do for message 11?

Worked answers
  1. CNOT transforms (∣01⟩+∣10⟩)/2(|01\rangle+|10\rangle)/\sqrt2 into ∣+⟩A∣1⟩B|+\rangle_A|1\rangle_B; HAH_A yields ∣01⟩|01\rangle.

  2. XZ=−ZXXZ=-ZX, 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.

PAUSE & THINK

Why can Bob recover two bits?

Choose your answer

The protocol uses four distinguishable joint states. Local gates choose a state, transmission brings the two halves together, and interference reveals the message.

Bennett and Wiesner, original dense-coding paper, 1992; IBM Quantum Learning, superdense coding. The message convention, worked derivation and exploration above are original.

ONE IDEA FURTHER

Ready for the next step?

Your progress stays in this browser.

View progress & resume a chapter →