Superdense Coding
Superdense coding is the cleanest proof that entanglement is not mystical decoration but a countable resource for communication. Introduced by Charles Bennett and Stephen Wiesner in 1992, the protocol does something that sounds impossible: it transmits two classical bits from a sender Alice to a receiver Bob while only one physical qubit ever travels down the quantum channel. A lone qubit cannot do this — the Holevo bound caps the accessible information of a single qubit at one bit — so the extra bit has to be bought somewhere. It is bought in advance, with a shared Bell pair. The setup is an accounting trick made physical. Before Alice knows what she wants to say, the two parties are each handed one half of a maximally entangled pair, — one ebit. When Alice is ready, she applies one of four local Pauli operations, , , , or , to her qubit alone. Those four operations rotate the shared pair into the four mutually orthogonal Bell states. She then sends her single qubit to Bob, who — now holding both halves — performs a Bell-state measurement and reads off the two-bit message with certainty. Nothing about the message ever lives in the qubit she sends: its reduced state is maximally mixed, the same for all four messages. The information rides the correlation, which only becomes readable once the two halves are reunited. The bookkeeping is exact and elegant: one qubit plus one ebit is worth two classical bits, the resource inequality . Read backwards in time, the same picture is quantum teleportation — the two are mirror images, together the founding primitives of entanglement-assisted communication.
- Superdense coding sends two classical bits by transmitting a single qubit, provided Alice and Bob pre-share one half each of a Bell pair (one ebit).
- Alice encodes her two-bit message with one of four local Pauli operations , mapping the shared onto one of the four orthogonal Bell states.
- Bob reunites Alice's transmitted qubit with his half and performs a Bell measurement — a CNOT followed by a Hadamard and readout — recovering deterministically.
- The transmitted qubit alone leaks nothing: its marginal is the maximally mixed for every message, so the Holevo bound is respected and an eavesdropper on the channel learns zero.
- With a partially entangled pair the capacity drops smoothly to bits; with linear-optics Bell measurement it is capped at bits.
- Key idea: the four Pauli operators applied locally to one half of a Bell pair generate the four orthogonal Bell states; one qubit transmission plus a Bell measurement then conveys two perfectly distinguishable classical bits.
The four Pauli operators applied locally to one half of a Bell pair generate the four orthogonal Bell states; a single qubit transmission plus a Bell measurement then conveys two perfectly distinguishable classical messages.
Where this lives today
Superdense coding is no longer just a textbook parable; it is the prototype for a whole branch of quantum Shannon theory and a recurring engineering target. Its direct descendant is the entanglement-assisted classical capacity of a noisy channel, the Bennett–Shor–Smolin–Thapliyal theorem, which is the one capacity in quantum information with a clean single-letter formula — superdense coding is the noiseless corner of that landscape. In photonic experiments the protocol runs headfirst into a famous obstacle: a linear-optics Bell-state analyzer can unambiguously resolve only two of the four Bell states, so the channel is capped at bits rather than the full two. Getting past that ceiling has driven real technology — hyperentanglement (extra qubits encoded in a photon's momentum or orbital angular momentum, pioneered by Kwiat's group) and atom–photon interfaces both restore a complete Bell measurement, and trapped-ion experiments with deterministic entangling gates reached the full channel capacity as early as 2004. The same primitive reappears in continuous-variable optics and in quantum-network architectures that trade pre-shared ebits between teleportation and dense-coding uses depending on whether the payload is quantum or classical.
The physical picture
A single qubit is a stingy messenger. Its state is one point on the Bloch sphere, and any measurement pulls out at most one bit — the Holevo bound for a two-dimensional system. So when Alice conveys two bits by sending one qubit, the second bit cannot be sitting inside that qubit. It is sitting in the correlation between her qubit and Bob's, a correlation established before Alice touched anything. Think of the shared Bell pair as a codebook physically split between the two parties: Alice's four local operations turn to one of four pages, but no page number is written on her single qubit. Bob, holding both halves, simply reads which page the reunited pair is on. The first figure walks the whole protocol from the shared ebit to the two recovered bits, and carries the resource count that names the entire subject.
The magic is entirely in the four-way branching of the encoding. Because is maximally entangled, acting on Alice's qubit with a Pauli is enough to walk the global state around a set of four orthogonal — hence perfectly distinguishable — states. The deep symmetry to keep in mind is that superdense coding is the exact time-reverse of teleportation: teleportation spends one ebit and two classical bits to move one qubit; superdense coding spends one ebit and one qubit to move two classical bits. Reverse the arrow of time and swap the quantum and classical channels, and one becomes the other. The second figure is the dictionary at the heart of the encoding — which Pauli produces which Bell state, and why the sent qubit stays mixed throughout.
The core equations
The starting resource is one shared Bell pair, one ebit, distributed before any message exists. It is the maximally entangled state of two qubits, and everything downstream is a consequence of its structure. Alice holds qubit , Bob holds qubit .
where: — the standard Bell state shared before the protocol; — Alice's and Bob's qubits respectively. Reading: the pair is perfectly correlated in the computational basis and maximally entangled, so tracing out either qubit leaves the other maximally mixed. The four Bell states are the target of the encoding. They are an orthonormal basis of the two-qubit Hilbert space, which is exactly why a measurement can name them without error. Alice never sees more than one qubit of this basis, but her operation moves the joint state between its four members.
where: the four states are mutually orthogonal, , forming a basis of . Reading: because they span the space and are orthogonal, a single projective measurement distinguishes all four with certainty. The encoding map is the protocol's engine. Alice applies one of four Pauli operators to her qubit only, and each choice sends the shared to a different Bell state. This is the step where two classical bits get written into the joint state.
where: — the two classical bits Alice wishes to send; — the Pauli operation applied to qubit ; — the resulting Bell state, from . Reading: the bit controls the phase flip and the bit controls the bit flip , so up to a global phase. The transmitted qubit carries no local information at any point. Tracing Bob's half out of any Bell state yields the same maximally mixed marginal, identical for all four messages, which is why interception of the channel qubit is worthless.
where: — partial trace over Bob's qubit; — the maximally mixed single-qubit state. Reading: the four encoded states have identical marginals, so no measurement on the channel qubit alone can distinguish the messages — the information is nonlocal. The whole feat is summarized by a resource inequality, the grammar of quantum Shannon theory. It says the resources on the left can accomplish anything the resources on the right can, and the equality is achieved by the protocol above.
where: ebit — one shared maximally entangled Bell pair; cbit — one noiseless classical bit; — "can simulate / is at least as powerful as". Reading: run the same relation backwards with the channels swapped and you get teleportation, . Finally, the Holevo bound is the ceiling the protocol must respect, and the reason the second bit must be bought with entanglement rather than smuggled in the qubit.
where: — Holevo quantity, an upper bound on accessible information; — von Neumann entropy; — Hilbert-space dimension. Reading: for an unassisted single qubit so ; the pre-shared ebit lifts the effective signal space to the four-dimensional two-qubit space where can reach .
The encoding step is the entire trick of the protocol, so it earns a direct verification rather than an appeal to authority. We act with each of the four Pauli operators on Alice's half of the shared , read off the resulting two-qubit state, and confirm that the four outputs are exactly the four Bell states — and that they are mutually orthogonal. Orthogonality is not a nicety here: it is precisely what lets Bob name the state with certainty, so establishing it is the same as establishing that the channel really delivers two clean bits and not some blurred fraction of them.
Step 1. Message , operator : . The state is untouched. Why: the "do nothing" branch has to be one of the four outcomes, and it anchors the dictionary at .
Step 2. Message , operator : swaps on Alice's qubit, so and , giving . Why: a bit flip moves the pair off the "same" subspace onto the "different" subspace, converting a into a .
Step 3. Message , operator : leaves alone and sends , so , giving . Why: a phase flip flips the relative sign, the only other degree of freedom in the Bell basis besides the bit pattern.
Step 4. Message , operator : apply then . After the state is ; then on the first qubit flips the sign of , giving . Note up to phase, so this branch is the -Pauli. Why: combining the flip and the phase reaches the last, antisymmetric Bell state, completing the basis.
Step 5. Orthonormality: each output is manifestly normalized, and any two differ either in their bit pattern (the pair versus the pair are supported on orthogonal computational states) or in a relative sign (which flips one inner-product term), so all six cross inner products vanish: . Why: distinctness is not enough — mutual orthogonality is what makes a single measurement resolve all four without error.
Go deeper · Derivation B · 1 minDecoding by a CNOT and a Hadamard
Bob cannot read the message until he can name which Bell state he holds, and a projective Bell measurement is not something laboratory hardware performs directly — the entangled basis must first be rotated into the computational basis, where an ordinary readout works. The standard decoder applies a CNOT controlled by the transmitted qubit onto Bob's stored qubit , followed by a Hadamard on , after which measuring both qubits in the computational basis returns the two bits. We push all four Bell states through this fixed circuit and confirm the four outputs are the four distinct strings .
Step 1. The circuit is , then computational readout. CNOT flips iff ; the Hadamard on turns into or . Why: CNOT untangles the correlation into a product, and the Hadamard converts the surviving superposition into a definite bit.
Step 2. On : CNOT gives , then gives — outcome . Why: the symmetric, same-bit Bell state decodes to the all-zero string, matching .
Step 3. On : CNOT gives , then gives — outcome , matching . Why: the different-bit symmetric state carries in Bob's qubit, which the CNOT deposits cleanly.
Step 4. On : CNOT gives , then gives — outcome , matching . Why: the relative minus sign becomes under the Hadamard, which reads phase as a bit.
Step 5. On : CNOT gives , then gives — outcome , matching . The four outputs are distinct, so the decoder is deterministic. Why: with all four Bell states mapped to all four strings, Bob's ordinary two-qubit measurement is a perfect Bell-state analyzer.
Go deeper · Derivation C · 1 minWhy one unassisted qubit cannot beat one bit
It is tempting to imagine the qubit Alice sends simply "holds" two bits, but that would smash a hard limit on quantum communication, so the second bit must be located somewhere other than the channel qubit. Here we prove the limit itself. For any ensemble of single-qubit signal states an eavesdropper or receiver might prepare and measure, the Holevo quantity — an upper bound on the accessible classical information — cannot exceed one bit, because a single qubit's von Neumann entropy is at most . The bound forces the resolution: the extra bit is supplied by the pre-shared ebit, which enlarges the signal space to four dimensions.
Step 1. Alice, unassisted, encodes her message in single-qubit states sent with probabilities ; the receiver's accessible information obeys . Why: the Holevo theorem is the tight information ceiling for any preparation-and-measurement scheme, so bounding bounds everything.
Step 2. Write the Holevo quantity with . Since , the subtracted term only helps, so . Why: dropping a non-negative term gives a clean upper bound that depends only on the average state.
Step 3. The average state is a single-qubit density matrix, and the entropy of a -dimensional state is at most , so . Hence . Why: a lone qubit lives in a two-dimensional space, and no ensemble of such states carries more than one accessible bit.
Step 4. In superdense coding the distinguishable signal states are the two-qubit Bell states, living in a four-dimensional space made accessible by the shared ebit, so the ceiling rises to . The doubling is bought, not free. Why: entanglement does not overfill the qubit — it changes which Hilbert space the message really lives in. *The key numerical anchors are bit for an unassisted single qubit and bits for the four-dimensional two-qubit space made available by the ebit.*
Limiting cases
The advantage is only as good as the shared entanglement. Strip it away and the protocol degrades to an ordinary one-bit channel; degrade the pair partially and the capacity slides smoothly between one and two bits.
| Case | Result | Meaning |
|---|---|---|
| No shared entanglement | Without an ebit the single qubit obeys the Holevo bound; the protocol collapses to plain one-bit transmission. | |
| Perfect ebit | The four encoded states are exactly orthogonal, so Bob decodes both bits deterministically. | |
| Partially entangled pair | For the encoded states are non-orthogonal; the recoverable information lies strictly between 1 and 2 bits. | |
| Noisy / decohered pair | Depolarization blurs the Bell states, lowering the rate below 2 and eventually below 1 as grows. | |
| Linear-optics Bell measurement | Only two of the four Bell states are unambiguously distinguishable with linear optics, capping the gain short of two. |
Worked examples
1 · Sending the message 11, traced end to end (fully worked)
Alice wants to send . Follow the shared state through her encoding, the transmission, and Bob's decoding, tracking amplitudes and the transmitted qubit's marginal.
Step 1. Start from the shared ebit , Alice holding and Bob holding . The message selects the operator .
Step 2. Encode. Apply to Alice's qubit: . Then apply to Alice's qubit, flipping the sign of : . The shared pair is now the singlet, .
Step 3. Transmission. Alice sends qubit to Bob. Its marginal is — maximally mixed, so anyone intercepting only this qubit learns nothing about .
Step 4. Decode. Bob now holds both qubits and runs the decoder. CNOT gives ; the Hadamard on gives . Measuring in the computational basis yields with probability 1.
Step 5. Consistency check: the encode–decode pair is deterministic, maps and the decoder maps , closing the loop. Two classical bits delivered by transmitting one qubit, with no channel leakage.
2 · Capacity from a partially entangled pair (fully worked numbers)
Alice and Bob share with instead of the maximally entangled . Using the standard four-Pauli encoding, how many classical bits can Alice convey?
Step 1. The capacity of the four-Pauli superdense scheme on a shared pure state is , where is Alice's marginal and is the von Neumann entropy in bits. This interpolates between (no entanglement) and (maximal entanglement).
Step 2. Compute the marginal. Tracing out Bob, . For , and , so .
Step 3. Its entropy is the binary entropy .
Step 4. Capacity: . The imperfect pair leaks about bit of the ideal two, because the four encoded states are no longer perfectly orthogonal and Bob's measurement occasionally confuses them. At the channel carries 1.81 bits, versus 2 bits for a perfect ebit and 1 bit with no entanglement.
Physics of the portrait
Superdense coding did not fall out of an experiment — it fell out of taking entanglement seriously as a resource you could budget, spend, and convert. That accounting-first way of thinking is the signature of Charles Bennett, who spent a career turning slippery quantum phenomena into hard currency.
Origins · 1 minCharles Bennett and how this was discovered
Charles H. Bennett is, more than any single figure, the architect of quantum information as a discipline of countable resources. In the 1970s he established the thermodynamics of computation, showing that logically reversible computation can in principle dissipate no energy and clarifying Landauer's principle that only erasure has an unavoidable cost. In 1984, with Gilles Brassard, he invented the BB84 protocol, the first quantum key distribution scheme. Then came the pair of results that define this article's neighbourhood: superdense coding with Stephen Wiesner in 1992, and quantum teleportation in 1993 with Brassard, Crépeau, Jozsa, Peres, and Wootters — discovered almost together and quickly recognized as time-reverse duals. Bennett went on to help build the quantitative theory of entanglement itself: entanglement distillation, the entanglement of formation, and the entanglement-assisted classical capacity (with Shor, Smolin, and Thapliyal). His unifying move throughout was to treat qubits, ebits, and cbits as interconvertible units obeying resource inequalities — the language in which superdense coding reads as a single clean line.
Going further
Texts. Nielsen and Chuang, Quantum Computation and Quantum Information, §2.3 (superdense coding) and §1.3.6 · Preskill, Lecture Notes for Physics 219, Ch. 4 · Watrous, The Theory of Quantum Information, chapter on resource conversion · Wilde, Quantum Information Theory, Ch. 6 (three unit protocols) and Ch. 11 (Holevo bound) · Mermin, Quantum Computer Science, Ch. 6 · Bennett and Wiesner, Phys. Rev. Lett. 69, 2881 (1992). The encoding identities follow from direct Pauli matrix computation; the CNOT–Hadamard decoder maps the four Bell states to the four distinct computational outputs . The partial-entanglement capacity is the standard pure-state dense-coding result, giving bits and hence bits at .
Prerequisites. Bell-State Measurement · Pauli operators and the Bell basis · Entanglement and the maximally entangled state. Leads to. Quantum Teleportation · Entanglement Swapping · Entanglement-assisted classical capacity.
Ask the tutor: Ask me to walk any message through the full encode-transmit-decode cycle, or to work out the capacity of a noisy or partially entangled pair step by step.
How can one qubit carry two bits without breaking the Holevo bound?
The Holevo bound limits the accessible information of an unassisted qubit to one bit, and superdense coding never violates it. The message is not stored in the single qubit Alice transmits — its state is the maximally mixed for all four messages, which carries zero accessible information on its own. What actually carries the two bits is the joint two-qubit state, which lives in a four-dimensional Hilbert space where up to bits are allowed. That four-dimensional signal space is made available by the pre-shared ebit. So the bound applies to a different object (one qubit, ) than the one doing the work (two qubits, ), and both statements are true at once.
What exactly is an ebit, and where does the second bit come from?
An ebit is one unit of entanglement: a shared maximally entangled two-qubit state such as , one half held by each party. It is the currency of entanglement-assisted communication. In superdense coding the first bit is the ordinary capacity of sending one qubit, and the second bit is "paid for" by consuming the ebit. Concretely, the ebit is what makes Alice's four local Pauli operations map to four orthogonal global states — without it, four Paulis on a product state would give at most two distinguishable outcomes. The ebit must be distributed in advance, before Alice knows her message, which is why dense coding is useful precisely when entanglement is cheap to pre-share but channel use is precious.
Why is the transmitted qubit useless to an eavesdropper?
Because its reduced density matrix is — the maximally mixed state — for every one of the four messages. An eavesdropper who taps the channel and captures Alice's qubit holds a state that is statistically identical regardless of whether she sent 00, 01, 10, or 11, so no measurement can extract any information about the message. This is a direct consequence of being maximally entangled: tracing out one half of any Bell state always leaves the other half maximally mixed. The message only becomes readable when the two halves are physically reunited and measured together, which is exactly what makes the correlation, not the qubit, the carrier of information.
How is superdense coding the mirror image of teleportation?
They are time-reverse duals with the quantum and classical channels swapped. Teleportation consumes one ebit and two classical bits to transmit one qubit: . Superdense coding consumes one ebit and one qubit to transmit two classical bits: . In both, the shared ebit is the catalyst, and both use the same hardware — a Bell measurement and local Pauli corrections. Run one protocol's circuit backwards and reinterpret which lines are quantum and which are classical, and you land on the other. This symmetry is why Bennett's group discovered them within a year of each other, and why they are taught as the two founding "unit protocols".
What happens if the shared pair is only partially entangled or noisy?
The clean two-bit result degrades gracefully. For a partially entangled pure state , the four Pauli-encoded states are no longer perfectly orthogonal, and the capacity falls to bits — exactly when (no entanglement) and when (maximal). For a noisy pair, modelled as a Werner-like mixture of with the maximally mixed state, the Bell states blur together and the rate drops below two and eventually below one as the noise grows. The lesson is the same throughout: the advantage tracks the quality of the entanglement, not the qubit.
Why can't linear optics do a complete Bell measurement, and what is the fix?
With only beam splitters, phase shifters, and photodetectors — linear optics — one can unambiguously identify only two of the four Bell states of a photon pair (the two antisymmetric-under-swap ones), while the other two produce identical detector patterns and cannot be told apart. That leaves three distinguishable outcomes, capping the dense-coding channel at bits instead of the ideal two. The workarounds add a resource: hyperentanglement encodes an auxiliary degree of freedom (such as momentum or orbital angular momentum) so the Bell analyzer becomes complete, or one uses an atom–photon interface or trapped ions, where deterministic entangling gates give a full Bell measurement. Trapped-ion experiments reached the complete two-bit capacity as early as 2004.
Does superdense coding let Alice signal faster than light?
No. The two bits do not become available to Bob until Alice's qubit physically arrives, and that qubit travels down an ordinary channel at or below the speed of light. Before it arrives, Bob holds only his half of the ebit, whose marginal is the useless — he can extract nothing. Entanglement supplies correlation, but correlation alone transmits no message: Alice's local Pauli operation has no observable effect on Bob's qubit until the two halves are brought together. This is the same no-signalling principle that protects relativity in every entanglement-based protocol; superdense coding merely uses the pre-shared correlation to double the classical payload of a legitimately transmitted qubit.