The Stabilizer Formalism
The compact algebra behind essentially every practical error-correcting code
By the end of this topic you'll be able to
Writing out a code state by state, the way the previous topic wrote out Shor's 9-qubit cat states, gets unwieldy fast for larger codes. Preskill's notes build a far more compact description on top of the n-qubit Pauli group Gₙ: all tensor products of I, X, Y, and Z across n qubits, together with overall signs.
Let S be an abelian (mutually commuting) subgroup of Gₙ. The stabilizer code associated with S is defined as the simultaneous +1 eigenspace of every element of S — that is, |ψ⟩ belongs to the code exactly when M|ψ⟩ = |ψ⟩ for every M in S.
If S has n−k independent generators, Preskill shows the resulting code space has dimension 2ᵏ, encoding k logical qubits — and, just as importantly, those n−k generators double as the check operators of the code: the very observables measured to diagnose an error, since an error that anticommutes with a generator flips its measured eigenvalue from +1 to −1, revealing that something has gone wrong.
For the 3-qubit bit-flip code, this stabilizer group is generated by exactly Z₁Z₂ and Z₂Z₃ — the same syndrome measurements from the previous topic, now recognizable as generators of an abelian subgroup of the Pauli group rather than an ad hoc trick specific to that one code.
This formalism carries a genuinely surprising computational consequence, the Gottesman-Knill theorem: any quantum circuit built entirely from stabilizer operations — preparing computational basis states, applying Clifford gates such as H, S, and CNOT, and measuring in the computational basis — can be simulated efficiently on an ordinary classical computer, despite the entanglement present throughout.
This tells you something important about where quantum advantage actually comes from: entanglement and superposition by themselves are not sufficient for a speedup over classical computation. Reaching computations a classical computer genuinely cannot efficiently simulate requires gates outside the Clifford group, such as T.
CSS codes, named for Calderbank, Shor, and Steane, are a widely used family of stabilizer codes built by combining two classical linear codes satisfying a compatibility condition, so as to correct bit-flip and phase-flip errors independently using the same underlying structure. The Steane [[7,1,3]] code is the standard example, and this same CSS construction generalizes cleanly to the surface codes that dominate real hardware today, covered next.
Try It Yourself
Confirm that Z₁Z₂ and Z₂Z₃ (the bit-flip code's stabilizer generators) actually commute with each other, and check that |000⟩ is a +1 eigenstate of both — a requirement for them to jointly define a valid code space.
- 1Z₁Z₂ and Z₂Z₃ share qubit 2 but act on different pairs otherwise. Since every Pauli Z commutes with every other Z (they're all diagonal matrices in the computational basis), any two Z-type operators automatically commute, regardless of which qubits they touch: Z₁Z₂Z₂Z₃ = Z₁Z₂²Z₃ = Z₁Z₃ = Z₂Z₃Z₁Z₂. ✓
- 2Check Z₁Z₂ on |000⟩: bits 1,2 are both 0 (matching), so by the parity rule from the previous topic, the eigenvalue is +1.
- 3Check Z₂Z₃ on |000⟩: bits 2,3 are both 0 (matching), so the eigenvalue is also +1.
- 4The same check on |111⟩ gives +1 for both generators as well (bits 1,2 match at 1, and bits 2,3 match at 1) — so both |000⟩ and |111⟩, and therefore any superposition α|000⟩+β|111⟩, sit in the simultaneous +1 eigenspace of {Z₁Z₂, Z₂Z₃}.
Z₁Z₂ and Z₂Z₃ commute (both are products of Z operators, which always commute with each other), and both give eigenvalue +1 on |000⟩ and on |111⟩ — confirming the entire code space α|000⟩+β|111⟩ is the simultaneous +1 eigenspace of this stabilizer group, exactly as the stabilizer formalism requires.
Reference
| Stabilizer group | Pauli operators that fix the code's logical states (+1 eigenvalue) | |
| Clifford gates | Gates efficiently classically simulable per Gottesman-Knill | |
| Gottesman-Knill theorem | Entanglement alone isn't enough for quantum advantage | |
| CSS code | Independently corrects bit-flip and phase-flip errors |
Quick Check
What does the Gottesman-Knill theorem tell you?
What defines a code's stabilizer group?