Steane code

In plain terms

Classical error correction has a gem called the Hamming code: seven bits carry four, arranged so that any single flipped bit announces its own position. Steane's insight was that quantum errors come in two flavours -- bit flips and phase flips -- and that one and the same Hamming code can police both at once, provided its parity checks are compatible with each other in a precise sense.

They are, and the result is seven qubits protecting one logical qubit against any single-qubit error. Measure six "stabiliser" checks; the answers spell out which qubit went wrong and how, without ever looking at the protected information itself.

The construction -- classical code plus its own dual, run in the X and Z bases -- is called CSS after Calderbank, Shor and Steane, and it is the template from which most practical quantum codes descend.

In CSD

The first genuine CSS instance of the corpus's stabiliser layer, landed the same day as the layer itself: the Hamming parity rows give three X-type and three Z-type generators, the CSS orthogonality condition is kernel-checked, and the general stabiliser machinery instantiates wholesale -- the code space has dimension exactly two by the general trace formula, one logical qubit.

Both logical states are exhibited concretely as uniform superpositions over the Hamming row space and its all-ones coset, proved stabilised by all sixty-four group elements and orthonormal; the logical X and Z operators act on them as a genuine encoded qubit. Single-qubit errors are proved to carry nonzero, pairwise-distinct syndromes -- the distance-3 property. Honest scope: no recovery map, no Knill-Laflamme conditions, no fault-tolerance claims -- the same posture as the three-qubit code modules it generalises.

Mathematically

Take H the 3-by-7 Hamming parity matrix whose columns are the binary expansions of 1 through 7. The rows satisfy H H^T = 0 over F2, so the six Pauli operators X^(h_i) and Z^(h_i) commute and generate a 64-element stabiliser group with trivial signs. The stabiliser trace formula gives code dimension 2^7/2^6 = 2.

The logical zero is the uniform superposition over the row space C2 (eight strings); the logical one over the coset C2 + 1111111 -- the all-ones string is a Hamming codeword outside the row space, so the supports are disjoint. X^(all-ones) swaps the two states; Z^(all-ones) fixes the zero and negates the one, since the all-ones string has odd weight against itself and even against the rows. Single-error syndromes are the columns of H: nonzero and pairwise distinct, hence distance 3.

The name

Andrew Steane, an Oxford atomic physicist, found the seven-qubit code in 1996 within months of Shor's nine-qubit construction, and independently of the Calderbank-Shor paper whose framework it shares -- hence "CSS codes" carries all three names. Steane's version is smaller than Shor's and self-dual, which makes its logical gates unusually clean: the transversal application of a Clifford gate to all seven qubits implements the same gate on the logical qubit.

Steane went on to become one of the architects of fault-tolerant quantum computation; the seven-qubit code remains the standard pedagogical example and a building block of colour codes.