You’ve now met almost every single-qubit gate you’ll ever encounter: , , , , , , and the continuous rotations , , . One question remains:
Is that all the single-qubit gates?
Or are there more out there we haven’t seen?
The answer turns out to be the most important structural fact about single-qubit operations: every possible single-qubit gate can be written as a sequence of three rotation gates. Not approximately. Exactly (up to an irrelevant global phase).
The decomposition theorem
For any single-qubit unitary , there exist three real numbers , , such that:
where is some global phase (which you can ignore). This is called the - decomposition, and it’s a theorem that falls out of some fairly direct linear algebra. Three parameters — , , — are exactly enough to describe every possible unitary matrix, modulo the global phase.
Here’s what it means practically: the set of all possible single-qubit gates is 3-dimensional. Every one of them is reachable by chaining together at most three rotation gates. That’s it. There’s no hidden fourth gate lurking that you can’t decompose.
Some examples
Every gate we’ve seen can be written as a rotation sequence. A few:
- Hadamard: , up to global phase. (You can check this in the widget.)
- gate: , up to global phase.
- gate: , up to global phase.
- gate: , up to global phase.
The Hadamard is the interesting one — it’s not just a single rotation, it’s a combination. That’s why it feels “special” compared to the other gates we’ve met: it mixes -axis and -axis rotations, which is what lets it take to the equator and back.
Finite vs continuous universality
There are two different notions of “universal” that get used in the quantum computing literature, and they are worth pulling apart:
Continuous universality is what we just described: with the three rotation gates and a way to dial in any real angle, you can implement exactly any single-qubit unitary. This is mathematically clean but physically idealized — no real quantum computer can specify an angle to infinite precision.
Discrete universality is the practical version: starting from a finite set of gates like , you can approximate any single-qubit unitary to arbitrary precision by stringing together enough of them. You can never get it exactly, but you can get as close as you want if you’re willing to use more gates. The Solovay–Kitaev theorem guarantees this works efficiently — approximating a target unitary to precision only needs gates.
Both notions are important. Continuous universality is how we think about algorithms on paper. Discrete universality is how we actually implement them on fault-tolerant hardware, where the finite set has become the de facto standard.
Play: reach a target
Here’s a small challenge. Using only the gates below, starting from , can you:
- Reach the state ? (Easy.)
- Reach the state (the equator point)? (Medium — you’ll need more than one gate.)
- Reach the state ? (Medium.)
- Reach exactly halfway between and ? (Harder — think about rotations.)
For the last one, note that you won’t be able to get there with these discrete gates alone. You’d need a smaller rotation than provides. In principle, you could build it up from many s and s — that’s what Solovay–Kitaev is for. In practice, you’d just use directly.
What’s next
You’ve completed Module 3. You now know everything there is to know about single-qubit gates — the discrete ones, the continuous ones, how they decompose, and what “universal” means. In Module 4 we add a second qubit. That’s where the story gets genuinely strange: you’ll meet tensor products, entanglement, and the first genuinely non-classical protocol — all starting from a gate you’ve already met (and one you haven’t).
Take a breath. The foundations are done.