The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Class of quantum error-correcting codes saturating the quantum Hamming bound
Open accessAbstract
I develop methods for analyzing quantum error-correcting codes, and use these methods to construct an infinite class of codes saturating the quantum Hamming bound. These codes encode k=n-j-2 quantum bits (qubits) in n=${2}^{\mathit{j}}$ qubits and correct t=1 error. \textcopyright{} 1996 The American Physical Society.
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.
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
“Without error corrections, the effect of noise will accumulate and ruin the entire computation[72, 17, 54, 52, 7], and hence the computation must be protected.”
From Fault-Tolerant Quantum Computation with Constant Error Rate (2008) · cites this paper as [52]
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
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
Purification 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
Good 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
Flagged first, then by citations
Cited by
Sorted by citations
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
Decoherence, einselection, and the quantum origins of the classical
Zurek, W. H. (2003) · Reviews of Modern Physics · doi:10.1103/revmodphys.75.715 · Cited by 4,295
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Quantum information and computation
Bennett, C. H., & DiVincenzo, D. P. (2000) · Nature · doi:10.1038/35005001 · Cited by 3,263
Metadata
- Authors
- Gottesman, D.
- Affiliations
- California Institute of Technology (US)
- Corresponding author
- Gottesman, Daniel
- ORCID
- Gottesman, Daniel
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 1996-09-01
- Volume
- 54
- Issue
- 3
- Pages
- 1862-1868
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2069711632
- Cited by
- 1,227
- References
- 3
- Citations by year
- 2026: 26 · 2025: 75 · 2024: 48 · 2023: 56 · 2022: 45 · 2021: 65 · 2020: 44 · 2019: 36 · 2018: 34 · 2017: 36 · 2016: 33 · 2015: 32 · 2014: 41 · 2013: 38 · 2012: 34
- FWCI
- 38.07
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- arXiv (Cornell University)
- Funders
- U.S. Department of Energy (FG0392ER40701)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- quantum error-correcting codes, code construction, single error correction, qubit encoding, code rate, quantum information
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
