At each qubit, two matrices from either commute or anticommute. Moving every past the corresponding therefore gives
where is the number of positions containing distinct nonidentity Pauli matrices. Thus two Pauli strings always commute or anticommute. If they anticommute and a vector were stabilized by both, then and , contradicting . Their common stabilizer subspace is consequently the zero subspace .
The group average
is Hermitian. In its square, every occurs exactly times among products , and therefore . Moreover for every , so its image lies in the stabilizer subspace , while for every . Thus is the orthogonal projector onto . If are independent generators, expanding the product chooses each element of exactly once and gives the stabilizer-projector formula
A computational-basis vector has eigenvalue under . Simultaneous eigenvalue for , , and therefore requires
The stabilizer subspace is
It is two-dimensional because the three displayed nonidentity stabilizers contain only two independent generators; indeed .
The commuting terms
are independent stabilizer generators. Since , every ground state has . The resulting two-dimensional stabilizer subspace is
the phase-flip repetition code. A convenient pair of logical Pauli operators is
Indeed, they commute with every stabilizer, anticommute with each other, and are not stabilizers.
For phase-flip errors and , the operator entering the Knill--Laflamme condition is and has weight at most . Every nonempty proper product of anticommutes with some unless it is the full logical operator . The Knill--Laflamme conditions therefore hold whenever , and fail once two allowed errors can differ by . Thus
Each physical commutes with all stabilizers, and is a product of stabilizers. Hence every acts on the code as the undetectable logical operator . The code cannot detect, and therefore cannot correct, even a single bit flip.
Stabilizer code Created 2026-09-24 Updated 2026-10-14
A stabilizer code is the common eigenspace of a stabilizer group , an abelian subgroup of the Pauli group excluding . Choose independent stabilizer generators on physical qubits. They are commuting Hermitian operators, each squaring to . The stabilizer subspace and its orthogonal projector are
The stabilizer-projector formula gives , so logical qubits remain. Independent here means that no nonempty product of the chosen stabilizer generators is . Excluding is necessary: a vector cannot simultaneously be fixed by and unless it is zero.
For the three-qubit bit-flip repetition code, take and , with the Pauli Z gate on site and identities elsewhere. The stabilizer group is . Both stabilizer generators have eigenvalue exactly on the span of and , giving dimensions for one logical qubit. A projective measurement of these checks distinguishes four orthogonal two-dimensional sectors rather than eight individual computational basis states.
A Pauli error that anticommutes with a stabilizer generator changes that check's sign, producing an error syndrome. A Pauli operator commuting with every check can still act on the logical qubits; the centralizer of a stabilizer group describes these possibilities. Thus the number of checks determines the encoded dimension, while the quantum code distance determines protection against arbitrary local errors. The five-qubit error correcting code, for instance, has four stabilizer generators and quantum code distance three; the three-qubit bit-flip repetition code has two checks but quantum code distance one because a single phase flip is unflagged. [ref].
For a stabilizer group , the orthogonal projector onto its stabilizer subspace is
A stabilizer group with independent generators maps injectively to an r-dimensional isotropic subspace of the binary symplectic space of Pauli labels. For generator rows , commutation is over . Its stabilizer subspace has dimension . The labels of the centralizer of a stabilizer group form ; labels in act as nontrivial logical Pauli operators.