Channel Capacities & Coding Theorems
Classical, quantum and entanglement-assisted capacities.
Shannon gave every classical channel one number, its capacity, computed by a single-letter formula. A quantum channel has several capacities, depending on whether you send bits or qubits and whether you may use entanglement, and most of them come with a twist: entangled inputs across channel uses can help, so the formulas must be regularized over infinitely many uses. One capacity, remarkably, keeps Shannon's simplicity. This lesson proves the coding theorems and maps what is still unknown.
What you’ll learn
- State the Holevo–Schumacher–Westmoreland theorem and sketch its achievability (random coding, square-root measurement) and converse (Fano plus Holevo).
- Explain additivity, Hastings' counterexample, and why the classical capacity requires regularization.
- Define coherent information, state the Lloyd–Shor–Devetak theorem, and outline its decoupling proof; compute for degradable and antidegradable channels.
- Prove that the entanglement-assisted capacity is additive, and compare the capacities of standard channels.
Classical capacity: the HSW theorem
An code for a channel consists of input states on and a decoding POVM on that identifies each message with error at most . A rate is achievable if such codes exist with as , and the classical capacity is the supremum of achievable rates. The natural single-use quantity is the Holevo information of the channel
where pure input states and at most of them suffice.
Random coding. Fix an optimal ensemble and draw codewords i.i.d. from . Codeword is sent as the product state , and Bob receives .
Square-root measurement, built from the typical projector of the average output and the conditionally typical projector of each codeword.
The Hayashi–Nagaoka inequality, with and , splits the error into "the right codeword is atypical" and "a wrong codeword looks right".
Averaging over the codebook, each wrong codeword's output is distributed as , and a conditionally typical projector has rank at most . The bound tends to 0 whenever ; expurgating the worst half of the codewords makes the maximum error small too.
Converse. Fano's inequality, then the Holevo bound for the ensemble of codeword outputs, whose inputs may be entangled across the uses. Divide by and let .
For many channels the regularization is unnecessary because is additive, . King (2003) proved it for the qubit depolarizing channel , whose pure-state outputs have eigenvalues and , so . Additivity also holds for entanglement-breaking and unital qubit channels.
Superadditivity: why regularize
Hastings' channels are random-unitary channels in large dimension, mixing a few Haar-random unitaries, paired with their complex conjugates: feeding a maximally entangled state into yields an output with one large eigenvalue, purer than any product input achieves. The violation is small and the construction probabilistic; no explicit low-dimensional counterexample is known. Earlier, Werner & Holevo (2002) had refuted the related multiplicativity of maximal output -norms for large .
What does Hastings' result imply for the classical capacity?
- Quantum channels cannot carry classical information at the Holevo rate
- The classical capacity is uncomputable
- Entanglement shared between sender and receiver increases the classical capacity
- For some channels, codewords entangled across channel uses beat every product-input code, so must be defined by the regularized formula
Show the answer
D. For some channels, codewords entangled across channel uses beat every product-input code, so must be defined by the regularized formula
Non-additivity of gives non-additivity of , so can exceed . The extra rate comes from entangled inputs, not from pre-shared entanglement.
Quantum capacity: coherent information and LSD
Choose a random code subspace of dimension inside the typical subspace of , and let a reference be maximally entangled with it. Sending it through gives a pure state on .
The decoupling theorem: a random subspace leaves the environment almost uncorrelated with the reference whenever (Hayden, Horodecki, Winter & Yard, 2008).
Uhlmann's theorem. If is nearly a product with maximally mixed, the global pure state is close to one in which holds a purification of ; Uhlmann provides an isometry on alone that maps between them. That isometry is Bob's decoder: he recovers the entanglement with , hence any state in the code space.
Converse. For any code achieving fidelity , data processing for coherent information, (Schumacher & Nielsen, 1996), plus continuity of entropy give .
| Channel class | Quantum capacity | Example |
|---|---|---|
| Degradable: | , additive (Devetak & Shor, 2005) | Amplitude damping, : ; for , , attained near , not at |
| Antidegradable: | Amplitude damping with ; erasure with ; every entanglement-breaking channel | |
| Erasure, probability | (Bennett, DiVincenzo & Smolin, 1997) | degradable for |
| Qubit depolarizing | Unknown; hashing bound is not optimal | superadditive coherent information (DiVincenzo, Shor & Smolin, 1998) |
Entanglement assistance, and the landscape
is pure, so and .
For with any input : subadditivity, and the chain rule followed by "conditioning reduces entropy" (strong subadditivity).
Each term depends only on the marginal input . Product inputs achieve equality, so is additive. Achievability: share purifications of , let Alice apply random generalized Pauli operators to her half (superdense-coding style), and decode with HSW; the resulting ensemble has Holevo information .
For the qubit depolarizing channel with , the optimal input is and the Choi state has eigenvalues . Compute .
Show the answer
0.45 bits
, so , compared with . Entanglement more than doubles the rate here; as the ratio tends to 3 for qubits.
| Capacity | Formula | Single-letter in general? |
|---|---|---|
| Classical | No (Hastings, 2009) | |
| Quantum | No: coherent information is superadditive, and can be superactivated | |
| Private | (Devetak; Cai, Winter & Yeung) | No (Li, Winter, Zou & Guo, 2009) |
| Entanglement-assisted | Yes |
Key takeaways
- HSW: product-input codes achieve exactly ; with entangled inputs . The proof uses random coding, the square-root measurement and the Hayashi–Nagaoka inequality; the converse is Fano plus Holevo.
- Hastings (2009): minimum output entropy, hence , is not additive, so regularization is genuinely needed.
- LSD: with , proved by decoupling plus Uhlmann. Degradable channels: ; antidegradable: (no-cloning).
- BSST: is single-letter and additive by strong subadditivity, and .
- The quantum capacity of the qubit depolarizing channel is still unknown, and superactivation shows capacities are not even additive functions of channels.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
Which capacity of a general quantum channel is given by a single-letter formula, with no regularization?
- The classical capacity
- The entanglement-assisted capacity
- The quantum capacity
- The private capacity
Show the answer
B. The entanglement-assisted capacity
is additive by strong subadditivity, so one channel use tells the whole story. , and are all superadditive for some channels.
What is the quantum capacity of the amplitude-damping channel with ?
- About , the probability that the excitation survives
- It is unknown
Show the answer
D.
For the complementary channel (amplitude damping with ) can simulate Bob's output: the channel is antidegradable, so by the no-cloning argument.
What does superactivation (Smith & Yard, 2008) demonstrate?
- Two channels, each with zero quantum capacity, can have positive quantum capacity when used together
- Entanglement assistance doubles every capacity
- The classical capacity can exceed the Holevo information
- Quantum capacity can be increased by free classical feedback for every channel
Show the answer
A. Two channels, each with zero quantum capacity, can have positive quantum capacity when used together
A PPT channel (zero , but positive private capacity) and a 50% erasure channel (zero by symmetry) combine to give . Quantum capacity is not a function of the channels separately.
Why is the quantum capacity of a degradable channel equal to its single-letter coherent information?
- Because degradable channels are entanglement-breaking
- Because degradable channels have zero private capacity
- Because for degradable channels the coherent information is additive, so
- Because Bob can always simulate Alice's input
Show the answer
C. Because for degradable channels the coherent information is additive, so
If Bob can simulate Eve, becomes a conditional entropy of a degraded system, which is subadditive across uses (Devetak & Shor, 2005). The regularized limit then equals the one-shot value.
Further reading
- A. S. Holevo, "The capacity of the quantum channel with general signal states", IEEE Transactions on Information Theory 44, 269 (1998); B. Schumacher & M. D. Westmoreland, "Sending classical information via noisy quantum channels", Physical Review A 56, 131 (1997).
- S. Lloyd, "Capacity of the noisy quantum channel", Physical Review A 55, 1613 (1997); I. Devetak, "The private classical capacity and quantum capacity of a quantum channel", IEEE Transactions on Information Theory 51, 44 (2005).
- C. H. Bennett, P. W. Shor, J. A. Smolin & A. V. Thapliyal, "Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem", IEEE Transactions on Information Theory 48, 2637 (2002).
- M. B. Hastings, "Superadditivity of communication capacity using entangled inputs", Nature Physics 5, 255 (2009).
- G. Smith & J. Yard, "Quantum communication with zero-capacity channels", Science 321, 1812 (2008).