- Fundamentals
- Also: Rx, Ry, Rz gates
- Also: parameterized rotations
Rotation Gates
Parameterized single-qubit gates that rotate the qubit state by a specified angle around the X, Y, or Z axis of the Bloch sphere.
Rotation gates are parameterized single-qubit gates that rotate the quantum state by an angle around a specified axis of the Bloch sphere. The three standard rotation gates, , , and , correspond to rotations around the , , and axes respectively. Together, they can express any single-qubit unitary operation, making them the building blocks of universal single-qubit control.
Definitions
The rotation gates are defined as matrix exponentials of the Pauli operators:
Each gate satisfies (identity), (global phase of ), and (full period, reflecting the spin-1/2 nature of qubits).
Relationship to common gates
Many standard gates are special cases of rotation gates:
| Gate | Equivalent rotation (up to global phase) |
|---|---|
| Pauli | |
| Pauli | |
| Pauli | |
| Hadamard | |
| gate | |
| T gate | |
Euler decomposition
Any single-qubit unitary (up to global phase) can be decomposed into three rotation gates:
This is the ZYZ Euler decomposition. Alternative decompositions using other axis orderings (XYX, ZXZ, etc.) are equally valid. This universality means that any native gate set containing rotations around two non-parallel axes can produce arbitrary single-qubit gates.
In practice, hardware platforms implement as a virtual gate (a software frame change with zero duration and zero error), while and require physical microwave pulses. This makes the ZXZ decomposition preferable on platforms like IBM’s, where is free:
Role in variational algorithms
Rotation gates are the parameterized components of variational quantum circuits used in VQE and QAOA. A typical variational ansatz consists of layers of rotation gates with trainable angles interspersed with entangling gates:
from qiskit import QuantumCircuit
qc = QuantumCircuit(3)
for i in range(3):
qc.ry(theta[i], i) # Parameterized rotation layer
qc.cx(0, 1) # Entangling layer
qc.cx(1, 2)
for i in range(3):
qc.ry(theta[i + 3], i) # Second rotation layer
Gradients of the circuit output with respect to rotation angles can be computed exactly using the parameter shift rule:
This formula is exact (not a finite-difference approximation) because rotation gates generate a specific algebraic structure.
Why it matters for learners
Rotation gates are the most commonly used parameterized gates and appear in virtually every quantum algorithm. Understanding their matrix forms, Bloch sphere interpretation, and relationship to Pauli operators provides the foundation for circuit design, transpilation, and variational algorithm construction.