Superdense Coding

The exchange, in one paragraph

Superdense coding delivers two classical bits by transmitting one qubit — after sender and receiver have already shared an entangled pair. The setup: a Bell pair is prepared and split between Alice and Bob. The message: Alice applies one of four gates to her half and physically sends that qubit to Bob. The decoding: Bob runs the Bell preparation circuit in reverse and measures, recovering two bits.

The ledger is the whole story:

• shared before the message: one Bell pair;
• transmitted during the message: one qubit;
• recovered at the end: two classical bits.

Remove the pre-shared pair and the headline is simply false — a lone qubit's measurement does not hand over two freely chosen classical bits.

Encoding and decoding, precisely

Alice and Bob each hold one qubit of:

Alice encodes her two bits by applying one of four operations to her half alone:

• 00 → I (do nothing)
• 01 → X
• 10 → Z
• 11 → XZ

Each choice maps $|{\Phi }^{+}⟩$ to a different Bell state, and the four Bell states are orthogonal — perfectly distinguishable in principle. Alice's qubit then travels to Bob, who now holds both qubits and decodes: CNOT with her qubit as control, then H on that same qubit, then measure. The CNOT basis action does the heavy lifting:

The decode step is exactly the Bell preparation circuit run backwards, converting Bell-basis information into computational-basis bits.

Worked example: sending 10

Alice wants to send 10, so she applies Z to her half:

Her qubit crosses the channel. Bob applies CNOT with her qubit as control:

Then H on the first wire:

Measurement returns 10 — the message, exactly, in the ideal protocol. Notice the shape of the trick: the Z left no trace in either local measurement before the qubits were reunited, because the phase difference lived in the joint state. The information was never in Alice's qubit alone; it was in the correlation, which is why both qubits must be in Bob's hands before decoding can start.

Teleportation (Chapter 25) is the mirror image: same Bell pair, same Bell-basis operations, different payload — superdense coding moves classical bits on a quantum channel; teleportation moves a quantum state with the help of a classical one.

Where the headline overstates

"One qubit carries two bits" is the sentence that launches a thousand bad slides. Without pre-shared entanglement it is wrong: one transmitted qubit yields at most one classical bit of accessible information, a limit known as Holevo's bound. Superdense coding does not break that bound; it pre-pays it, shifting half the communication cost into the earlier distribution of the Bell pair.

The second omission is the physical transmission. Alice's qubit must survive the trip to Bob — the protocol is not remote action, and the channel's loss and noise belong in any honest accounting.

Protocol thinking: setup, message, decode

Read superdense coding the way you would read any network protocol — phases, plus a resource ledger:

1. Prepare a Bell pair.
2. Distribute one half to Alice and one half to Bob — possibly long before the message exists.
3. Alice applies one of four local gates.
4. Alice's qubit travels the quantum channel.
5. Bob applies the inverse Bell-preparation circuit.
6. Bob measures and recovers two bits.

This style of accounting generalizes to every protocol in the book: name the setup cost before celebrating the per-message cost. A communication advantage that depends on resources prepared elsewhere is real, but it is a systems claim, not a magic trick.

When a networking claim cites this protocol

If a pitch invokes superdense coding, walk the chain: where does the entanglement come from, how is it distributed and stored, how long does it survive, what do channel loss and gate errors do to decoding, and does the end-to-end system beat the classical alternative after all of that?

The protocol itself is valid, demonstrated physics. The product claim stands or falls on the resource chain around it — and on whether doubling classical capacity on an expensive quantum channel is worth anything against cheap classical bandwidth.

Exercise

Two messages, full ledger. Write the state transitions for two different messages — say 01 and 10 — including Alice's encoding gate and Bob's decoding steps from the CNOT basis action. End with one sentence on whether the advantage survives setup and infrastructure costs.

• Submit: a resource table with shared Bell pairs, transmitted qubits, classical bits recovered, and decoding operations, plus the state after each gate for both messages.
• Check: confirm that nothing about Bob's half changes measurably until Alice's qubit arrives — the protocol sends nothing before the transmission.
• Baseline: compare against sending two classical bits with no pre-shared entanglement, and state precisely which resource changed.
• Repair: if you described the protocol as free two-bit capacity or remote signaling, rework Chapter 20 (Bell States and GHZ States) and Chapter 7 (Entanglement Without Faster-Than-Light Myths).

Check your understanding

From memory: account for entanglement, transmitted qubits, recovered bits, and decoding operations in superdense coding — and state what breaks if the Bell pair is lost or noisy.

Oral defense: a colleague claims superdense coding doubles bandwidth for free. Correct the claim in two sentences, ledger included.

If you get stuck

If the resource ledger keeps going missing, or the protocol is being compared against no baseline, return to Chapter 20 (Bell States and GHZ States) for the shared-state mechanics. Superdense coding is one circuit and one ledger; both have to be present.