Gates & Circuits
Clifford Group
The set of gates generated by Hadamard, S, and CNOT; efficiently simulable on a classical computer and cheap in error-corrected machines.
Definition
The Clifford group is a special family of quantum gates that includes the Hadamard gate, the S phase gate, and the CNOT gate, along with everything you can build from them. Circuits made only of these gates behave in a very orderly way: they map simple states to simple states, and an ordinary computer can simulate them even for hundreds of qubits. They matter because error-correcting codes make them easy to perform on protected qubits, and because adding one more kind of gate, such as T, makes the set universal.
In depth
The stabilizer formalism explains why Clifford circuits are easy to simulate. A stabilizer state on n qubits can be described by n Pauli operators that leave it unchanged, which takes only about n squared bits, instead of 2^n amplitudes. A Clifford gate transforms the list of Paulis in a simple way, and measuring a Pauli updates the list efficiently. Programs that use only these operations, including many error correction protocols, can be simulated at enormous scale, and that is how researchers study surface codes with thousands of qubits on ordinary computers.
The same structure makes the Clifford group the natural gate set for error-corrected machines. In the surface code, Clifford gates can be performed on logical qubits with lattice surgery or transversal operations, at modest cost. The non-Clifford gates, needed for universality, require magic states and are far more expensive. Resource estimates therefore split a circuit into a cheap Clifford part and an expensive non-Clifford part.
Clifford gates are also a standard tool for benchmarking. Randomized benchmarking applies random Clifford sequences and measures how the fidelity decays with sequence length. Because Clifford sequences can be inverted classically with a single final Clifford, the method measures the average error per gate without being affected by state preparation and measurement errors.
Technical Definition
The Clifford group on n qubits is the normalizer of the Pauli group: unitaries that map Pauli operators to Pauli operators under conjugation. It is generated by H, S, and CNOT. The Gottesman-Knill theorem states that Clifford circuits with Pauli measurements can be simulated in polynomial time using the stabilizer formalism.
Visual Explanation: An Analogy
Imagine a dance in which every move keeps the dancers on a fixed grid of positions. You can track the whole performance with a simple notebook even for a large crowd. Clifford gates are those grid-preserving moves, and the dance only becomes hard to track when you add moves that leave the grid, like the T gate.
Key facts
| Item | Detail |
|---|---|
| Generators | Hadamard, S, and CNOT |
| Classical simulation | Polynomial time by the Gottesman-Knill theorem |
| Stabilizer states | Described by n Pauli operators, about n squared bits |
| Not included | T gate, Toffoli gate, and arbitrary-angle rotations |
| Use in benchmarking | Randomized benchmarking uses random Clifford sequences |
Where the idea comes from
Daniel Gottesman introduced the stabilizer formalism in 1996 and 1997 as a way to describe quantum error-correcting codes, and the Gottesman-Knill theorem followed in 1998. The group is named after William Kingdon Clifford, a 19th-century mathematician whose algebras are related to the structure of the Pauli matrices.
Real-World Use Cases
- Describing and simulating error-correcting codes and syndrome measurement circuits.
- Randomized benchmarking of gate fidelities.
- Splitting a circuit into cheap Clifford operations and costly non-Clifford operations for cost estimates.
- Preparing entangled stabilizer states such as GHZ states and graph states.
How it differs from related ideas
- Clifford circuits are classically simulable, while Clifford plus T circuits are universal and believed hard to simulate.
- The Pauli group is a subset of the Clifford group, and the Clifford group maps Paulis to Paulis.
- Clifford gates are cheap in surface-code machines, and non-Clifford gates are expensive.
Common Misconceptions
- Clifford circuits can still produce highly entangled states. They are easy to simulate, not trivial.
- Clifford does not mean limited to few qubits. The simulation scales to very large numbers.
- The group is infinite for the continuous case only when including arbitrary rotations, which are not Clifford. The Clifford group on n qubits is finite, modulo phase.
Frequently asked questions
What are Clifford gates?
The gates generated by Hadamard, S, and CNOT. They map Pauli operators to Pauli operators and can be efficiently simulated classically.
Why are Clifford gates cheap in fault-tolerant computers?
Error-correcting codes such as the surface code implement them directly on encoded qubits, without magic states.
What does the Gottesman-Knill theorem say?
That circuits of Clifford gates with Pauli measurements can be simulated in polynomial time on a classical computer, so they cannot give a quantum speedup.
Related Terms
Keep exploring
- Algorithm: Quantum Error-Correcting Codes (Shor Code, Surface Code)
- Hardware: Google Willow