Quantum Shannon theory extends classical information theory to quantum systems, characterizing the fundamental limits of quantum communication, data compression, and channel capacity. Key results include the Holevo bound (an upper limit on classical information extractable from quantum states), Schumacher compression (the quantum analog of Shannon's source coding theorem, compressing quantum data to the von Neumann entropy rate), and the quantum channel capacity theorems (classical, quantum, and entanglement-assisted capacities of noisy quantum channels). The theory reveals that entanglement assistance can increase channel capacity, and that quantum information has a richer structure than classical.
Classical Shannon theory, founded by Claude Shannon in 1948, provides the mathematical framework for information transmission: the source coding theorem says data can be compressed to its entropy rate, and the channel coding theorem gives the maximum reliable transmission rate through a noisy channel. Quantum Shannon theory generalizes both results to quantum systems, revealing a richer landscape where multiple types of resources (qubits, classical bits, entanglement) interact.
Schumacher compression is the quantum source coding theorem. Just as Shannon showed that a classical source with entropy H can be compressed to H bits per symbol, Schumacher showed that a quantum source producing states from an ensemble {p_i, |psi_i>} can be faithfully compressed to S(rho) qubits per symbol, where S(rho) = -Tr(rho log rho) is the von Neumann entropy of the average state rho = sum_i p_i |psi_i><psi_i|. The von Neumann entropy is the quantum analog of Shannon entropy and plays the same foundational role throughout the theory.
The Holevo bound constrains how much classical information can be extracted from quantum states. If Alice encodes a classical message by preparing one of several quantum states and sending it to Bob, the maximum mutual information between Alice's message and Bob's measurement outcome is bounded by the Holevo quantity chi. For a single qubit, chi <= 1 bit (log 2), confirming that one qubit carries at most one classical bit without entanglement assistance. The bound can be achieved asymptotically using collective measurements across many copies.
Quantum channel capacity is where the theory becomes substantially richer than its classical counterpart. A quantum channel (a completely positive trace-preserving map) has three distinct capacities depending on the type of information being transmitted: the classical capacity C (maximum rate of classical bits), the quantum capacity Q (maximum rate of qubits), and the entanglement-assisted classical capacity C_E (maximum rate of classical bits when assisted by shared entanglement). The classical capacity is given by the regularized Holevo quantity. The quantum capacity is given by the regularized coherent information — and both regularizations are necessary, meaning the capacity per channel use can increase when multiple channels are used jointly (superadditivity). In contrast, C_E has a single-letter formula: it equals the quantum mutual information, which is always computable. This landscape — three capacities, superadditivity, the simplifying role of entanglement — is uniquely quantum and has no classical analog.
No topics depend on this one yet.