The Pauli & Clifford Groups
The group structure behind stabilizers and error correction.
Conjugate a Pauli by and you get another Pauli. The unitaries with this property form the Clifford group: finite modulo phases, with exactly 24 single-qubit elements and 11,520 two-qubit ones, and secretly the symplectic group over . It is the backbone of stabilizer codes, randomized benchmarking and the Gottesman–Knill theorem.
What you’ll learn
- Define the -qubit Pauli group, compute its order and center, and encode it in with the symplectic form.
- Define the Clifford group as the normalizer of the Pauli group and prove .
- Derive , giving 24 and 11,520.
- Identify the single-qubit Clifford group with the rotation group of the octahedron, and place in the Clifford hierarchy.
The Pauli group and its binary picture
Up to phase, a Pauli string is a pair of bit strings. Write for . Multiplication becomes addition, , so . All of the non-commutativity is captured by a single bilinear form.
Move past using .
The product in the other order carries ; take the ratio.
Tensor factors multiply their signs, so the exponents add. is the standard symplectic form: bilinear, alternating () and non-degenerate.
Do and commute?
- No: and anticommute on the first qubit
- Yes: they anticommute on exactly two sites, and
- No: Pauli strings that differ on every site never commute
- Only up to a factor of
Show the answer
B. Yes: they anticommute on exactly two sites, and
Site by site: and anticommute, and anticommute, and commute. Two sign flips cancel, so and the strings commute. The same count shows why the Bell-pair stabilizers and commute.
The Clifford group is symplectic
| Gate | -type generators | -type generators |
|---|---|---|
| , | , |
Count symplectic bases: choose ( ways), then with (an affine hyperplane, ways), then recurse on their -dimensional symplectic complement. Note .
Multiply by the kernel, .
The order grows like : finite, but hopeless to enumerate beyond a few qubits.
One qubit: the symmetries of the octahedron
Modulo phase, a single-qubit Clifford is a rotation of the Bloch sphere that permutes the six Pauli eigenstates : a rotational symmetry of the octahedron. To count them, choose where goes (six signed axes), then where goes (four signed axes perpendicular to it). The image of is then forced, which rules out reflections.
How many single-qubit Cliffords are there, modulo global phase?
Show the answer
24
, matching . By rotation type: the identity (1), half-turns about (3), quarter-turns about (6), third-turns about the 4 body diagonals (8), and half-turns about the 6 edge axes such as 's axis (6). The group is isomorphic to .
Think first Why must a Clifford map Pauli eigenstates to Pauli eigenstates?
If and , then : carries the eigenstate of to the eigenstate of . On qubits the same argument shows that Cliffords map stabilizer states to stabilizer states, of which there are (6 for one qubit, 60 for two).
Stabilizers, the hierarchy, and why it matters
On qubits, a stabilizer state is the unique joint eigenstate of independent, commuting Pauli strings, its stabilizers. A Clifford circuit acts on such a state by conjugating its stabilizers, a bookkeeping task that is classically efficient. Try reasoning in stabilizers instead of amplitudes: before you build, work out what must be.
Why this matters. Gates in can be applied by gate teleportation, consuming a resource state and correcting with Cliffords (Gottesman & Chuang 1999). That is the seed of magic-state computing: in a surface-code machine, Cliffords are cheap and every costs a distilled magic state. Clifford circuits on stabilizer inputs, meanwhile, can be simulated in polynomial time (Gottesman–Knill, made fast with the tableaux of Aaronson & Gottesman 2004). And uniformly random multiqubit Cliffords reproduce Haar averages up to third moments (the group is a unitary 3-design, though not a 4-design), which is what randomized benchmarking relies on.
Which gate is in the third level of the Clifford hierarchy but not in the second?
Show the answer
C.
is a Clifford but not a Pauli, and ; so .
Key takeaways
- has elements; modulo phases it is , and commutation is the symplectic form .
- The Clifford group normalizes , is generated by , and CNOT, and satisfies .
- : 24 for one qubit (the octahedral rotation group) and 11,520 for two.
- lies in the third level of the Clifford hierarchy; such gates can be teleported using magic states, which is how fault-tolerant machines reach universality.
Check yourself
In the interactive lesson these are scored with your confidence, and what you miss comes back for review.
How many elements does the two-qubit Pauli group have, phases included?
- 16
- 32
- 64
- 256
Show the answer
C. 64
Four phases times strings: with .
A single-qubit Clifford maps . Which image of is allowed?
Show the answer
B.
The images must be Hermitian Paulis that anticommute, as and do. and anticommute, so works, and then .
What is , the number of two-qubit Cliffords modulo phase?
Show the answer
D.
. Only of them are products of single-qubit Cliffords; the rest entangle.
Why is the Clifford group not a universal gate set?
- Modulo phases it is a finite group, so it cannot approximate arbitrary unitaries
- It contains no entangling gates
- Clifford gates are not unitary
- and commute, so together they generate only a few rotations
Show the answer
A. Modulo phases it is a finite group, so it cannot approximate arbitrary unitaries
A finite set of unitaries (mod phase) cannot be dense in . Separately, Gottesman–Knill shows that Clifford circuits on stabilizer inputs are classically simulable. Adding a non-Clifford gate such as makes the set universal.
Further reading
- D. Gottesman, Stabilizer Codes and Quantum Error Correction, PhD thesis, Caltech (1997), arXiv:quant-ph/9705052.
- D. Gottesman, "The Heisenberg representation of quantum computers" (1998), arXiv:quant-ph/9807006.
- A. R. Calderbank, E. M. Rains, P. W. Shor & N. J. A. Sloane, "Quantum error correction via codes over GF(4)", IEEE Trans. Inf. Theory 44, 1369 (1998).
- D. Gottesman & I. L. Chuang, "Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations", Nature 402, 390 (1999).
- S. Aaronson & D. Gottesman, "Improved simulation of stabilizer circuits", Phys. Rev. A 70, 052328 (2004).