Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1112.4876

Random Coding Bound for the Reliability Function in Quantum Channel: General Case

Vladimir M. Blinovsky

Published Dec 20, 2011• 0 citations
arXivHTMLPDF

Abstract

We complete the proof of conjecture, which allows to complete the derivation of the random coding bound for the reliability function in quantum channel in the case of arbitrary signal states
DOI
10.48550/arxiv.1112.4876

Related papers

Reliability function of general classical-quantum channel

A.S. Holevo

In information theory, the reliability function and its bounds, describing the exponential behavior of the error probability, are important quantitative characteristics of the channel performance. From a more general point of view, these bounds provide certain measures of distinguishability of a given set of classical states. In a previous paper, quantum analogs of the random coding and expurgation lower bounds for the case of pure signal states were introduced. Here we discuss the case of general quantum states, in particular, we prove the expurgation bound conjectured previously and find the quantum cutoff rate for arbitrary mixed signal states.

arXiv:quant-ph/9907087•IEEE Transactions on Information Theory•Jan 1, 2000•51 citations

Quantum coding theorems

Alexander Semenovich Holevo

Contents I. Introduction II. General considerations § 1. Quantum communication channel § 2. Entropy bound and channel capacity § 3. Formulation of the quantum coding theorem. Weak conversion III. Proof of the direct statement of the coding theorem § 1. Channels with pure signal states § 2. Reliability function § 3. Quantum binary channel § 4. Case of arbitrary states with bounded entropy IV. c-q channels with input constraints § 1. Coding theorem § 2. Gauss channel with one degree of freedom § 3. Classical signal on quantum background noise Bibliography

arXiv:quant-ph/9809023•Russian Mathematical Surveys•Dec 31, 1998•230 citations

Reliability function of general classical-quantum channel

A. S. Holevo

In information theory the reliability function and its bounds, describing the exponential behavior of the error probability, are the most important quantitative characteristics of the channel performance. From a general point of view, these bounds provide certain measures of distinguishability of a given set of states. In an earlier paper we introduced quantum analogs of the random coding and the expurgation lower bounds for the case of pure signal states. Here we discuss the general case, in particular, we prove the previously conjectured expurgation bound and find the quantum cutoff rate in the case of arbitrary mixed signal states.

•Jul 28, 1999•44 citations

Remarks on concavity of the auxiliary function appearing in quantum reliability function in classical-quantum channels

J.I. Fujii, R. Nakamoto, K. Yanagi

This is an extension of results represented in ISIT2003. Concavity of the auxiliary function which appears in the random coding exponent as the lower bound of the quantum reliability function for general quantum states is proven for 0 /spl les/ s /spl les/ 1.

arXiv:cs/0501057•IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2005•1 citation

On Reliability Function of Quantum Communication Channel

M. V. Burnashev, Alexander Semenovich Holevo

The reliability function gives the rate of exponential convergence to zero of the error probability in a communication channel. In this paper bounds for the reliability function of a quantum pure state channel are given, reminiscent of the corresponding classical bounds. This in particular suggests an alternative proof of the coding theorem for quantum noiseless channel, which would make no use of the notion of typical subspace. Example of binary quantum channel is considered in some detail.

arXiv:quant-ph/9703013•Mar 8, 1997•42 citations

Reliability Function of Classical-Quantum Channels

Ke Li, Dong Yang

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 Rényi 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 Rényi information.

arXiv:2407.12403•Physical Review Letters•Jan 8, 2025•11 citations
In information theory, the reliability function and its bounds, describing the exponential behavior of the error probability, are important quantitative characteristics of the channel performance. From a more general point of view, these bounds provide certain measures of distinguishability of a given set of classical states. In a previous paper, quantum analogs of the random coding and expurgation lower bounds for the case of pure signal states were introduced. Here we discuss the case of general quantum states, in particular, we prove the expurgation bound conjectured previously and find the quantum cutoff rate for arbitrary mixed signal states.
Contents I. Introduction II. General considerations § 1. Quantum communication channel § 2. Entropy bound and channel capacity § 3. Formulation of the quantum coding theorem. Weak conversion III. Proof of the direct statement of the coding theorem § 1. Channels with pure signal states § 2. Reliability function § 3. Quantum binary channel § 4. Case of arbitrary states with bounded entropy IV. c-q channels with input constraints § 1. Coding theorem § 2. Gauss channel with one degree of freedom § 3. Classical signal on quantum background noise Bibliography
In information theory the reliability function and its bounds, describing the exponential behavior of the error probability, are the most important quantitative characteristics of the channel performance. From a general point of view, these bounds provide certain measures of distinguishability of a given set of states. In an earlier paper we introduced quantum analogs of the random coding and the expurgation lower bounds for the case of pure signal states. Here we discuss the general case, in particular, we prove the previously conjectured expurgation bound and find the quantum cutoff rate in the case of arbitrary mixed signal states.
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 Rényi 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 Rényi information.