A New Proof of the Quantum Noiseless Coding Theorem
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
We give an account of the quantum noiseless coding theorem, including a new proof based on a simplified block coding scheme. We also discuss an illustrative example of quantum coding.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“quantum data compression [2,3] allows quantum data to be transmitted, with asymptotically perfect fidelity, using a number of 2-state quantum systems or qubits ( e.g. spin1 2 particles) asymptotically approaching the source's von Neumann entropy”
From Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels (1996) · cites this paper as [3]
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Perturbation Theory for Linear Operators
Kato, T. (1995) · Classics in Mathematics · doi:10.1007/978-3-642-66282-9 · Cited by 16,290
Perturbation theory for linear operators
Kato, T. (1966) · Springer eBooks · doi:10.1007/978-3-662-12678-3 · Cited by 7,131
ASH, R. B. (1966) · Cited by 3,990
How to differentiate between non-orthogonal states
Peres, A. (1988) · Physics Letters A · doi:10.1016/0375-9601(88)91034-1 · Cited by 705
Welsh, D. (1988) · Cited by 204
(1989) · Choice Reviews Online · doi:10.5860/choice.26-5690a · Cited by 103
Research works printed but not linked: 1
- Schumacher B., 1994, Phys. Rev. A
Cited by
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Quantum information and computation
Bennett, C. H., & DiVincenzo, D. P. (2000) · Nature · doi:10.1038/35005001 · Cited by 3,263
“This is the analogue of classical data compression or source coding, by which redundant classical data is compressed and faithfully regenerated, but quantum data compressio”
Concentrating partial entanglement by local operations
Bennett, C. H., Bernstein, H. J., Popescu, S., & Schumacher, B. (1996) · Physical Review A · doi:10.1103/physreva.53.2046 · Cited by 3,111
Self-citationPurification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
Bennett, C. H., Brassard, G., Popescu, S., Schumacher, B., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.722 · Cited by 2,961
Self-citation
Metadata
- Authors
- Jozsa, R., & Schumacher, B.
- Affiliations
- Université de Montréal (CA)
- Kenyon College (US)
- ORCID
- Jozsa, Richard
- Venue
- Journal of Modern Optics
- Publisher
- Informa UK Limited
- Published
- 1994-12
- Volume
- 41
- Issue
- 12
- Pages
- 2343-2349
- ISSN
- 0950-0340 (ISSN-L)
- 1362-3044
- OpenAlex
- W2025187617
- Cited by
- 304
- References
- 7
- Citations by year
- 2026: 2 · 2025: 5 · 2024: 4 · 2023: 8 · 2022: 5 · 2021: 6 · 2020: 7 · 2019: 2 · 2018: 8 · 2017: 5 · 2016: 9 · 2015: 11 · 2014: 5 · 2013: 6 · 2012: 6
- FWCI
- 18.53
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Journal of Modern Optics (publishedVersion)
- Digital Kenyon (Kenyon College) (submittedVersion)
- Explore Bristol Research (submittedVersion)
- Bristol Research (University of Bristol) (submittedVersion)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- quantum channel capacity, block coding, quantum error correction, quantum information, quantum channel coding
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 New Proof of the Quantum Noiseless Coding Theorem. https://app.cochat.ai/papers/10.1080/09500349414552191
- The paper
- Jozsa, R., & Schumacher, B. (1994). A New Proof of the Quantum Noiseless Coding Theorem. Journal of Modern Optics. https://doi.org/10.1080/09500349414552191
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.