The authors study the reliability function of general classical-quantum (CQ) channels, which describes the optimal exponent of the decay of decoding error when the communication rate is below the capacity. As the main result, they prove a lower bound for the reliability function in terms of the quantum Rényi information in Petz's form. This resolves Holevo's conjecture proposed in 2000, a long-standing open problem in quantum information theory.
The authors show that the obtained lower bound matches the upper bound derived by Dalai in 2013 when the communication rate is above a critical value. Thus, the reliability function is determined in this high-rate case. The proof relies on two key ideas: Renes' result on the error exponent of data compression with quantum side information, and a new characterization of the channel Rényi information.
The authors also discuss the properties of the reliability function, showing that it is strictly positive when the rate is below the channel capacity, and zero when the rate is above the capacity. Some open questions are mentioned, such as deriving the lower bound directly from a random-coding argument, and understanding the reliability function in the low-rate regime.
A otro idioma
del contenido fuente
arxiv.org
Ideas clave extraídas de
by Ke Li, Dong ... a las arxiv.org 09-11-2024
https://arxiv.org/pdf/2407.12403.pdfConsultas más profundas