General formulas for capacity of classical-quantum channels

DOI10.1109/TIT.2003.813556zbMath1301.94053arXivquant-ph/0206186OpenAlexW2167830490MaRDI QIDQ3547006

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0206186

Mathematics Subject Classification ID

Other game-theoretic models (91A40) Coding theorems (Shannon theory) (94A24) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items

Second-order coding rates for pure-loss bosonic channels ⋮ Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication ⋮ Optimal adaptive strategies for sequential quantum hypothesis testing ⋮ Achieving the Holevo bound via a bisection decoding protocol ⋮ A Dynamical Point of View of Quantum Information: Entropy and Pressure ⋮ On the second-order asymptotics for entanglement-assisted communication ⋮ Universal coding for classical-quantum channel ⋮ Moderate deviation analysis for classical communication over quantum channels ⋮ Strong converse exponent for classical-quantum channel coding ⋮ Classical-quantum arbitrarily varying wiretap channel: common randomness assisted code and continuity ⋮ The broadcast classical-quantum capacity region of a two-phase bidirectional relaying channel ⋮ Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication ⋮ Position-based coding and convex splitting for private communication over quantum channels ⋮ Asymptotic convertibility of entanglement: An information-spectrum approach to entanglement concentration and dilution ⋮ Random Quantum Codes from Gaussian Ensembles and an Uncertainty Relation ⋮ On the near-optimality of one-shot classical communication over quantum channels ⋮ Second-order asymptotics for quantum hypothesis testing ⋮ The apex of the family tree of protocols: optimal rates and resource inequalities ⋮ Universal superposition codes: Capacity regions of compound quantum broadcast channel with confidential messages ⋮ Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography ⋮ A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation ⋮ A note on random coding bounds for classical-quantum channels ⋮ Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities ⋮ The smooth entropy formalism for von Neumann algebras ⋮ Thermodynamic implementations of quantum processes ⋮ Entanglement-assisted private communication over quantum broadcast channels ⋮ On composite quantum hypothesis testing ⋮ Generalized relative entropies and the capacity of classical-quantum channels ⋮ Entanglement assisted classical capacity of a class of quantum channels with long-term memory ⋮ Classical capacity of quantum channels with general Markovian correlated noise ⋮ Correlation detection and an operational interpretation of the Rényi mutual information ⋮ Union bound for quantum information processing ⋮ An achievable rate for private classical information over a quantum broadcast channel ⋮ Applications of position-based coding to classical communication over quantum channels ⋮ Distilling entanglement from arbitrary resources ⋮ Universal coding for transmission of private information ⋮ Common Information, Noise Stability, and Their Extensions ⋮ Universal random codes: capacity regions of the compound quantum multiple-access channel with one classical and one quantum sender ⋮ Properties of noncommutative Rényi and Augustin information ⋮ Second-order asymptotics for the classical capacity of image-additive quantum channels