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:quant-ph/9809023 · Russian Mathematical Surveys

Quantum coding theorems

Alexander Semenovich Holevo

Published Dec 31, 1998• 226 citations
arXivHTMLPDF

Abstract

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

DOI
10.1070/rm1998v053n06abeh000091

Related papers

Coding Theorems of Quantum Information Theory

Andreas Winter

Coding theorems and (strong) converses for memoryless quantum communication channels and quantum sources are proved: for the quantum source the coding theorem is reviewed, and the strong converse proven. For classical information transmission via quantum channels we give a new proof of the coding theorem, and prove the strong converse, even under the extended model of nonstationary channels. As a by-product we obtain a new proof of the famous Holevo bound. Then multi-user systems are investigated, and the capacity region for the quantum multiple access channel is determined. The last chapter contains a preliminary discussion of some models of compression of correlated quantum sources, and a proposal for a program to obtain operational meaning for quantum conditional entropy. An appendix features the introduction of a notation and calculus of entropy in quantum systems.

arXiv:quant-ph/9907077•Jul 24, 1999•143 citations

Coding Theorems for Hybrid Channels. II

A. A. Kuznetsova, Alexander Semenovich Holevo

The present paper continues investigation of the capacities of measurement (quantum-classical) channels in the most general setting, initiated in [A. A. Kuznetsova and A. S. Holevo, Theory Probab. Appl., 58 (2014), pp. 264--285]. The proof of coding theorems is given for the classical capacity and entanglement-assisted classical capacity of the measurement channel with arbitrary output alphabet, without assuming that the channel is given by a bounded operator-valued density.

arXiv:1408.3255•Theory of Probability and Its Applications•Jan 1, 2015•4 citations

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

Vladimir M. Blinovsky

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

arXiv:1112.4876•Dec 20, 2011•0 citations

The capacity of the quantum multiple-access channel

Andreas Winter

We define classical quantum multiway channels for transmission of classical information, after the previous work by Allahverdyan and Saakian (see Quantum Computing and Quantum Communications (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, vol.1509, 1999). Bounds on the capacity region are derived in a uniform way, which are analogous to the classically known ones, simply replacing Shannon (1961) entropy with von Neumann (1955) entropy. For the single receiver case (multiple-access channel) the elect capacity region is determined. These results are applied to the case of noisy channels, with arbitrary input signal states. A second issue of this work is the presentation of a calculus of quantum information quantities, based on the algebraic formulation of quantum theory.

arXiv:quant-ph/9807019•IEEE Transactions on Information Theory•Jan 1, 2001•122 citations

Coding theorems for quantum communication channels

Alexander Semenovich Holevo

The more than thirty years old issue of the information capacity of quantum communication channels was dramatically clarified during when a number of direct quantum coding theorems were discovered. To a considerable extent this progress is due to an interplay between the quantum communication theory and quantum information ideas related to more recent development in quantum computing. It is remarkable, however, that many probabilistic tools underlying the treatment of the quantum case have their roots, and in some cases direct prototypes, in the classical Shannon theory.

arXiv:quant-ph/9708046•IEEE International Symposium on Information Theory (ISIT)•Nov 27, 2002•23 citations

Strong Converse for the Feedback-Assisted Classical Capacity of Entanglement-Breaking Channels

Dawei Ding, Mark M. Wilde

Quantum entanglement can be used in a communication scheme to establish a correlation between successive channel inputs that is impossible by classical means. It is known that the classical capacity of quantum channels can be enhanced by such entangled encoding schemes, but this is not always the case. In this paper, we prove that a strong converse theorem holds for the classical capacity of an entanglement-breaking channel even when it is assisted by a classical feedback link from the receiver to the transmitter. In doing so, we identify a bound on the strong converse exponent, which determines the exponentially decaying rate at which the success probability tends to zero, for a sequence of codes with communication rate exceeding capacity. Proving a strong converse, along with an achievability theorem, shows that the classical capacity is a sharp boundary between reliable and unreliable communication regimes. One of the main tools in our proof is the sandwiched Rényi relative entropy. The same method of proof is used to derive an exponential bound on the success probability when communicating over an arbitrary quantum channel assisted by classical feedback, provided that the transmitter does not use entangled encoding schemes.

arXiv:1506.02228•Problems of Information Transmission•Jan 1, 2018•19 citations
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
Coding theorems and (strong) converses for memoryless quantum communication channels and quantum sources are proved: for the quantum source the coding theorem is reviewed, and the strong converse proven. For classical information transmission via quantum channels we give a new proof of the coding theorem, and prove the strong converse, even under the extended model of nonstationary channels. As a by-product we obtain a new proof of the famous Holevo bound. Then multi-user systems are investigated, and the capacity region for the quantum multiple access channel is determined. The last chapter contains a preliminary discussion of some models of compression of correlated quantum sources, and a proposal for a program to obtain operational meaning for quantum conditional entropy. An appendix features the introduction of a notation and calculus of entropy in quantum systems.
We define classical quantum multiway channels for transmission of classical information, after the previous work by Allahverdyan and Saakian (see Quantum Computing and Quantum Communications (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, vol.1509, 1999). Bounds on the capacity region are derived in a uniform way, which are analogous to the classically known ones, simply replacing Shannon (1961) entropy with von Neumann (1955) entropy. For the single receiver case (multiple-access channel) the elect capacity region is determined. These results are applied to the case of noisy channels, with arbitrary input signal states. A second issue of this work is the presentation of a calculus of quantum information quantities, based on the algebraic formulation of quantum theory.
The more than thirty years old issue of the information capacity of quantum communication channels was dramatically clarified during when a number of direct quantum coding theorems were discovered. To a considerable extent this progress is due to an interplay between the quantum communication theory and quantum information ideas related to more recent development in quantum computing. It is remarkable, however, that many probabilistic tools underlying the treatment of the quantum case have their roots, and in some cases direct prototypes, in the classical Shannon theory.
Quantum entanglement can be used in a communication scheme to establish a correlation between successive channel inputs that is impossible by classical means. It is known that the classical capacity of quantum channels can be enhanced by such entangled encoding schemes, but this is not always the case. In this paper, we prove that a strong converse theorem holds for the classical capacity of an entanglement-breaking channel even when it is assisted by a classical feedback link from the receiver to the transmitter. In doing so, we identify a bound on the strong converse exponent, which determines the exponentially decaying rate at which the success probability tends to zero, for a sequence of codes with communication rate exceeding capacity. Proving a strong converse, along with an achievability theorem, shows that the classical capacity is a sharp boundary between reliable and unreliable communication regimes. One of the main tools in our proof is the sandwiched Rényi relative entropy. The same method of proof is used to derive an exponential bound on the success probability when communicating over an arbitrary quantum channel assisted by classical feedback, provided that the transmitter does not use entangled encoding schemes.