Stabilizer Circuit

One-Sentence Description

A stabilizer circuit is a quantum circuit built from Clifford gates, stabilizer-state preparations, Pauli measurements, and classical processing that maps Pauli stabilizer data to Pauli stabilizer data.

Physical Setup

The model is a discrete qubit circuit model. It is used for error-correction syndrome extraction, Clifford benchmarking, stabilizer-state preparation, teleportation primitives, and classical simulation baselines for quantum circuits.

It is not a universal quantum-computing model by itself. Universal fault-tolerant schemes add a non-Clifford resource, such as a $T$ gate, magic state, or nonstabilizer measurement. Universal Gate Sets owns the density, synthesis, and fault-tolerant completion arguments.

Hilbert Space

For $n$ qubits,

$$\mathcal H = (\mathbb C^2)^{\otimes n}.$$

The $n$-qubit Pauli group is generated by one-qubit Pauli operators and phases. A stabilizer state is the common $+1$ eigenstate of $n$ independent commuting Pauli generators.

More generally, if $r$ independent commuting stabilizer generators act on $n$ qubits and do not generate $-I$, the stabilized subspace has dimension

$$\dim\mathcal C = 2^{n-r}.$$

Allowed Operations

A standard stabilizer circuit allows:

• preparations of computational-basis states such as $\lvert 0\rangle^{\otimes n}$;
• Clifford gates such as $H$, $S$, and CNOT;
• Pauli measurements, with optional classically controlled Clifford corrections;
• discarding or resetting qubits when the circuit model explicitly includes those operations.

The Clifford group is characterized by Pauli normalization:

$$U P U^\dagger \in \mathcal P_n \qquad \text{for every }P\in\mathcal P_n.$$

This property is why a stabilizer tableau can update generators rather than storing a generic state vector.

Solvability

Stabilizer circuits are classically efficiently simulable in the usual Gottesman-Knill setting. The simulation tracks the stabilizer generators and measurement outcomes instead of amplitudes for all $2^n$ basis states.

The statement has assumptions: the gates are Clifford, preparations and measurements are stabilizer operations, and the requested output is compatible with efficient stabilizer sampling or tracking. Adding generic non-Clifford gates destroys the closed stabilizer update rule.

What It Teaches

The stabilizer-circuit model isolates the part of quantum computation controlled by Pauli algebra. It makes error propagation transparent: a Pauli error remains a Pauli error under Clifford conjugation, and a Pauli measurement reveals a syndrome bit determined by commutation.

Canonical Links

• Stabilizer Formalism
• Stabilizer Identities
• Quantum Gates
• Stabilizer States Preview
• Graph States
• Pauli Matrices

Common Mistakes

• Calling a Clifford circuit universal without specifying an added non-Clifford resource.
• Forgetting that the stabilizer group must not contain $-I$.
• Treating a stabilizer tableau as a list of amplitudes.
• Ignoring the qubit ordering convention when converting between Pauli strings and binary tableau data.

Quick Check

Why does a CNOT gate fit naturally into the stabilizer-circuit model?

Solution

CNOT conjugates Pauli strings to Pauli strings. For example, it maps a control-qubit $X$ error to an $X$ on both control and target, and maps a target-qubit $Z$ error to a $Z$ on both control and target. Since Pauli generators remain Pauli generators, stabilizer data stays closed under the update.

References

• D. Gottesman, “The Heisenberg representation of quantum computers,” arXiv:quant-ph/9807006, 1998.
• S. Aaronson and D. Gottesman, “Improved simulation of stabilizer circuits,” Physical Review A 70, 052328, 2004.
• M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2010.