Superdense Coding

Superdense coding is an entanglement-assisted communication protocol in which Alice sends one of four classical messages by applying a local Pauli operator to her half of a shared Bell pair and then physically transmitting that qubit to Bob. Once Bob holds both qubits, a Bell-basis decoder identifies the message without error.

The ideal resource statement is

$$[qq] +[q\to q] \succeq 2[c\to c].$$

One shared ebit and one noiseless qubit transmission produce two classical bits of forward communication. The ebit is consumed. The statement is not that an isolated qubit always carries two accessible classical bits, nor that entanglement sends a message by itself.

Canonical Scope

This page is the canonical home for the qubit superdense-coding protocol: its message convention, four Bell codewords, encoding and decoding circuit, Holevo-information accounting, qudit generalization, imperfect-resource capacity, and experimental performance contract.

Bell States owns the states as an orthonormal basis. Single-Qubit Gates and Multi-Qubit Gates own the Pauli, Hadamard, and controlled-NOT operations. Communication with Quantum Systems owns the wider family of assisted capacities. Quantum Teleportation owns the complementary state-transfer protocol.

Protocol Contract

The ideal task has five declared ingredients:

1. Alice and Bob initially share $|\Phi^+\rangle_{AB}=(|00\rangle+|11\rangle)/\sqrt2$.
2. After that entanglement is distributed, Alice receives a uniformly chosen message $(a,b)\in\{0,1\}^2$.
3. Alice applies one of four local Pauli operations to qubit $A$.
4. Alice sends qubit $A$ through one noiseless qubit channel to Bob.
5. Bob performs a joint Bell-basis measurement and outputs $(\widehat a,\widehat b)$.

Ideal success means

$$\Pr \left[ (\widehat a,\widehat b)=(a,b) \right] = 1.$$

The timing matters. The Bell pair is a preshared resource, independent of the later message. The forward qubit transmission is an actual communication event. If the Bell pair must first be distributed through the same counted channel, that earlier use belongs in the resource ledger.

Four Messages from Four Bell States

Alice encodes the phase bit $a$ and parity bit $b$ with

$$U_{ab} = Z^aX^b.$$

The rightmost operator acts first, so the circuit applies $X^b$ and then $Z^a$. Acting on Alice’s half of $|\Phi^+\rangle$ gives four codewords:

$a$	$b$	$U_{ab}$	encoded state
$0$	$0$	$I$	$
$1$	$0$	$Z$	$
$0$	$1$	$X$	$
$1$	$1$	$ZX$	$

The possible global phase of the last row under a different Pauli ordering has no observable effect. What matters is that the four messages map to four orthogonal joint states.

A compact expression is

$$|\beta_{ab}\rangle = (Z^aX^b\otimes I)|\Phi^+\rangle = \frac{1}{\sqrt2} \sum_{j=0}^{1} (-1)^{a(j\oplus b)} |j\oplus b\rangle_A|j\rangle_B.$$

Here $\oplus$ denotes addition modulo two. The bit $b$ selects equal versus different computational-basis values, while $a$ selects the relative phase.

Orthogonality proof

For a maximally entangled qubit pair,

$$\langle\Phi^+| (M\otimes I) |\Phi^+\rangle = \frac12\operatorname{Tr}M.$$

Therefore

$$\begin{aligned} \langle\beta_{ab}|\beta_{a'b'}\rangle &= \frac12 \operatorname{Tr} \left( U_{ab}^\dagger U_{a'b'} \right) \\ &= \delta_{aa'}\delta_{bb'}, \end{aligned}$$

because the four Pauli operators are orthogonal under the Hilbert–Schmidt inner product. Bob can distinguish the codewords perfectly once both qubits are in his laboratory.

Circuit and Decoder

Canonical qubit superdense coding. Alice encodes $(a,b)$ with $X^b$ followed by $Z^a$ and sends qubit $A$. Bob applies $\operatorname{CNOT}_{A\to B}$ and $H_A$, the inverse Bell transform, then measures both qubits to recover $a$ and $b$.

The decoding unitary is

$$D = (H_A\otimes I_B) \operatorname{CNOT}_{A\to B}.$$

Apply the controlled-NOT to the explicit codeword:

$$\begin{aligned} \operatorname{CNOT}_{A\to B} |\beta_{ab}\rangle &= \frac{1}{\sqrt2} \sum_{j=0}^{1} (-1)^{a(j\oplus b)} |j\oplus b\rangle_A |b\rangle_B \\ &= H|a\rangle_A \otimes |b\rangle_B. \end{aligned}$$

The final Hadamard gives

$$D|\beta_{ab}\rangle = |a\rangle_A|b\rangle_B.$$

A computational-basis measurement therefore reads the original two-bit message. This derivation also fixes the bit convention: the first measured wire is the phase bit $a$, and the second is the parity bit $b$. Software frameworks may print bitstrings in the opposite order, so an implementation must state its wire and readout conventions.

Where the Two Bits Reside

The message is not locally visible in either half of the encoded Bell pair. For every $(a,b)$,

$$\operatorname{Tr}_B |\beta_{ab}\rangle\langle\beta_{ab}| = \operatorname{Tr}_A |\beta_{ab}\rangle\langle\beta_{ab}| = \frac I2.$$

Before Alice sends qubit $A$, Bob holds only $B$ and sees the same state $I/2$ for all four messages. This is required by No-Cloning and No-Signaling. After the transmission, Bob holds the joint system $AB$, and the message is available in correlations between its two parts.

This is an example of a recurring principle: local states can be identical while joint states are perfectly distinguishable. Entanglement changes which global codewords Alice can reach by acting locally before she sends her subsystem.

Holevo Information and the Dimension Bound

Without preshared entanglement, Alice can encode a classical variable $M$ into qubit states $\rho_m$. The Holevo quantity obeys

$$\begin{aligned} \chi &= S\left(\sum_m p_m\rho_m\right) - \sum_m p_m S(\rho_m) \\ &\leq \log_2\dim\mathcal H_A = 1. \end{aligned}$$

Thus the unassisted classical capacity of a noiseless qubit channel is one bit per channel use, even though the Bloch sphere contains continuously many pure states.

In dense coding, Bob decodes an ensemble on the joint four-dimensional system $AB$. For four equiprobable Bell states,

$$\overline\rho_{AB} = \frac14 \sum_{a,b} |\beta_{ab}\rangle\langle\beta_{ab}| = \frac{I_{AB}}4.$$

Each codeword is pure, so

$$\chi_{\mathrm{DC}} = S\left(\frac{I_{AB}}4\right) -0 = 2.$$

There is no violation of the Holevo bound. The relevant receiver system has dimension four because Bob combines the transmitted qubit with his preshared half. The extra dimension was not free: it came with the entangled resource.

Resource Accounting

The protocol consumes:

• one Bell pair shared before the message is chosen;
• one local Pauli encoding;
• one forward qubit transmission;
• one joint two-qubit decoder;
• two final binary measurements.

It produces two classical message bits in the ideal one-shot protocol. The resource inequality

$$[qq] +[q\to q] \succeq 2[c\to c]$$

must be read with those timing and quality assumptions.

If Bob creates $|\Phi^+\rangle$ locally and sends half to Alice through the same channel being counted, then one use distributes the ebit and a second use returns Alice’s encoded half. Sending two classical bits required two qubit transmissions across that link. Dense coding becomes an advantage when entanglement is genuinely available as prior assistance, perhaps created during idle time, supplied by a separate link, or amortized within a larger resource protocol.

The protocol also consumes the ebit. After ideal decoding, the state is the product codeword $|ab\rangle$, and the Bell entanglement is gone. Reusing the protocol requires another shared entangled pair.

Teleportation has the complementary resource inequality

$$[qq] +2[c\to c] \succeq [q\to q].$$

The two protocols exchange the roles of classical and quantum communication, but neither makes communication free. Dense coding still sends a qubit; teleportation still sends two classical bits.

Qudit Generalization

Let Alice and Bob share the maximally entangled state

$$|\Phi_d\rangle = \frac1{\sqrt d} \sum_{j=0}^{d-1} |j\rangle_A|j\rangle_B.$$

Define generalized shift and phase operators

$$X|j\rangle = |j+1\bmod d\rangle, \qquad Z|j\rangle = \omega^j|j\rangle, \qquad \omega=e^{2\pi i/d}.$$

Alice applies one of the $d^2$ Weyl operators

$$U_{mn} = Z^mX^n, \qquad m,n\in\{0,\ldots,d-1\}.$$

The resulting states

$$|\beta_{mn}^{(d)}\rangle = (U_{mn}\otimes I)|\Phi_d\rangle$$

are orthonormal because

$$\langle\beta_{mn}^{(d)} | \beta_{m'n'}^{(d)}\rangle = \frac1d \operatorname{Tr} \left( U_{mn}^\dagger U_{m'n'} \right) = \delta_{mm'}\delta_{nn'}.$$

One transmitted $d$-level system can therefore select among $d^2$ messages, or carry

$$\log_2 d^2 = 2\log_2 d$$

classical bits, given one preshared maximally entangled qudit pair and a complete generalized Bell measurement.

Imperfect Shared Entanglement

Suppose Alice and Bob share an arbitrary state $\rho_{AB}$, Alice’s subsystem has dimension $d_A$, the forward channel is ideal, and Alice uses a complete orthogonal unitary ensemble with equal probabilities. The encoded states are

$$\rho_{mn} = (U_{mn}\otimes I) \rho_{AB} (U_{mn}^\dagger\otimes I).$$

Unitary invariance gives

$$S(\rho_{mn}) = S(\rho_{AB}).$$

The complete unitary average depolarizes Alice’s subsystem:

$$\overline\rho_{AB} = \frac{I_A}{d_A} \otimes \rho_B.$$

The Holevo quantity of this standard dense-coding ensemble is therefore

$$\begin{aligned} \chi_{\mathrm{DC}} &= S(\overline\rho_{AB}) - S(\rho_{AB}) \\ &= \log_2d_A +S(\rho_B) -S(\rho_{AB}) \\ &= \log_2d_A -S(A|B)_\rho. \end{aligned}$$

This formula assumes the declared unitary encoding family and ideal transmission; it is an asymptotic Holevo rate when collective code construction and decoding are allowed. It should not be read as a guarantee of that many perfectly distinguishable messages in one shot.

The shared state gives a dense-coding advantage over the ordinary $\log_2d_A$-bit baseline precisely when

$$S(A|B)_\rho = S(\rho_{AB})-S(\rho_B) < 0.$$

Negative quantum conditional entropy implies entanglement, but not every entangled mixed state has negative conditional entropy. Entanglement is therefore not automatically useful for this particular coding task.

If the formula falls below the unassisted baseline, Alice can ignore the poor resource and use an ordinary orthogonal encoding. With that option included, the available rate is at least

$$\max \left\{ \log_2d_A,\, \log_2d_A-S(A|B)_\rho \right\}.$$

Partially entangled pure pair

For

$$|\psi_\lambda\rangle = \sqrt\lambda\,|00\rangle +\sqrt{1-\lambda}\,|11\rangle,$$

the joint entropy vanishes and Bob’s entropy is the binary entropy

$$h_2(\lambda) = -\lambda\log_2\lambda -(1-\lambda)\log_2(1-\lambda).$$

The asymptotic dense-coding rate is

$$\chi_{\mathrm{DC}} = 1+h_2(\lambda).$$

It ranges from one bit for a product state to two bits for a Bell pair. Except at maximal entanglement, the four Pauli codewords are not all orthogonal, so this fractional asymptotic rate is not a deterministic four-message one-shot protocol.

A Pauli-Noise Example

Let the transmitted qubit pass through a Pauli channel

$$\mathcal P(\rho) = \sum_{P\in\{I,X,Y,Z\}} p_P P\rho P, \qquad \sum_P p_P=1.$$

A Pauli error on Alice’s transmitted half permutes the Bell basis. After the ideal decoder, Bob sees the intended two-bit label plus an additive two-bit error determined by $P$. With uniform messages, the induced classical channel has rate

$$I(M;\widehat M) = 2 -H_4(p_I,p_X,p_Y,p_Z),$$

where

$$H_4(\mathbf p) = -\sum_P p_P\log_2p_P.$$

The formula has useful checks:

• if one known Pauli occurs with probability one, it can be calibrated away and the rate is two bits;
• if all four Paulis are equally likely, the Bell label is fully randomized and the rate is zero;
• intermediate noise turns the perfect decoder into a four-symbol confusion channel.

For general noisy channels and unrestricted asymptotic coding, the relevant quantity is the entanglement-assisted classical capacity

$$C_E(\mathcal N) = \max_{\rho_A} I(R;B)_{(\mathcal I_R\otimes\mathcal N)(\phi_{RA})}.$$

That capacity theorem belongs to Communication with Quantum Systems. The Bell-pair protocol here is its most elementary noiseless qubit example.

Experimental Realization

An experiment must implement more than four nominal encoder settings. It must prepare entanglement, preserve coherence during transmission, and distinguish the Bell codewords with a calibrated joint measurement.

A useful report includes:

• the shared-state fidelity or a fuller state characterization;
• encoder process quality for all four Pauli settings;
• channel loss, noise, and accepted-trial definition;
• the full conditional matrix $p(\widehat a,\widehat b|a,b)$;
• average success probability and uncertainty;
• mutual information in bits per accepted trial and bits per attempted trial;
• wall-clock throughput and all preshared-resource costs.

The first photonic dense-coding demonstration transmitted three messages, not the ideal four, because its linear-optical analyzer did not provide a complete deterministic Bell measurement. Three equiprobable messages carry $\log_2 3\approx1.585$ bits. This was an important demonstration, but it is not numerically identical to the ideal two-bit protocol.

Passive linear optics with ordinary ancillas and photodetection has intrinsic Bell-analysis restrictions. Additional degrees of freedom, auxiliary entanglement, nonlinear interactions, matter qubits, or more elaborate detectors can change the measurement model. Any claim of “deterministic dense coding” must state which Bell states are resolved, whether outcomes are unambiguous, and which trials are discarded.

Common Mistakes

• Saying that one isolated qubit contains two readable classical bits.
• Omitting the preshared Bell pair from the resource ledger.
• Counting entanglement distribution as free when it uses the same channel.
• Forgetting that Alice must physically send her qubit.
• Assuming Bob can read the message from his original half alone.
• Swapping the phase and parity bit conventions in the decoder.
• Treating a global phase from $XZ=-ZX$ as a different codeword.
• Claiming that any entangled mixed state provides a dense-coding advantage.
• Confusing an asymptotic Holevo rate with a deterministic one-shot message count.
• Reporting only postselected Bell-measurement fidelity while omitting loss, inconclusive outcomes, or the complete confusion matrix.

Exercises

1. Build the encoding table

Starting from $|\Phi^+\rangle$, apply $I$, $Z$, $X$, and $ZX$ to Alice’s qubit and recover the four Bell states.

Solution

Direct application gives

$$\begin{aligned} (I\otimes I)|\Phi^+\rangle &= |\Phi^+\rangle, \\ (Z\otimes I)|\Phi^+\rangle &= |\Phi^-\rangle, \\ (X\otimes I)|\Phi^+\rangle &= |\Psi^+\rangle, \\ (ZX\otimes I)|\Phi^+\rangle &= |\Psi^-\rangle. \end{aligned}$$

The last equality follows from $ZX|0\rangle=-|1\rangle$ and $ZX|1\rangle=|0\rangle$ under the standard Pauli matrices, giving the same Bell ray up to the convention for an overall phase.

2. Verify the decoder algebra

Show explicitly that $(H\otimes I)\operatorname{CNOT}|\Psi^-\rangle=|11\rangle$.

Solution

First,

$$\operatorname{CNOT} |\Psi^-\rangle = \frac{|01\rangle-|11\rangle}{\sqrt2} = |-\rangle|1\rangle.$$

Since $H|-\rangle=|1\rangle$,

$$(H\otimes I) \operatorname{CNOT} |\Psi^-\rangle = |11\rangle.$$

The top measurement returns the phase bit and the bottom measurement returns the parity bit.

3. Compute the ideal Holevo quantity

For four equiprobable Bell codewords, calculate the Holevo quantity.

Solution

The Bell states form an orthonormal basis, so their uniform average is $I_4/4$. Each codeword is pure. Therefore

$$\chi = S(I_4/4) - \frac14\sum_{a,b}S(|\beta_{ab}\rangle\langle\beta_{ab}|) = 2-0 = 2$$

bits.

4. Locate the message before transmission

Prove that Bob’s original qubit contains no information about $(a,b)$ before Alice’s qubit arrives.

Solution

Every encoded state is a Bell state, and every Bell state has maximally mixed one-qubit marginals:

$$\rho_B^{ab} = \operatorname{Tr}_A |\beta_{ab}\rangle\langle\beta_{ab}| = \frac I2.$$

Thus the ensemble available to Bob before transmission is independent of the message. Any local measurement has the same outcome distribution for all $(a,b)$. The message becomes accessible only after Bob receives $A$ and can measure $AB$ jointly.

5. Partially entangled resource

For $\lambda=0.9$, compute the asymptotic dense-coding rate of $|\psi_\lambda\rangle$ and explain why it is not a four-message one-shot protocol.

Solution

The binary entropy is

$$h_2(0.9) = -0.9\log_2 0.9 -0.1\log_2 0.1 \approx 0.469.$$

Hence

$$\chi_{\mathrm{DC}} = 1+h_2(0.9) \approx 1.469$$

bits per use asymptotically. Because the state is not maximally entangled, the four Pauli-encoded states are not all orthogonal. A single joint measurement cannot identify four equiprobable labels perfectly.

6. Pauli-channel rate

Let $p_I=0.85$ and $p_X=p_Y=p_Z=0.05$. Find the mutual information of the uniform Bell-label scheme.

Solution

The four-symbol error entropy is

$$\begin{aligned} H_4 &= -0.85\log_2 0.85 -3(0.05\log_2 0.05) \\ &\approx 0.848. \end{aligned}$$

Therefore

$$I(M;\widehat M) = 2-H_4 \approx 1.152$$

bits per channel use for this encoding and decoder.

7. Count the distribution cost

Bob prepares a Bell pair, sends qubit $A$ to Alice, and later Alice uses dense coding to send $A$ back. If both transmissions use the same noiseless link, what is the net number of classical bits per forward-or-back channel use for this one-shot cycle?

Solution

The cycle uses the link once to distribute Alice’s half and once to return the encoded qubit. It communicates two classical bits in two quantum-channel uses, so the net rate is one classical bit per counted use. The ideal two-bits-per- use statement treats the Bell pair as prior assistance and counts only the message-bearing forward use.

8. Symmetric decoder errors

Suppose the correct two-bit label is reported with probability $1-\epsilon$, and each of the other three labels is reported with probability $\epsilon/3$. For uniform inputs, find the mutual information.

Solution

The output is uniform by symmetry, so $H(\widehat M)=2$. The conditional entropy is the entropy of one row of the confusion matrix:

$$H(\widehat M|M) = h_2(\epsilon) +\epsilon\log_2 3.$$

Thus

$$I(M;\widehat M) = 2 -h_2(\epsilon) -\epsilon\log_2 3.$$

This rate counts accepted trials. A complete experimental rate must also include inconclusive events, loss, and trial frequency.

Further Connections

• Bell States defines the codeword basis and local-Pauli labeling.
• Communication with Quantum Systems places dense coding inside the general resource and capacity framework.
• No-Cloning and No-Signaling explains why Bob’s preshared half cannot reveal Alice’s message locally.
• Quantum Teleportation gives the complementary ebit-assisted resource conversion.
• Entanglement Measures distinguishes possession of entanglement from usefulness for a declared task.
• Mutual Information develops the correlation quantity appearing in entanglement-assisted capacities.
• Pauli Channels owns the general noise model used in the worked communication example.
• Quantum Information Roadmap places dense coding after Bell states, channels, and no-go theorems.

References

1. C. H. Bennett and S. J. Wiesner, “Communication via one- and two-particle operators on Einstein–Podolsky–Rosen states,” Physical Review Letters 69, 2881–2884 (1992), doi:10.1103/PhysRevLett.69.2881.
2. A. Barenco and A. K. Ekert, “Dense coding based on quantum entanglement,” Journal of Modern Optics 42, 1253–1259 (1995), doi:10.1080/09500349514551091.
3. P. Hausladen, R. Jozsa, B. Schumacher, M. Westmoreland, and W. K. Wootters, “Classical information capacity of a quantum channel,” Physical Review A 54, 1869–1876 (1996), doi:10.1103/PhysRevA.54.1869.
4. K. Mattle, H. Weinfurter, P. G. Kwiat, and A. Zeilinger, “Dense coding in experimental quantum communication,” Physical Review Letters 76, 4656–4659 (1996), doi:10.1103/PhysRevLett.76.4656.
5. N. Lütkenhaus, J. Calsamiglia, and K.-A. Suominen, “Bell measurements for teleportation,” Physical Review A 59, 3295–3300 (1999), doi:10.1103/PhysRevA.59.3295.
6. C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thapliyal, “Entanglement-assisted classical capacity of noisy quantum channels,” Physical Review Letters 83, 3081–3084 (1999), doi:10.1103/PhysRevLett.83.3081.
7. S. L. Braunstein and H. J. Kimble, “Dense coding for continuous variables,” Physical Review A 61, 042302 (2000), doi:10.1103/PhysRevA.61.042302.
8. G. Bowen, “Classical information capacity of superdense coding,” Physical Review A 63, 022302 (2001), doi:10.1103/PhysRevA.63.022302.
9. T. Hiroshima, “Optimal dense coding with mixed state entanglement,” Journal of Physics A: Mathematical and General 34, 6907–6912 (2001), doi:10.1088/0305-4470/34/35/316.
10. R. F. Werner, “All teleportation and dense coding schemes,” Journal of Physics A: Mathematical and General 34, 7081–7094 (2001), doi:10.1088/0305-4470/34/35/332.
11. C. H. Bennett, P. W. Shor, J. A. Smolin, and A. V. Thapliyal, “Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem,” IEEE Transactions on Information Theory 48, 2637–2655 (2002), doi:10.1109/TIT.2002.802612.
12. C. Schuck, G. Huber, C. Kurtsiefer, and H. Weinfurter, “Complete deterministic linear optics Bell state analysis,” Physical Review Letters 96, 190501 (2006), doi:10.1103/PhysRevLett.96.190501.
13. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th anniversary ed., Cambridge University Press (2010).
14. M. M. Wilde, Quantum Information Theory, 2nd ed., Cambridge University Press (2017), doi:10.1017/9781316809976.
15. J. Watrous, The Theory of Quantum Information, Cambridge University Press (2018), doi:10.1017/9781316848142.