Uniform Additivity in Classical and Quantum Information
arXiv:1601.05434 · doi:10.1103/PhysRevLett.118.040501
Abstract
Information theory establishes the fundamental limits on data transmission, storage, and processing. Quantum information theory unites information theoretic ideas with an accurate quantum-mechanical description of reality to give a more accurate and complete theory with new and more powerful possibilities for information processing. The goal of both classical and quantum information theory is to quantify the optimal rates of interconversion of different resources. These rates are usually characterized in terms of entropies. However, nonadditivity of many entropic formulas often makes finding answers to information theoretic questions intractable. In a few auspicious cases, such as the classical capacity of a classical channel, the capacity region of a multiple access channel and the entanglement assisted capacity of a quantum channel, additivity allows a full characterization of optimal rates. Here we present a new mathematical property of entropic formulas, uniform additivity, that is both easily evaluated and rich enough to capture all known quantum additive formulas. We give a complete characterization of uniformly additive functions using the linear programming approach to entropy inequalities. In addition to all known quantum formulas, we find a new and intriguing additive quantity: the completely coherent information. We also uncover a remarkable coincidence---the classical and quantum uniformly additive functions are identical; the tractable answers in classical and quantum information theory are formally equivalent. Our techniques pave the way for a deeper understanding of the tractability of information theory, from classical multi-user problems like broadcast channels to the evaluation of quantum channel capacities.
arXiv comment13 pages with 4 figures + 25 page appendix
References in corpus (13)
- Superadditivity of communication capacity using entangled inputs
- Structure of states which satisfy strong subadditivity of quantum entropy with equality
- Quantum Communication With Zero-Capacity Channels
- Quantum Channel Capacity of Very Noisy Channels
- Additivity of the Classical Capacity of Entanglement-Breaking Quantum Channels
- Degenerate Quantum Codes for Pauli Channels
- Reverse Coherent Information
- Unbounded number of channel uses are required to see quantum capacity
- The private capacity of quantum channels is not additive
- The quantum capacity with symmetric side channels
- Multiplicativity of completely bounded p-norms implies a new additivity result
- Extensive nonadditivity of privacy
- Superactivation of the Asymptotic Zero-Error Classical Capacity of a Quantum Channel
Cited by in corpus (10)
- Approaches for approximate additivity of the Holevo information of quantum channels
- Dephrasure channel and superadditivity of coherent information
- Quantum and private capacities of low-noise channels
- On contraction coefficients, partial orders and approximation of capacities for quantum channels
- Entropic singularities give rise to quantum transmission
- Distributed Private Randomness Distillation
- Bounding quantum capacities via partial orders and complementarity
- Optimized Measures of Bipartite Quantum Correlation
- Reverse-type Data Processing Inequality
- Additivity of quantum capacities in simple non-degradable quantum channels