Hadamard Gate (H) | Matrix, Superposition & Circuit Telemetry
Quick Technical Answer:
The Hadamard gate (H) is a fundamental single-qubit quantum gate that maps the computational basis states |0⟩ and |1⟩ into equal superposition states (|0⟩ + |1⟩)/√2 and (|0⟩ - |1⟩)/√2, rotating the state vector by π radians around the (X+Z)/√2 axis on the Bloch sphere.
Formula / Unitary:
H = \frac{1}{\sqrt{2}} \begin{pmatrix} 1 & 1 \\ 1 & -1 \end{pmatrix}, \quad H|0\rangle = |+\rangle, \quad H|1\rangle = |-\rangle
Simulate this in Itachi Quantum Studio
Inspect state amplitudes, 3D Bloch sphere vector, and OpenQASM code live.
Unitary Matrix & Mathematical Definition
The Hadamard transformation is a self-inverse unitary operator (H = H† = H⁻¹) that satisfies H² = I. In the Pauli basis, the Hadamard gate decomposes as H = (X + Z)/√2. It transforms the Pauli Z eigenstates into Pauli X eigenstates, making it the primary mechanism for generating coherent quantum interference.
Bloch Sphere State Telemetry
On the Bloch sphere, the Hadamard gate corresponds to a 180-degree (π radian) rotation about the diagonal axis located midway between the +X and +Z axes (θ = π/4, φ = 0). Applying H to the North Pole |0⟩ rotates the Bloch vector to the equator (+X axis), producing the |+⟩ state with equal 50% Born rule measurement probabilities.
OpenQASM 3.0 & Qiskit Implementation
```qasm
// OpenQASM 3.0 Hadamard Demonstration
OPENQASM 3.0;
qubit q;
bit c;
h q;
c = measure q;
```
```python
# Qiskit 1.0 Python Code
from qiskit import QuantumCircuit
qc = QuantumCircuit(1, 1)
qc.h(0)
qc.measure(0, 0)
```
Hadamard Gate Transformation Truth Table
| Input State | Output State (Ket) | Probability |0⟩ | Probability |1⟩ | Bloch (x, y, z) |
|---|---|---|---|---|
| |0⟩ | (|0⟩ + |1⟩) / √2 | 50% | 50% | (1, 0, 0) |
| |1⟩ | (|0⟩ - |1⟩) / √2 | 50% | 50% | (-1, 0, 0) |
| |+⟩ | |0⟩ | 100% | 0% | (0, 0, 1) |
| |-⟩ | |1⟩ | 0% | 100% | (0, 0, -1) |
Frequently Asked Questions
What is the physical effect of a Hadamard gate?
The Hadamard gate creates quantum superposition. It converts definite classical states (0 or 1) into an equal linear combination of both states simultaneously with a relative phase of 0 or π.
Is the Hadamard gate reversible?
Yes, the Hadamard gate is its own hermitian conjugate (H = H†). Applying two consecutive Hadamard gates returns the qubit to its original state (H · H = I).
Why is the Hadamard gate essential for quantum algorithms?
Nearly all quantum algorithms—including Shor's, Grover's, and Deutsch-Jozsa—initialize their computational registers by applying Hadamard gates to all qubits to evaluate 2^N states simultaneously.