The Stabilizer Formalism

The Stabilizer Formalism

The previous lesson ended with a table of eight operators, labeled stabilizers, and the bare claim that measuring them extracts a syndrome. This lesson supplies the machinery behind that table: a single idea that turns the parity checks from the repetition code, the syndrome tables, and Shor's eight-row list into one picture.

Describing a state by what fixes it

The usual way to specify a quantum state is to list its amplitudes. The stabilizer way is to list operators that leave it untouched.

Take Z. It maps |0⟩ to |0⟩ and |1⟩ to −|1⟩, so |0⟩ is the unique single-qubit state satisfying Z|ψ⟩ = |ψ⟩. We say Z stabilizes |0⟩, and "the state stabilized by Z" identifies |0⟩ just as precisely as its amplitudes do. Likewise X|+⟩ = |+⟩: the state stabilized by X is |+⟩.

The idea scales to entangled states. Consider the Bell state Φ⁺ = (|00⟩ + |11⟩)/√2. The operator X⊗X flips both qubits, swapping |00⟩ and |11⟩; the sum is unchanged, so X⊗X stabilizes Φ⁺. The operator Z⊗Z leaves |00⟩ alone and puts a factor of (−1)(−1) = +1 on |11⟩, so it stabilizes Φ⁺ too. In fact, Φ⁺ is the only two-qubit state fixed by both. The counting works like this: on n qubits, each independent stabilizer condition cuts the space of compatible states in half. Two conditions on two qubits leave exactly one state. Impose only $n-k$ conditions and a $2^k$-dimensional subspace survives: a code space with room for k logical qubits. Hold that thought.

The Pauli group in one paragraph

The operators in this game are Pauli strings: tensor products that put I, X, Y, or Z on each qubit, times an overall sign of ±1 or ±i. So Z₀Z₁ means Z on qubits 0 and 1 and identity everywhere else. Multiplying two Pauli strings gives another Pauli string, so together they form a group, the Pauli group. The one algebraic fact you need: any two Pauli strings either commute or anticommute. On a single qubit, X, Y, and Z pairwise anticommute (XZ = −ZX, and so on) while I commutes with everything. For strings, count the positions where the two operators place anticommuting Paulis: an odd count means the strings anticommute, an even count means they commute. That single sign is the entire engine of error detection.