quantum-gate-single-qubit
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| quantum-gate-single-qubit [August 26, 2026 at 15:08] – Ivan Janevski | quantum-gate-single-qubit [August 26, 2026 at 18:16] (current) – Ivan Janevski | ||
|---|---|---|---|
| Line 3: | Line 3: | ||
| **Single-qubit gates** are unitary operations that act on one qubit. They are represented by $2 \times 2$ unitary matrices and form the Lie group $\mathrm{SU}(2)$. 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. | **Single-qubit gates** are unitary operations that act on one qubit. They are represented by $2 \times 2$ unitary matrices and form the Lie group $\mathrm{SU}(2)$. 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 $|\psi\rangle$ to produce a new state $U|\psi\rangle$. 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 ($S^4 = I$, $T^8 = I$); some are parameterized (RX, RY, RZ with rotation angle $\theta$). | + | A single-qubit gate is applied to a state $|\psi\rangle$ to produce a new state $U|\psi\rangle$. 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 ($S^4 = I$, $T^8 = I$); some are parameterized (RX, RY, RZ with rotation angle $\theta$). |
| + | All single-qubit gates correspond to rotations on the Bloch sphere; any unitary in $\mathrm{SU}(2)$ can be decomposed as a product of rotations around two perpendicular axes. | ||
| ## List of gates | ## List of gates | ||
| - | - [[quantum-gate-i|Identity (I)]] | + | - [[quantum-gate-pauli]] |
| - | - [[quantum-gate-x|Pauli X (NOT)]] | + | |
| - | - [[quantum-gate-y|Pauli Y]] | + | - [[quantum-gate-x|Pauli X (NOT)]] |
| - | - [[quantum-gate-z|Pauli Z]] | + | - [[quantum-gate-y|Pauli Y]] |
| - | - [[quantum-gate-h|Hadamard (H)]] | + | - [[quantum-gate-z|Pauli Z]] |
| - | - [[quantum-gate-s|S (Phase) gate]] | + | - [[quantum-gate-h|Hadamard (H)]] |
| - | - [[quantum-gate-t|T gate]] | + | - [[quantum-gate-phase]] |
| - | - [[quantum-gate-rx|RX (rotation around X)]] | + | |
| - | - [[quantum-gate-ry|RY (rotation around Y)]] | + | - [[quantum-gate-s-dagger|S† (inverse phase gate)]] |
| - | - [[quantum-gate-rz|RZ (rotation around Z)]] | + | |
| - | - [[quantum-gate-u|Universal | + | - [[quantum-gate-t-dagger|T† gate (inverse T gate)]] |
| + | - [[quantum-gate-rotation]] | ||
| + | | ||
| + | - [[quantum-gate-ry|Ry (rotation around Y)]] | ||
| + | - [[quantum-gate-rz|Rz (rotation around Z)]] | ||
| + | - [[quantum-gate-u|U (universal | ||
| ## Bloch sphere action | ## Bloch sphere action | ||
| - | Single-qubit gates act as rotations on the Bloch sphere. | + | Single-qubit gates act as rotations on the Bloch sphere. |
| + | |||
| + | Composing rotations around different | ||
| + | |||
| + | ## Dagger | ||
| + | |||
| + | The dagger operator (†) computes the conjugate transpose of a gate's matrix. For unitary gates, $U^\dagger = U^{-1}$, meaning the dagger is the inverse: applying $U^\dagger$ undoes $U$ ($U^\dagger U = I$). On the Bloch sphere, dagger reverses the direction of rotation: a rotation | ||
| + | |||
| + | ## Square root | ||
| + | |||
| + | Taking the square root of a gate produces a gate that, applied twice, yields the original. Examples: $T^2 = S$ (T is the square root of S), $S^2 = Z$ (S is the square root of Z). On the Bloch sphere, square root halves the rotation angle: a gate rotating by $\theta$ yields a square root rotating by $\theta/2$. This explains why square roots compose: $\sqrt{U}$ applied twice returns to $U$. | ||
| + | |||
| + | ## Matrix representations | ||
| + | |||
| + | **Pauli gates:** | ||
| + | |||
| + | $$I = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} \quad X = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix} \quad Y = \begin{pmatrix} 0 & -i \\ i & 0 \end{pmatrix} \quad Z = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix}$$ | ||
| + | |||
| + | **Hadamard: | ||
| + | |||
| + | $$H = \frac{1}{\sqrt{2}}\begin{pmatrix} 1 & 1 \\ 1 & -1 \end{pmatrix}$$ | ||
| + | |||
| + | **Clifford phase gates:** | ||
| + | |||
| + | $$S = \begin{pmatrix} 1 & 0 \\ 0 & i \end{pmatrix} \quad S^\dagger = \begin{pmatrix} 1 & 0 \\ 0 & -i \end{pmatrix}$$ | ||
| + | |||
| + | **Non-Clifford phase gates:** | ||
| + | |||
| + | $$T = \begin{pmatrix} 1 & 0 \\ 0 & e^{i\pi/4} \end{pmatrix} \quad T^\dagger = \begin{pmatrix} 1 & 0 \\ 0 & e^{-i\pi/4} \end{pmatrix}$$ | ||
| + | |||
| + | **Parametric rotation gates (angle $\theta$): | ||
| + | |||
| + | $$R_X(\theta) = \begin{pmatrix} \cos(\theta/ | ||
| + | |||
| + | Note: T and T† are special cases ($T = R_Z(\pi/ | ||
| + | |||
| + | ## Clifford vs non-Clifford | ||
| + | |||
| + | Single-qubit gates partition into two classes: | ||
| + | |||
| + | **Clifford gates** (24 total) conjugate [[quantum-gate-pauli|Pauli operators]] to Paulis: if $C$ is Clifford and $P$ is Pauli, then $C P C^\dagger$ is also Pauli (up to global phase). Single-qubit Cliffords include: Pauli gates (I, X, Y, Z), Hadamard, S, and S†. Examples: | ||
| + | |||
| + | - $H X H = Z$, $H Z H = X$ | ||
| + | - $S X S^\dagger = Y$, $S Z S^\dagger = Z$ | ||
| + | |||
| + | Clifford circuits are efficiently simulatable classically using the stabilizer tableau method in $O(n^3)$ time; they cannot provide quantum advantage alone. | ||
| + | |||
| + | **Non-Clifford gates** (T, T†) break the Pauli closure property: | ||
| + | |||
| + | $$T X T^\dagger = \frac{1}{\sqrt{2}}(X + Y), \quad T Z T^\dagger = Z$$ | ||
| + | |||
| + | 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 [[quantum-gate-stabilizer-formalism|magic state distillation]] in fault-tolerant systems, making T-count the dominant cost metric. | ||
| + | |||
| + | ## Group structure | ||
| + | |||
| + | Single-qubit gates form the Lie group $\mathrm{SU}(2)$, the group of $2 \times 2$ unitary matrices with determinant 1. This group is isomorphic to $\mathrm{Sp}(1)$ (compact symplectic group) and to $\mathrm{SO}(3)$ | ||
| + | |||
| + | The Clifford subgroup $\mathcal{C}_1$ has exactly 24 elements. These are generated by Hadamard and S: $(HS)^3 = I$. Any Clifford can be decomposed into H, S, and CNOT gates (when acting on multiple qubits). | ||
| + | |||
| + | The group $\mathrm{SU}(2)$ is continuous and infinite-dimensional. Single-qubit | ||
| + | |||
| + | ## Euler angle decomposition | ||
| + | |||
| + | Any single-qubit unitary can be expressed as a product of rotations around two perpendicular axes. The standard parametrization is: | ||
| + | |||
| + | $$U(\phi, \theta, | ||
| + | |||
| + | where $\phi, \theta, \lambda | ||
| + | |||
| + | 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**: | ||
| + | - **Circuit synthesis**: | ||
| + | - **Variational algorithms**: | ||
| + | - **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**: | ||
| + | - **Basis switching**: | ||
| + | |||
| + | ## 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), | ||
| + | - 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 | ||
| - | ## Clifford gates | + | **Photonic**: |
| + | - Rotations via beam splitters and optical wave plates | ||
| + | - RZ via optical phase shifters | ||
| + | - Fidelity: ~99% (limited by optical component precision) | ||
| - | **Clifford gates** conjugate Paulis to Paulis: $C P C^\dagger$ is Pauli if $C$ is Clifford and $P$ is Pauli. This closure means Clifford circuits simulate classically in polynomial time (stabilizer formalism) — no quantum advantage. Pauli X, Y, Z, Hadamard, and S gates are Clifford. | + | ## Relations |
| - | **Non-Clifford gates** (T gate) break Pauli closure | + | - [[quantum-gate-pauli|Pauli gates]]: X, Y, Z are 180° Bloch rotations and Clifford gates |
| + | - [[quantum-gate-h|Hadamard | ||
| + | - [[quantum-gate-phase|Phase gates]]: S, S†, T, T† are rotations around z-axis | ||
| + | - [[quantum-gate-rotation|Rotation gates]]: $R_X$, $R_Y$, $R_Z$ parametrize Bloch rotations | ||
| + | - [[quantum-gate-u|U gate]]: universal single-qubit; | ||
| + | - [[quantum-gate-clifford|Clifford gates]]: single-qubit Cliffords form 24-element subgroup of $\mathrm{SU}(2)$ | ||
| + | - [[quantum-gate-non-clifford|Non-Clifford gates]]: T and T† enable universality but require magic state distillation | ||
| + | - [[quantum-gate-two-qubit|Two-qubit gates]]: single-qubit gates plus CNOT form universal gate set | ||
| + | - $\mathrm{SU}(2)$: | ||
| + | - Bloch sphere: geometric interpretation of single-qubit operations | ||
quantum-gate-single-qubit.1787756917.md.gz · Last modified: by Ivan Janevski
