The Steane Code as CSS

The Steane code is the prototypical CSS code: a $[[7,1,3]]$ code that protects one logical qubit in seven physical qubits and corrects any single-qubit error. It is built entirely from the classical $[7,4]$ Hamming code, and studying it concretely shows the CSS machinery in action.

The classical seed: the [7,4] Hamming code

The $[7,4]$ Hamming code encodes $4$ data bits in $7$ bits and corrects one bit error. Its $3 \times 7$ parity-check matrix can be written with columns equal to the binary numerals $1$ through $7$ :

H = \begin{pmatrix} 0 & 0 & 0 & 1 & 1 & 1 & 1 \\ 0 & 1 & 1 & 0 & 0 & 1 & 1 \\ 1 & 0 & 1 & 0 & 1 & 0 & 1 \end{pmatrix}.

The Hamming code is dual-containing: $C^\perp \subseteq C$ , equivalently $H H^{\mathsf T} = 0 \pmod 2$ . This is precisely the property that lets a single classical code seed a CSS code.

The Steane stabilizers

Taking $H_X = H_Z = H$ , the Steane code has six stabilizer generators — three $X$ -type and three $Z$ -type — one per row of $H$ :

\begin{aligned} g_1 &= X_4 X_5 X_6 X_7, & g_4 &= Z_4 Z_5 Z_6 Z_7, \\ g_2 &= X_2 X_3 X_6 X_7, & g_5 &= Z_2 Z_3 Z_6 Z_7, \\ g_3 &= X_1 X_3 X_5 X_7, & g_6 &= Z_1 Z_3 Z_5 Z_7, \end{aligned}

(using $1$ -indexed qubits to match the Hamming columns). The three $X$ -generators mutually commute, the three $Z$ -generators mutually commute, and each $X$ -generator commutes with each $Z$ -generator because the overlapping Hamming rows share an even number of qubits — the CSS condition. With $n = 7$ , $r_X = r_Z = 3$ independent generators, the code encodes

k = 7 - 3 - 3 = 1

logical qubit.

Distance and error correction

The distance of the Steane code is $d = 3$ , inherited from the Hamming distance $3$ of the classical code. A distance- $3$ code corrects any error of weight $\lfloor (d-1)/2 \rfloor = 1$ . Because $X$ - and $Z$ -errors are handled by separate syndromes:

The three $Z$ -stabilizers measure an $X$ -error syndrome (a 3-bit Hamming syndrome locating a single $X$ -flip).
The three $X$ -stabilizers measure a $Z$ -error syndrome (locating a single $Z$ -flip).
A $Y$ -error is a simultaneous $X$ and $Z$ error and is corrected by both syndromes at once.

So any single-qubit Pauli error is detected and corrected — the hallmark of a distance-3 code.

Logical operators and logical states

The logical operators can be taken as the weight-7 strings

\bar{X} = X_1 X_2 X_3 X_4 X_5 X_6 X_7, \qquad \bar{Z} = Z_1 Z_2 Z_3 Z_4 Z_5 Z_6 Z_7,

(transversal Pauli strings) which commute with all stabilizers but are not themselves in the stabilizer group, and which anticommute with each other as logical $X$ and $Z$ should. The logical $|0_L\rangle$ is the uniform superposition over the even-weight Hamming codewords, and $|1_L\rangle = \bar{X}|0_L\rangle$ over the complementary coset.

Why the Steane code is special

Transversal Clifford group. The Steane code admits transversal logical $H$ , $S$ , and CNOT — apply the physical gate to all seven qubits and the logical gate happens fault-tolerantly. This follows from its symmetric, self-dual CSS structure with $H_X = H_Z$ .
Smallest CSS code correcting any single error. It is the smallest code built from a single classical Hamming code, making it a favorite pedagogical and benchmarking code.
A bridge to color codes. The Steane code is the smallest two-dimensional color code, linking it to the topological-code family.

The takeaway

The Steane $[[7,1,3]]$ code is the CSS construction applied to the dual-containing $[7,4]$ Hamming code with $H_X = H_Z = H$ . It uses three $X$ - and three $Z$ -stabilizers to encode one logical qubit, corrects any single-qubit error via two independent classical Hamming decoders, and enjoys a fully transversal Clifford group — making it a cornerstone example of fault-tolerant code design.