A Random Coding Based Proof for the Quantum Coding Theorem
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
We present a proof for the quantum channel coding theorem which relies on the fact that a randomly chosen code space typically is highly suitable for quantum error correction. In this sense, the proof is close to Shannon's original treatment of information transmission via a noisy classical channel.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
States, Effects, and Operations Fundamental Notions of Quantum Theory
(1983) · Lecture Notes in Physics · doi:10.1007/3-540-12732-1 · Cited by 1,928
Fidelity for Mixed Quantum States
Jozsa, R. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552171 · Cited by 1,911
The ‘transition probability’ in the state space of a—algebra
Uhlmann, A. (1976) · Reports on Mathematical Physics · doi:10.1016/0034-4877(76)90060-4 · Cited by 1,649
General teleportation channel, singlet fraction, and quasidistillation
Horodecki, M., Horodecki, P., & Horodecki, R. (1999) · Physical Review A · doi:10.1103/physreva.60.1888 · Cited by 965
The Private Classical Capacity and Quantum Capacity of a Quantum Channel
Devetak, I. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839515 · Cited by 823
A simple formula for the average gate fidelity of a quantum dynamical operation
Nielsen, M. A. (2002) · Physics Letters A · doi:10.1016/s0375-9601(02)01272-0 · Cited by 725
Positive Functions on C ∗ -Algebras
Stinespring, W. F. (1955) · Proceedings of the American Mathematical Society · doi:10.2307/2032342 · Cited by 714
Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
Bennett, C. H., Shor, P. W., Smolin, J. A., & Thapliyal, A. V. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.802612 · Cited by 698
A Decoupling Approach to the Quantum Capacity
Hayden, P., Horodecki, M., Winter, A., & Yard, J. (2008) · Open Systems & Information Dynamics · doi:10.1142/s1230161208000043 · Cited by 170
Approximate Quantum Error Correction
Schumacher, B., & Westmoreland, M. D. (2002) · Quantum Information Processing · doi:10.1023/a:1019653202562 · Cited by 142
Cited by
The Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325
Wilde, M. M. (2013) · doi:10.1017/cbo9781139525343 · Cited by 1,138
(2009) · Information Theory · doi:10.1109/9780470544907.ch24 · Cited by 533
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Weak Decoupling Duality and Quantum Identification
Hayden, P., & Winter, A. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2191695 · Cited by 36
Metadata
- Authors
- Klesse, R.
- Venue
- Open Systems & Information Dynamics
- Publisher
- World Scientific Pub Co Pte Lt
- Published
- 2008-03
- Volume
- 15
- Issue
- 01
- Pages
- 21-45
- ISSN
- 1230-1612 (ISSN-L)
- 1793-7191
- OpenAlex
- W1998573231
- Cited by
- 28
- References
- 11
- FWCI
- 3.18
- Type
- journal article
- Language
- en
- Open access
- green
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: A Random Coding Based Proof for the Quantum Coding Theorem. https://app.cochat.ai/papers/10.1142/s1230161208000055
- The paper
- Klesse, R. (2008). A Random Coding Based Proof for the Quantum Coding Theorem. Open Systems & Information Dynamics. https://doi.org/10.1142/s1230161208000055
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.