Pith. Sign in

REVIEW

Multiple Particle Interference and Quantum Error Correction

PaperPDF from arXiv

data files

ReviewThe objections and verdict, as JSON Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Andrew Steane (Clarendon Laboratory, Oxford University)

Quantum Physics · Submitted 29 Jan 1996 · 36 references

Pith's verdict: The two structural theorems are correct and proved; the physical claim in the abstract outruns them, and the author says so himself in the conclusion.

T0 · AI review

How this review was made: An AI referee (selfhosted/deepseek-v4.1-flash) read the paper on November 11, 2026 and answered a fixed list of questions about it. T0 is the starting level every paper gets. The levels describe how deeply Pith has checked the paper, never the authors.

  1. T0 AI review An AI read the paper and answered a fixed list of questions.
  2. T1 Audit Automatic checks that the references and files the paper relies on exist and match.
  3. T2 Compute The paper's code or calculations re-run with the same results.
  4. T3 Formal statement The claims written out in a formal math language a computer can read.
  5. T4 Proof Those claims proved, and the proof checked by computer.

How Pith checks papers →

· 2 major objections · 7 minor · Ask about this paper · The compiled record · Read the full review →
Challenge this review Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDquant-ph/9601029 (version 3)
Pith IDK4R7ABFH, Pith's permanent record of this paper and its review
CitationAndrew Steane (Clarendon Laboratory, Oxford University). "Multiple Particle Interference and Quantum Error Correction." arXiv:quant-ph/9601029 (1996). https://pith.science/paper/K4R7ABFH
Cite this reviewBibTeX for Pith's review of this paper
Claim paper

Why Pith says this

Highlight any text to comment on it.

Referee report

How Pith checks papers → · Full audit of this paper →

The paper

The paper claims

Steane argues that a quantum computer can be kept error-free by encoding many physical qubits per logical qubit and correcting errors in two rotated bases, turning decoherence into a resource budget rather than a fundamental barrier.

The reading

Steane asks whether a quantum computer can run reliably even though its qubits continually leak information into the environment. His answer is yes, provided the computer's information is spread over many qubits using codes borrowed from classical error correction, and provided errors are corrected in two mutually rotated measurement bases rather than one. The paper first shows that the $n$-particle interference states of Greenberger, Horne and Zeilinger are parity checks in disguise, so the classical theory of linear codes and their duals becomes a catalogue of multi-qubit entanglement. It then uses that catalogue to build encodings, proves that correcting in basis 1 and then in basis 2 removes arbitrary errors, including entanglement with the environment, from any $x$ qubits, and estimates how many physical qubits are needed per logical qubit. If the argument holds, decoherence stops being an obstacle in principle and becomes an engineering budget item.

What carries the argument

The load-bearing mechanism is the duality between a linear code and its dual, read as a statement about two measurement bases: a parity check performed in basis 1 is a generator relation in basis 2 (Theorems 2 to 4). Encoding is done by cosets of a code, correction by measuring the syndrome with a sequence of controlled-not gates onto ancilla qubits and flipping the qubits the syndrome identifies. The two-basis correction works because the first correction removes the basis-1 error syndrome while leaving a basis-2 sign pattern entangled with the environment, and the second correction removes that sign pattern, so the accumulated environment states carry no residual dependence on the computer's state.

Extended reading notes

Core claim

The central claim is that error correction in two bases is sufficient for arbitrary quantum errors. Using a linear code $C^{+K}$ of distance $d_1$ whose $K$'th-order subcode $C$ has a dual $C^{�perp}$ of distance $d_2$, the author encodes $K$ qubits in $n$ qubits as superpositions of cosets of $C^{+K}$; in the rotated basis the same state is described by cosets of $C^{�perp}$, so the parity checks of one basis are the generator relations of the other. Theorem 6 then shows that if fewer than $d_1/2$ and fewer than $d_2/2$ qubits defect, correcting first in basis 1 and then in basis 2 returns the computer exactly to its intended state and factors the environment out of the joint state, equation (33). The rate accounting gives $K/n > 1-2H(2x/n)$ as achievable and $K/n < 1-2H(x/n)$ as necessary, so with $d_1=d_2=d$ one needs the entropy of $d/n$ to sit between one half of $1-K/n$ and the entropy of $d/(2n)$, i.e. $d/n$ between about $0.110$ and $0.220$. The practical reading is that the probability of an uncorrectable error falls exponentially in block length while the qubit overhead grows only polynomially, so error-free computation is guaranteed for per-step defect probability below roughly $0.055$ and impossible above roughly $0.110$ within this coding method.

Load-bearing premise

The rate bounds and the quoted numerical thresholds assume that a chain of codes exists whenever both its ends meet the Gilbert-Varshamov bound, a statement the author explicitly says he could not prove, though he notes that the symmetric case $d_1=d_2$ used for the numbers was proved elsewhere.

Editorial extensions

If this is right

  • Uncorrectable failure probability falls exponentially with the number of physical qubits per logical qubit, while that number grows only polynomially, so a computation of $T$ steps succeeds with probability approaching one for defect rates below the threshold.
  • A macroscopic quantum system can be stabilised indefinitely by a feedback loop of unitary gates plus dissipative measurements, contrary to the usual reading of the Schrödinger cat as inherently unstabilisable.
  • The same encoding performs purity amplification, which the paper identifies with quantum privacy amplification: noisy entangled pairs and eavesdropped communication channels can be purified by single-error detection in both bases.
  • The overhead is about $2n^2p$ extra two-qubit operations per elementary computing step, which the author argues is modest enough to retain the gains of quantum parallelism.
  • Linear codes supply a general taxonomy of multi-qubit interference, with the Bell basis as the two-qubit case and the seven-qubit simplex code carrying three overlapping four-particle interferences.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The factor of two in the exponent of the rate bound comes from not knowing which basis the noise acts in; if the noise is known to be phase-only, the classical threshold of one half is recovered. That suggests the $0.11$ ceiling measures basis ignorance rather than a law of quantum mechanics, and a channel with characterised noise should beat it.
  • The paper's own gap, the unproved existence of the code chain at both ends of the Gilbert-Varshamov bound, is the kind of statement later settled by random-coding arguments; the quoted numeric thresholds should be read as provisional pending that existence proof.
  • The author flags but does not analyse errors introduced by the correction circuit itself. In any real device that is the binding constraint: the achievable threshold will be set by gate error rates, not by the coding bound.
  • If the two-basis circuit really disentangles the computer from its environment, the same primitive doubles as an entanglement-purification step, which is the operation a quantum repeater needs.
Original abstract

The concept of multiple particle interference is discussed, using insights provided by the classical theory of error correcting codes. This leads to a discussion of error correction in a quantum communication channel or a quantum computer. Methods of error correction in the quantum regime are presented, and their limitations assessed. A quantum channel can recover from arbitrary decoherence of x qubits if K bits of quantum information are encoded using n quantum bits, where K/n can be greater than 1-2 H(2x/n), but must be less than 1 - 2 H(x/n). This implies exponential reduction of decoherence with only a polynomial increase in the computing resources required. Therefore quantum computation can be made free of errors in the presence of physically realistic levels of decoherence. The methods also allow isolation of quantum communication from noise and evesdropping (quantum privacy amplification).

The compiled record

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 5,476 input tokens.

What the abstract itself states, as probabilities: claims first 0.03 · states limitation 0.47 · human participants 0.02 · controlled comparison 0.03 · randomized assignment 0.01 · states quantitative result 0.96 · compares with prior results 0.13 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v3. Results and the main claim are underlined; .

The concept of multiple particle interference is discussed, using insights provided by the classical theory of error correcting codes. This leads to a discussion of error correction in a quantum communication channel or a quantum computer. Methods of error correction in the quantum regime are presented, and their limitations assessed. A quantum channel can recover from arbitrary decoherence of x qubits if K bits of quantum information are encoded using n quantum bits, where K/n can be greater than 1-2 H(2x/n), but must be less than 1 - 2 H(x/n). This implies exponential reduction of decoherence with only a polynomial increase in the computing resources required. Therefore quantum computation can be made free of errors in the presence of physically realistic levels of decoherence. The methods also allow isolation of quantum communication from noise and evesdropping (quantum privacy amplification).

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 The concept of multiple particle interference is discussed, using insights provided by the classical theory of error correcting codes. background 0.76 0.22 0.03 asserted 0.88
s1 This leads to a discussion of error correction in a quantum communication channel or a quantum computer. background 0.52 0.27 0.03 asserted 0.71
s2 Methods of error correction in the quantum regime are presented, and their limitations assessed. contribution 0.93 0.54 0.04 asserted 0.90
s3 A quantum channel can recover from arbitrary decoherence of x qubits if K bits of quantum information are encoded using n quantum bits, where K/n can be greater than 1-2 H(2x/n), but must be less than 1 - 2 H(x/n). result 0.94 0.61 0.14 asserted 0.93
s4 This implies exponential reduction of decoherence with only a polynomial increase in the computing resources required. interpretation 0.97 0.60 0.11 asserted 0.95
s5 Therefore quantum computation can be made free of errors in the presence of physically realistic levels of decoherence. interpretation 0.90 0.52 0.77 asserted 0.68
s6 The methods also allow isolation of quantum communication from noise and evesdropping (quantum privacy amplification). result 0.79 0.60 0.07 asserted 0.91

What kind of paper the classifier reports this is: theoretical result 0.79 · evidence from proof or derivation 0.83.

What was examined, and what was not

sources read
  • arXiv listing abstract v3
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

Figures
Figure 1. Encoding for simplest error correction scheme. In
Figure 3. Encoder for the simplest scheme enabling single er
Figure 4. Error corrector for the code generated by figure 3. M
Figure 6. Asymptotic bounds, in the limit of large

Showing 4 of the paper's 6 figures. See all figures in the PDF ↗ Figures reproduced from arXiv:quant-ph/9601029 by the authors.

References
How later papers used it

269 later papers cite it

Evidence: substantial. 269 of the citing papers share no author with it, and 24 of those carry a confident label from Pith's citation classifier.

Pith read 39 of the 378 citing sentences, choosing only those whose citation markers point at this paper alone, and wrote the paraphrases from them. The summary, the counts, the evidence level, the links and the quotes come from code; the summary counts the papers listed below. A later paper is listed under a label when Pith's citation classifier gives one of its sentences that label at probability 0.8 or more (0.95 for support), Pith's reading finds that the citing paper itself did it, and a second check confirms the paraphrase against the sentence. This section lists uses only. It does not list criticism or disagreement, so their absence here says nothing about how the paper has been received. Papers that share an author with this one are listed apart, under "By the same authors". A quote is the citing authors' own sentence, shown when their paper's licence is CC BY, CC BY-SA or CC0. JSON

Builds on it 1 of 7 papers with this label
Uses its method or tool 4 of 13 papers with this label
How the literature uses it

64 arXiv papers cite this in 89 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 38 sentences without a confident label

Builds on it 3 papers
Uses its method or tool 1 paper
Compares with it 1 paper
Cites it as background 39 papers

Discussion

Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.