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 22, 2026 at 18:55] – external edit 127.0.0.1 | quantum-gate-single-qubit [August 26, 2026 at 18:16] (current) – Ivan Janevski | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | # Single-Qubit Gates | + | # Single-qubit gates |
| - | **Single-qubit gates** act on one qubit, represented by $2 \times 2$ unitary matrices. They rotate | + | **Single-qubit gates** |
| - | ## Identity | + | A single-qubit |
| - | **[[quantum-gate-i|Identity]]** gate is the trivial gate that leaves the quantum state unchanged. It is the quantum analog of "do nothing" | + | All single-qubit gates correspond to rotations on the Bloch sphere; any unitary |
| - | $$I = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix}$$ | + | ## List of gates |
| - | ## Pauli X gate | + | - [[quantum-gate-pauli]] |
| + | - [[quantum-gate-i|Identity (I)]] | ||
| + | - [[quantum-gate-x|Pauli X (NOT)]] | ||
| + | - [[quantum-gate-y|Pauli Y]] | ||
| + | - [[quantum-gate-z|Pauli Z]] | ||
| + | - [[quantum-gate-h|Hadamard (H)]] | ||
| + | - [[quantum-gate-phase]] | ||
| + | - [[quantum-gate-s|S (phase) gate]] | ||
| + | - [[quantum-gate-s-dagger|S† (inverse phase gate)]] | ||
| + | - [[quantum-gate-t|T gate]] | ||
| + | - [[quantum-gate-t-dagger|T† gate (inverse T gate)]] | ||
| + | - [[quantum-gate-rotation]] | ||
| + | - [[quantum-gate-rx|Rx (rotation around X)]] | ||
| + | - [[quantum-gate-ry|Ry (rotation around Y)]] | ||
| + | - [[quantum-gate-rz|Rz (rotation around Z)]] | ||
| + | - [[quantum-gate-u|U (universal single-qubit)]] | ||
| - | **[[quantum-gate-x|Pauli X]]** gate flips the qubit: $|0\rangle \leftrightarrow |1\rangle$. It is the quantum analog of the classical NOT gate and is the most fundamental bit-flip operation. Self-inverse ($X^2 = I$). | + | ## Bloch sphere action |
| - | $$X = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}$$ | + | Single-qubit gates act as rotations on the Bloch sphere. [[quantum-gate-pauli|Pauli gates]] (X, Y, Z) are 180° rotations around their respective axes. The [[quantum-gate-h|Hadamard]] swaps the x and z axes. [[quantum-gate-phase|Phase gates]] (S, S†, T, T†) are rotations around the z-axis. [[quantum-gate-rotation|Rotation gates]] ($R_X$, $R_Y$, $R_Z$) parameterize arbitrary angles around each axis. [[quantum-gate-u|Universal gate]] specifies an arbitrary rotation via three Euler angles: $U(\phi, \theta, |
| - | ## Pauli Y gate | + | Composing rotations around different axes yields a rotation around a third axis. The $2 \times 2$ unitary matrices $\mathrm{SU}(2)$ are isomorphic to the unit quaternions $\mathrm{Sp}(1)$, |
| - | **[[quantum-gate-y|Pauli Y]]** gate combines a bit flip and phase, rotating around the y-axis of the Bloch sphere. Self-inverse ($Y^2 = I$), though less commonly used directly than X or Z. | + | ## Dagger |
| - | $$Y = \begin{pmatrix} 0 & -i \\ i & 0 \end{pmatrix}$$ | + | The dagger operator (†) computes the conjugate transpose of a gate's matrix. For unitary gates, |
| - | ## Pauli Z gate | + | ## Square root |
| - | **[[quantum-gate-z|Pauli Z]]** gate applies | + | Taking the square root of a gate produces |
| - | $$Z = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix}$$ | + | ## Matrix representations |
| - | ## Hadamard (H) gate | + | **Pauli gates:** |
| - | **[[quantum-gate-h|Hadamard]]** gate creates equal superposition from computational basis states. Essential for quantum algorithms; appears in nearly every quantum circuit. Self-inverse ($H^2 = I$), it maps $|0\rangle | + | $$I = \begin{pmatrix} 1 & 0 \\ 0 & 1 \end{pmatrix} |
| - | $$H = \frac{1}{\sqrt{2}} \begin{pmatrix} 1 & 1 \\ 1 & -1 \end{pmatrix}$$ | + | **Hadamard: |
| - | ## S (Phase) gate | + | $$H = \frac{1}{\sqrt{2}}\begin{pmatrix} 1 & 1 \\ 1 & -1 \end{pmatrix}$$ |
| - | **[[quantum-gate-s|S gate]]** applies a 90° phase to the $|1\rangle$ state—a quarter-turn phase gate with $S^2 = Z$ and $S^4 = I$. | + | **Clifford phase gates:** |
| - | $$S = \begin{pmatrix} 1 & 0 \\ 0 & i \end{pmatrix}$$ | + | $$S = \begin{pmatrix} 1 & 0 \\ 0 & i \end{pmatrix} \quad S^\dagger = \begin{pmatrix} 1 & 0 \\ 0 & -i \end{pmatrix}$$ |
| - | ## T gate | + | **Non-Clifford phase gates:** |
| - | **[[quantum-gate-t|T gate]]** applies a 45° phase to the $|1\rangle$ state. Critical for quantum algorithms and fault-tolerant quantum computing, it is often called the "magic gate" in quantum error correction ($T^2 = S$, $T^8 = I$). | + | $$T = \begin{pmatrix} 1 & 0 \\ 0 & e^{i\pi/4} \end{pmatrix} \quad T^\dagger |
| - | $$T = \begin{pmatrix} 1 & 0 \\ 0 & e^{i\pi/4} \end{pmatrix}$$ | + | **Parametric rotation gates (angle |
| - | ## RX (Rotation around X) gate | + | $$R_X(\theta) = \begin{pmatrix} \cos(\theta/ |
| - | **[[quantum-gate-rx|RX gate]]** is a parameterized rotation around the x-axis of the Bloch sphere by angle $\theta$; $R_X(\pi/2)$ is a half-rotation. | + | Note: T and T† are special cases ($T = R_Z(\pi/4)$, $T^\dagger = R_Z(-\pi/4)$). |
| - | $$R_X(\theta) = \begin{pmatrix} \cos(\theta/ | + | ## Clifford vs non-Clifford |
| - | ## RY (Rotation around Y) gate | + | Single-qubit gates partition into two classes: |
| - | **[[quantum-gate-ry|RY gate]]** is a parameterized rotation around the y-axis of the Bloch sphere by angle $\theta$; $R_Y(\pi/2)$ creates superposition. | + | **Clifford gates** (24 total) conjugate |
| - | $$R_Y(\theta) | + | - $H X H = Z$, $H Z H = X$ |
| + | - $S X S^\dagger = Y$, $S Z S^\dagger = Z$ | ||
| - | ## RZ (Rotation around Z) gate | + | Clifford circuits are efficiently simulatable classically using the stabilizer tableau method in $O(n^3)$ time; they cannot provide quantum advantage alone. |
| - | **[[quantum-gate-rz|RZ gate]]** is a parameterized rotation around the z-axis | + | **Non-Clifford gates** (T, T†) break the Pauli closure property: |
| - | $$R_Z(\theta) | + | $$T X T^\dagger |
| - | ## Universal Single-Qubit (U) gate | + | 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. |
| - | **[[quantum-gate-u|Universal U gate]]** | + | ## Group structure |
| + | |||
| + | Single-qubit gates form the Lie group $\mathrm{SU}(2)$, | ||
| + | |||
| + | The Clifford subgroup $\mathcal{C}_1$ has exactly 24 elements. These are generated | ||
| + | |||
| + | The group $\mathrm{SU}(2)$ is continuous and infinite-dimensional. Single-qubit rotations at arbitrary | ||
| + | |||
| + | ## 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, \lambda) = R_Z(\phi) R_Y(\theta) R_Z(\lambda)$$ | ||
| + | |||
| + | where $\phi, \theta, \lambda \in [0, 2\pi)$. Alternative decompositions exist (e.g., $R_X R_Y R_Z$) depending on axis ordering. The [[quantum-gate-u|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 | ||
| + | |||
| + | ## Uses | ||
| + | |||
| + | - **State preparation**: | ||
| + | - **Circuit synthesis**: | ||
| + | - **Variational algorithms**: | ||
| + | - **Measurement basis rotation**: Apply single-qubit gates before 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 | ||
| + | |||
| + | **Photonic**: | ||
| + | - Rotations via beam splitters and optical wave plates | ||
| + | - RZ via optical phase shifters | ||
| + | - Fidelity: ~99% (limited by optical component precision) | ||
| + | |||
| + | ## Relations | ||
| + | |||
| + | - [[quantum-gate-pauli|Pauli gates]]: | ||
| + | - [[quantum-gate-h|Hadamard (H)]]: basis rotation; single most important Clifford gate | ||
| + | - [[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 | ||
| - | $$U(\theta, \phi, \lambda) = \begin{pmatrix} \cos(\theta/ | ||
quantum-gate-single-qubit.1787424919.md.gz · Last modified: by 127.0.0.1
