The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Quantum coding theorems
Open accessAbstract
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
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Probabilistic and Statistical Aspects of Quantum Theory
Holevo, A. (2011) · doi:10.1007/978-88-7642-378-9 · Cited by 2,582
Self-citationGood quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 1×
“The question of the channel capacity of a quantum communication channel is of great interest in connection with the recent discovery of quantum error-correcting codes [6], [43].”
BackgroundStates, Effects, and Operations Fundamental Notions of Quantum Theory
(1983) · Lecture Notes in Physics · doi:10.1007/3-540-12732-1 · Cited by 1,565
The capacity of the quantum channel with general signal states
Holevo, A. S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651037 · Cited by 1,176
Self-citationRelative entropy and the Wigner-Yanase-Dyson-Lieb concavity in an interpolation theory
Uhlmann, A. (1977) · Communications in Mathematical Physics · doi:10.1007/bf01609834 · Cited by 431
A New Proof of the Quantum Noiseless Coding Theorem
Jozsa, R., & Schumacher, B. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552191 · Cited by 304
Quantum-channel capacity of very noisy channels
DiVincenzo, D. P., Shor, P. W., & Smolin, J. A. (1998) · Physical Review A · doi:10.1103/physreva.57.830 · Cited by 297
Cited by
Quantum information and relativity theory
Peres, A., & Terno, D. R. (2004) · Reviews of Modern Physics · doi:10.1103/revmodphys.76.93 · Cited by 699
Wilde, M. M., Winter, A., & Yang, D. (2014) · Communications in Mathematical Physics · doi:10.1007/s00220-014-2122-x · Cited by 516
An analysis of completely-positive trace-preserving maps on M2
Beth Ruskai, M., Szarek, S., & Werner, E. (2002) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(01)00547-x · Cited by 366
Minimal entropy of states emerging from noisy quantum channels
King, C., & Ruskai, M. B. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.904522 · Cited by 346
Quantum channels and memory effects
Caruso, F., Giovannetti, V., Lupo, C., & Mancini, S. (2012) · arXiv · doi:10.48550/arxiv.1207.5435 · Cited by 331
Metadata
- Authors
- Holevo, A. S.
- Venue
- Russian Mathematical Surveys
- Publisher
- Steklov Mathematical Institute
- Published
- 1998-12-31
- Volume
- 53
- Issue
- 6
- Pages
- 1295-1331
- ISSN
- 0036-0279 (ISSN-L)
- 1468-4829
- OpenAlex
- W1977205922
- Cited by
- 227
- References
- 7
- FWCI
- 3.94
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum coding theorems. https://app.cochat.ai/papers/10.1070/rm1998v053n06abeh000091
- The paper
- Holevo, A. S. (1998). Quantum coding theorems. Russian Mathematical Surveys. https://doi.org/10.1070/rm1998v053n06abeh000091
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.