| quantum Shannon theory | |
|---|---|
| Name | Quantum Shannon theory |
| Field | Quantum information theory |
| Related | Classical information theory, Quantum physics |
| Notable instruments | Quantum channel, Quantum computer |
quantum Shannon theory
Quantum Shannon theory is the study of information transmission, compression, and resource interconversion when information carriers obey the laws of quantum mechanics rather than classical physics. It generalizes Claude Shannon's classical information theory to quantum systems, characterizing capacities of quantum channels, entanglement as a resource, and optimal coding theorems relevant to quantum communication and computation. The field bridges foundational aspects of Quantum physics with practical problems in quantum computing and quantum communication.
Quantum Shannon theory emerged in the latter half of the 20th century as researchers sought quantum analogues of classical results by Claude Shannon. Early work by Alexander Holevo (Holevo bound) and Benjamin Schumacher (quantum data compression, Schumacher coding) laid groundwork in the 1970s–1990s. The development of explicit capacity formulas, such as the HSW theorem and the Lloyd-Shor-Devetak theorem for quantum capacity, involved contributions from Gerard J. Milburn, Peter W. Shor, Charles H. Bennett, John A. Smolin, and Igor Devetak. Institutions including IBM, Google's Quantum AI, MIT, Caltech, and Perimeter Institute have been central nodes for theoretical and experimental advances. Conferences like QIP (Quantum Information Processing) and journals such as Physical Review A and IEEE Transactions on Information Theory regularly publish key results.
The mathematical formalism rests on finite-dimensional Hilbert spacees, density operators (states), and completely positive trace-preserving maps for channels. Core objects include qubits, quantum registers, and entangled states such as Bell states. Entropy measures adapted from classical theory include von Neumann entropy, quantum mutual information, and conditional entropy; notable inequalities include strong subadditivity proved by Elliott H. Lieb and Mary Beth Ruskai. The Holevo bound links accessible classical information to ensembles of quantum states. Tools from operator theory, representation theory, and convex optimization are routinely used. Quantum Shannon theory interfaces with quantum thermodynamics when considering cost of erasure and work extraction under information constraints.
A central goal is to define and compute capacities: classical capacity, quantum capacity, private capacity, and entanglement-assisted capacity. The HSW theorem gives achievable rates for classical information over quantum channels using ensembles and collective measurements. The Lloyd-Shor-Devetak theorem provides a regularized expression for quantum capacity based on coherent information; additivity questions (e.g., minimum output entropy) historically impeded closed forms until counterexamples by Matthew Hastings. Entanglement-assisted capacity admits a single-letter formula via the quantum mutual information (Bennett, Bennett–Shor–Smolin–Thapliyal results). Practical coding constructions draw from stabilizer code techniques, random coding arguments, and polar codes adapted to quantum channels (e.g., work by Erdal Arikan extensions).
Entanglement functions both as an information carrier and a consumable resource. Resource theories formalize interconversion rates between entanglement and communication resources: entanglement-assisted communication, entanglement distillation, and entanglement dilution. Key protocols include teleportation (Bennett et al.) and superdense coding, illustrating trade-offs between qubits, classical bits, and ebits. Measures such as entanglement of formation, distillable entanglement, and squashed entanglement connect to capacities and operational tasks. Results on resource inequalities and the quantum reverse Shannon theorem describe simulation of channels given entanglement and classical communication, linking to work by William Wootters and Igor Devetak.
Quantum Shannon theory informs and is informed by quantum error correction (QEC) and fault-tolerant quantum computing. Capacity theorems for quantum channels motivate achievable rates for QEC codes; the quantum capacity provides a theoretical limit to reliable transmission in the presence of noise modeled by channels such as depolarizing channel and amplitude damping channel. Stabilizer formalism and CSS codes (Calderbank–Shor–Steane) connect coding theory to capacities, while threshold theorems for fault tolerance relate physical error rates to logical reliability as studied in architectures by John Preskill and experimental platforms at IBM Quantum and Rigetti Computing. Concatenated codes, topological codes (e.g., Toric code by Alexei Kitaev), and subsystem codes are areas where operational capacity considerations meet practical QEC design.
Quantum Shannon theory formalizes tasks such as reliable transmission, private communication, entanglement distribution, and state merging. Protocols include channel coding, entanglement distillation (Bennett–Brassard–Popescu–Schumacher–Smolin–Wootters), quantum secret sharing, and quantum key distribution (QKD) protocols like BB84 and E91 that are analyzed using capacity and entropy tools. State redistribution and quantum state merging reveal surprising roles of negative conditional entropy and are linked to operational interpretations of conditional quantum entropy by Devetak and collaborators. Practical implementations interface with quantum optical systems (e.g., photonics platforms) and superconducting qubits used by industry and labs.
Applications span secure communication (QKD), quantum networks, distributed quantum computing, and foundations of thermodynamics. Open problems include single-letter formulas for various capacities, tight characterizations of additivity and regularization phenomena, and finite-blocklength bounds analogous to classical finite-blocklength theory (work by Yury Polyanskiy and others inspires quantum analogues). Scaling quantum networks raises questions in quantum network coding and multi-user channel capacities. Foundational implications touch on quantum causality and resource theories; progress requires interplay between mathematical physics, experimental platforms, and computer science techniques.
Category:Quantum information theory Category:Quantum mechanics