REVIEW
Quantum Error Correction and Orthogonal Geometry
Quantum Physics · Submitted 9 May 1996 · 18 references
Pith's verdict: The paper that gave everyone the stabilizer formalism; Theorem 1 is correct and the framework is the contribution, but the headline distances for the 13- and 29-qubit codes rest on an unshipped computer calculation the authors themselves say has no theoretical backing.
T0 · AI review
Why Pith says this
Highlight any text to comment on it.
Referee report
The paper
The paper claims
Quantum error-correcting codes are shown to be eigenspaces of subspaces in a binary geometry, and the framework yields new codes storing 1 qubit in 13 and 29 qubits.
The reading
What carries the argument
The carrying object is the extraspecial 2-group $E$ of Pauli tensor products $pm w_1 otimes ... otimes w_n$ with $w_j in {sigma_x, sigma_z, sigma_y}$, together with the quadratic form $Q(bar e) = sum_j a_j b_j$ on $E/IZ(E)$, which records whether the bit part and phase part of an error commute. A totally singular subspace is one on which $Q$ vanishes; its characters partition the coordinate frame into eigenspaces, and each eigenspace of dimension $2^{n-k}$ is a code mapping $n-k$ qubits into $n$ qubits. The normalizer $L$ of $E$ in the real orthogonal group has quotient $L/E = O^+(2n,2)$ and is generated by four explicit types of gate: the Hadamard-like transform interchanging $X(b)$ and $Z(b)$, permutations of basis vectors coming from $GL(V)$, the single-qubit $pi/2$ rotation, and diagonal phase matrices built from binary quadratic forms. This generator list is what makes the transitivity argument effective and what makes encoding a gate-level recipe rather than an existence statement.
Extended reading notes
Core claim
The central claim is Theorem 1. Let $S$ be a $k$-dimensional totally singular subspace of the binary space underlying the Pauli group, and let $S^perp$ be its orthogonal complement under the alternating form $(a|b,a'|b') = a dot b' + a' dot b$. If for any two errors $e_1, e_2$ in an error set the product $e_1 e_2$ either lies in $S$ or lies outside $S^perp$, then the eigenspace attached to any character of $S$ is a quantum code correcting every error in that set. This converts the analytic error-correction conditions, that $langle c_1|e_1^{-1}e_2|c_2 rangle = 0$ for orthogonal codewords and $langle c|e_1^{-1}e_2|c rangle$ be independent of $c$, into a purely geometric statement about subspace containment. Because the Clifford group acts transitively on totally singular subspaces of a given dimension, every such subspace is equivalent to a standard one, so the same construction covers all the codes the paper exhibits and explains the previously found examples as special cases.
Load-bearing premise
The advertised code parameters rest on the stated minimum distances of the dual subspaces: the paper calls the weight-3 duals of the 8-qubit and 10-qubit examples straightforward to verify, and reports the distances 5 and 11 for the prime 13 and prime 29 quadratic-residue codes as computer calculations without giving the program or a certificate, while also noting that no theoretical bounds on the minimum distance of that family were found.
Editorial extensions
If this is right
- Any quantum code obtained from a totally singular subspace can be encoded using only xor gates and $pi/2$ rotations, since those generate the full Clifford group $L$ that moves the standard subspace to the desired one.
- Classical self-orthogonal binary codes with $C^perp subset C$ reproduce the known CSS-type quantum codes as the case where $S$ consists of pairs $(v_1|v_2)$ with $v_1, v_2 in C^perp$, giving a code mapping $n-2k$ qubits into $n$ qubits and correcting $[(d-1)/2]$ errors.
- A quadratic-residue construction for primes $p = 8j+5$ produces a 1-into-13 code correcting 2 errors and a 1-into-29 code correcting 5 errors, the latter matching the best rate known for a single encoded qubit at that length.
- A counting argument over totally singular subspaces gives the asymptotic rate $R = 1 - 2delta log_2 3 - H_2(2delta)$, matching the Gilbert-Varshamov lower bound already known for general quantum codes.
- The modified $[8,4,4]$ Hamming code yields a 3-into-8 code correcting one error, the same parameters obtained independently by Gottesman's group-theoretic route.
Reading between the lines
- The construction suggests a general search strategy: enumerate totally singular subspaces of the binary space and screen them by the minimum weight of their orthogonal complements, which is a finite combinatorial optimisation rather than a search over Hilbert-space subspaces.
- Because the complex Clifford group $L'$ also works, with the alternating form alone and no quadratic form needed, the same recipe should extend to codes built from $Z_4$-valued quadratic forms and to symplectic rather than orthogonal settings.
- The absence of theoretical distance bounds for the quadratic-residue family suggests the family's good behaviour at $p=13$ and $p=29$ may be a small-prime accident; a natural test is whether the same construction degrades at larger primes of the form $8j+5$.
- The correspondence between Bell states and elements of $E/IZ(E)$, with $Q$ recording symmetry under exchange of the two parties, hints that the code condition can be read as a statement about which bipartite operations preserve a set of Bell pairs, which is a different physical framing of the same algebra.
Original abstract
A group theoretic framework is introduced that simplifies the description of known quantum error-correcting codes and greatly facilitates the construction of new examples. Codes are given which map 3 qubits to 8 qubits correcting 1 error, 4 to 10 qubits correcting 1 error, 1 to 13 qubits correcting 2 errors, and 1 to 29 qubits correcting 5 errors.
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.
The abstract, sentence by sentence
A group theoretic framework is introduced that simplifies the description of known quantum error-correcting codes and greatly facilitates the construction of new examples. Codes are given which map 3 qubits to 8 qubits correcting 1 error, 4 to 10 qubits correcting 1 error, 1 to 13 qubits correcting 2 errors, and 1 to 29 qubits correcting 5 errors.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | A group theoretic framework is introduced that simplifies the description of known quantum error-correcting codes and greatly facilitates the construction of new examples. | contribution 0.94 | 0.92 | 0.47 | asserted 1.00 |
| s1 | Codes are given which map 3 qubits to 8 qubits correcting 1 error, 4 to 10 qubits correcting 1 error, 1 to 13 qubits correcting 2 errors, and 1 to 29 qubits correcting 5 errors. | result 0.73 | 0.90 | 0.27 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v3
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
References
How later papers used it
103 later papers cite it
1 later paper by other authors is listed below: 1 built on it.
Builds on it 1 paper
-
Generalized the machinery behind Pauli stabilizer block codes from this paper to infinite lattices.
Clifford Quantum Cellular Automata: Trivial group in 2D and Witt group in 3D (2019) · 0.92 · paraphrased: the licence does not allow quoting
How the literature uses it
39 arXiv papers cite this in 67 sentences
Papers citing it · 32 sentences without a confident label
Builds on it 1 paper
-
This is a generalization of a machinery behind Pauli stabilizer block codes [ref] to infinite lattices.
Clifford Quantum Cellular Automata: Trivial group in 2D and Witt group in 3D · Translation invariant Clifford QCAs and polynomial symplectic matrix · 0.92
Uses its method or tool 3 papers
-
As in [ref] , we define a symplectic inner product $*$ on $ℤ_2^2n$ by [equation] Thus, two elements $g,h$ in $𝒢_n$ is commutative if and only if the symplectic inner product $φ(g) * φ(h)$ of $φ(g)$ and $φ(h)$ is zero.
A Construction of Quantum Stabilizer Codes Based on Syndrome Assignment by Classical Parity-Check Matrices · Binary Codes Corresponding to Stabilizer Groups · 0.83
-
Starting with classical error-correcting codes in the form of Reed–Solomon codes built over projective lines over finite fields [ref] , one may upgrade these to quantum codes by applying the CRSS algorithm [ref] , which we show can be generalized to directly obtain perfect tensors from certain self-orthogonal codes.
Nonarchimedean Holographic Entropy from Networks of Perfect Tensors · Introduction · 0.84
-
We can encode a stabilizer group $S$ into an $(n-k)×2n$ check matrix [ref] : [equation] where $(α^(i),β^(i))∈_p^n×_p^n$ characterizes the generators of the stabilizer group $S$.
Narain CFTs from qudit stabilizer codes · Symplectic representation · 0.83
Compares with it 2 papers
-
This is asymptotically the same as the distance of a code defined by a random unitary from the complete Clifford group, which is known to achieve the quantum Gilbert-Varshamov bound [ref] .
Short random circuits define good quantum error correcting codes · Results · 0.97
-
In [ref] , the quantum Hamming bound says that for an $[[n,k,d≥d=2t+1]]$ quantum code, [equation] and the asymptotic form is [equation] or [equation] The quantum singleton bound [ref] says that for an $[[n,k,d]]$ quantum code, [equation] or [equation] The Gilbert-Varshamov bound for a general quantum stabilizer codes, proved in Theorem 2 in [ref] , says that an $[[n,k,d=2t+1]]$ stabilizer code exists if [equation] or [equation] The Gilbert-Varshamov bound for CSS codes, proved in Section V in [ref] , says that an $[[n,k,d=2t+1]]$ CSS code exists if [equation] or [equation] The above known quantum bounds in the literature are depicted in Fig. [ref].
A Construction of Quantum Stabilizer Codes Based on Syndrome Assignment by Classical Parity-Check Matrices · Asymptotic Coding Efficiency · 0.97
Cites it as background 24 papers
-
As already mentioned, the stabilizer circuits form a finite group which, modulo the group that is generated by the center and the Pauli subgroup, is isomorphic to the binary symplectic group defined as follows (see also [ref] and [ref] ):
Shorter stabilizer circuits via Bruhat decomposition and quantum circuit transformations · Stabilizers and the symplectic group · 0.94
-
The idea of stabilizer codes was proposed in [ref] and the properties of stabilizer codes were extensively addressed in [ref] .
A Construction of Quantum Stabilizer Codes Based on Syndrome Assignment by Classical Parity-Check Matrices · Introduction · 1.00
-
Before long, a simple and systematic method of slicing the state vector space into discretely labeled subspaces with help of classical error correcting codes was discovered by Calderbank and Shor [ref] and Steane [ref] , and generalized to what is now known as stabilizer codes by Gottesman [ref] or symplectic/additive codes by Calderbank, Rains, Shor and Sloane [ref] .
Algebraic Methods for Quantum Codes on Lattices · Introduction · 0.99
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.