Table of Contents
Single-qubit gates
Single-qubit gates are unitary operations that act on one qubit. They are represented by unitary matrices and form the Lie group . Every quantum computation can be decomposed into single-qubit rotations and two-qubit entangling gates (e.g., CNOT), making single-qubit gates the fundamental building blocks of quantum circuits.
A single-qubit gate is applied to a state to produce a new state . The gates compose: two gates in sequence form a new gate (matrix product). Some gates are self-inverse (like Pauli gates and Hadamard); others have finite order (, ); some are parameterized (RX, RY, RZ with rotation angle ).
All single-qubit gates correspond to rotations on the Bloch sphere; any unitary in can be decomposed as a product of rotations around two perpendicular axes.
List of gates
Bloch sphere action
Single-qubit gates act as rotations on the Bloch sphere. Pauli gates (X, Y, Z) are 180° rotations around their respective axes. The Hadamard swaps the x and z axes. Phase gates (S, S†, T, T†) are rotations around the z-axis. Rotation gates (, , ) parameterize arbitrary angles around each axis. Universal gate specifies an arbitrary rotation via three Euler angles: .
Composing rotations around different axes yields a rotation around a third axis. The unitary matrices are isomorphic to the unit quaternions , which naturally represent 3D rotations via quaternion multiplication. This explains the double-cover relationship between and : two distinct quantum gates (differing by a global phase factor of ) represent the same Bloch sphere rotation.
Dagger
The dagger operator (†) computes the conjugate transpose of a gate's matrix. For unitary gates, , meaning the dagger is the inverse: applying undoes (). On the Bloch sphere, dagger reverses the direction of rotation: a rotation by angle becomes a rotation by angle . This explains why —two opposite rotations cancel.
Square root
Taking the square root of a gate produces a gate that, applied twice, yields the original. Examples: (T is the square root of S), (S is the square root of Z). On the Bloch sphere, square root halves the rotation angle: a gate rotating by yields a square root rotating by . This explains why square roots compose: applied twice returns to .
Matrix representations
Pauli gates:
Hadamard:
Clifford phase gates:
Non-Clifford phase gates:
Parametric rotation gates (angle ):
Note: T and T† are special cases (, ).
Clifford vs non-Clifford
Single-qubit gates partition into two classes:
Clifford gates (24 total) conjugate Pauli operators to Paulis: if is Clifford and is Pauli, then is also Pauli (up to global phase). Single-qubit Cliffords include: Pauli gates (I, X, Y, Z), Hadamard, S, and S†. Examples:
- ,
- ,
Clifford circuits are efficiently simulatable classically using the stabilizer tableau method in time; they cannot provide quantum advantage alone.
Non-Clifford gates (T, T†) break the Pauli closure property:
The result is a superposition of Paulis, not a Pauli itself. This breakdown is precisely what enables universal quantum computation and exponential speedup. However, non-Clifford gates require magic state distillation in fault-tolerant systems, making T-count the dominant cost metric.
Group structure
Single-qubit gates form the Lie group , the group of unitary matrices with determinant 1. This group is isomorphic to (compact symplectic group) and to (3D rotations), explaining why single-qubit gates correspond to Bloch sphere rotations.
The Clifford subgroup has exactly 24 elements. These are generated by Hadamard and S: . Any Clifford can be decomposed into H, S, and CNOT gates (when acting on multiple qubits).
The group is continuous and infinite-dimensional. Single-qubit rotations at arbitrary angles form a dense subset; any unitary can be approximated to desired accuracy using the Solovay-Kitaev theorem with gates.
Euler angle decomposition
Any single-qubit unitary can be expressed as a product of rotations around two perpendicular axes. The standard parametrization is:
where . Alternative decompositions exist (e.g., ) depending on axis ordering. The U gate implements this parametrization directly.
This decomposition proves that any single-qubit unitary requires at most three rotations. Combined with two-qubit gates (like CNOT), the Euler angles form a universal gate set.
Uses
- State preparation: Rotate computational basis states to arbitrary points on the Bloch sphere
- Circuit synthesis: Decompose arbitrary single-qubit unitaries into rotation sequences
- Variational algorithms: VQE and QAOA use parameterized rotation layers as ansatze
- Measurement basis rotation: Apply single-qubit gates before measurement to extract different observables (e.g., H before Z-basis measurement gives X-basis measurement)
- Quantum error correction: Pauli and Hadamard gates measure stabilizers in different bases without collapsing encoded information
- Basis switching: Prepare for operations in rotated bases (Hadamard for X basis, S for Y basis)
Implementation
Gate performance varies by platform:
Superconducting qubits:
- Pauli rotations (RX, RY): ~20–40 ns; achieved via microwave pulses
- RZ gates: typically virtual (reference frame adjustment), free cost
- Hadamard: ~20–50 ns; often decomposed as RZ + RX + RZ
- S, S† gates: virtual on most systems; no pulse needed
- T, T† gates: ~20–30 ns when implemented as RZ rotations; bottleneck is magic state distillation for fault tolerance, not gate time
- Fidelity: typically 99–99.9%
Trapped ions:
- Single-qubit gates: ~1–5 μs via laser pulses at multiple frequencies
- RZ gates: detuned pulse (leaves Rabi frequency small)
- Fidelity: 99.9%+ achievable
Photonic:
- Rotations via beam splitters and optical wave plates
- RZ via optical phase shifters
- Fidelity: ~99% (limited by optical component precision)
Relations
- Pauli gates: X, Y, Z are 180° Bloch rotations and Clifford gates
- Hadamard (H): basis rotation; single most important Clifford gate
- Phase gates: S, S†, T, T† are rotations around z-axis
- Rotation gates: , , parametrize Bloch rotations
- U gate: universal single-qubit; implements Euler angle decomposition
- Clifford gates: single-qubit Cliffords form 24-element subgroup of
- Non-Clifford gates: T and T† enable universality but require magic state distillation
- Two-qubit gates: single-qubit gates plus CNOT form universal gate set
- : group structure of single-qubit unitaries
- Bloch sphere: geometric interpretation of single-qubit operations
