Reliability Function of Classical-Quantum Channels

Abstract

We study the reliability function of general classical-quantum channels, which describes the optimal exponent of the decay of decoding error when the communication rate is below the capacity. As the main result, we prove a lower bound, in terms of the quantum Renyi information in Petz's form, for the reliability function. This resolves Holevo's conjecture proposed in 2000, a long-standing open problem in quantum information theory. It turns out that the obtained lower bound matches the upper bound derived by Dalai in 2013, when the communication rate is above a critical value. Thus, we have determined the reliability function in this high-rate case. Our approach relies on Renes' breakthrough made in 2022, which relates classical-quantum channel coding to that of privacy amplification, as well as our new characterization of the channel Renyi information.

8 pages, no figures, published in PRL. See also independent work arXiv:2407.11118 by Joseph M. Renes

References in corpus (23)

• Superadditivity of communication capacity using entangled inputs
• Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
• Coding Theorem and Strong Converse for Quantum Channels
• Post-selection technique for quantum channels with applications to quantum cryptography
• One-Shot Classical-Quantum Capacity and Hypothesis Testing
• Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding
• On the quantum Renyi relative entropies and related capacity formulas
• Fundamental bound on the reliability of quantum information transmission
• On the strong converses for the quantum channel capacity theorems
• Correlation Detection and an Operational Interpretation of the Renyi Mutual Information
• A strong converse for classical channel coding using entangled inputs
• Strong converse exponent for classical-quantum channel coding
• Multiplicativity of completely bounded $p$-norms implies a strong converse for entanglement-assisted capacity
• Lower bounds on the Probability of Error for Classical and Classical-Quantum Channels
• Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels
• Universal coding for classical-quantum channel
• Moderate deviation analysis for classical communication over quantum channels
• Quantum Sphere-Packing Bounds with Polynomial Prefactors
• Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification
• Superadditivity of the Classical Capacity with Limited Entanglement Assistance
• Precise evaluation of leaked information with universal2 privacy amplification in the presence of quantum attacker
• Duality of channels and codes
• Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels