Cited by 866Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyCoding theory and cryptography

Theory of Quantum Error Correction for General Noise

Open access
Knill, Emanuel, Laflamme, Raymond, Viola, Lorenza·2000·Physical Review Letters

Abstract

A measure of quality of an error-correcting code is the maximum number of errors that it is able to correct. We show that a suitable notion of "number of errors" e makes sense for any quantum or classical system in the presence of arbitrary interactions. Thus, e-error-correcting codes protect information without requiring the usual assumptions of independence. We prove the existence of large codes for both quantum and classical information. By viewing error-correcting codes as subsystems, we relate codes to irreducible representations of operator algebras and show that noiseless subsystems are infinite-distance error-correcting codes.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.84.2525

Cites

36 of 36 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

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?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 8

  1. [2][2] C.Monroe et al. Demonstration of a Universal Quantum Logic Gate NIST preprint, 1995 to appear in Physical Review Letters. -
  2. [7][7] R. Landauer. Is Quantum Mechanically Coherent Computation Useful? In D.H.Feng and B-L. Hu, editors, Proc. of the Drexel-4 Symposium on quantum Nonintegrability - Quantum Classical Correspondence , 1995. -
  3. [9][9] I.L.Chuang, R.Laflamme, P.Shor and W.H.Zurek. Quantum Computers, Factoring and Decoherence, quant-ph/9503007, Science 270, 1633, 1995. - · arXiv
  4. [10][10] Comments by C.H. Bennet reported in the proceedings of the Army Research Office Conference on Quantum Computers and Cryptography, Tucson, February 1995. -
  5. [14][14] I. L. Chuang and R. Laflamme Quantum Error Correction by Coding, quant-phys/ 951003, Los Alamos National Laboratory Report LA-UR95-3641, submitted to Physica Review Letters. -
  6. [18][18] L. Vaidman, L. Goldenberg and S. Wiesner, Error Prebention Scheme with Four Particles, quant-ph/9603031 - · arXiv
  7. [24][24] M.A.Nielsen and B.Schumacher. Quantum Data Processing and Error Correction, preprint 1996. -
  8. [25][25] I. Chuang and R. Laflamme. The Persistent Qubit, preprint 1996.

Cited by

Sorted by citations

Authors
Knill, E., Laflamme, R., & Viola, L.
Affiliations
  • Los Alamos National Laboratory (US)
  • Massachusetts Institute of Technology (US)
Venue
Physical Review Letters
Published
2000-03-13
Volume
84
Issue
11
Pages
2525-2528
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2087256203
Cited by
866
References
36
Citations by year
2026: 31 · 2025: 53 · 2024: 41 · 2023: 35 · 2022: 35 · 2021: 39 · 2020: 32 · 2019: 36 · 2018: 26 · 2017: 24 · 2016: 30 · 2015: 17 · 2014: 30 · 2013: 31 · 2012: 22
FWCI
36.13
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
Keywords
quantum error correction, error-correcting codes, classical error-correcting codes, subsystem codes, noiseless subsystems, irreducible representations, operator algebras, code existence

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