| Hadamard gate | |
|---|---|
| Name | Hadamard gate |
| Type | Single-qubit quantum gate |
| Matrix | \(\frac{1}{\sqrt{2 |
Hadamard gate
\begin{pmatrix}1 & 1\\ 1 & -1\end{pmatrix}\) | introduced = 1928 (Hadamard matrix basis); adopted in quantum computing | related = Pauli gates, Quantum Fourier transform, Deutsch–Jozsa algorithm }}
The Hadamard gate (commonly denoted H) is a single-qubit quantum gate that effects a specific unitary transformation mapping computational basis states to equal superpositions. It is fundamental in Quantum computing and Quantum information for creating and manipulating coherence and interference, and appears as a primitive in many quantum algorithms and error-correcting codes.
The Hadamard gate is defined by the 2×2 unitary matrix equal to the normalized Hadamard matrix of order two: \(\displaystyle H=\frac{1}{\sqrt{2}}\begin{pmatrix}1 & 1\\[4pt] 1 & -1\end{pmatrix}.\) In the computational basis \(|0\rangle,|1\rangle\) (standard basis of a qubit), H acts linearly and preserves inner products, making it an element of the unitary group U(2). The matrix can be expressed in terms of Pauli operators as \(H=\frac{1}{\sqrt{2}}(X+Z)\), where X and Z are the Pauli X, Pauli Z operators. The gate is Hermitian and unitary, satisfying \(H=H^\dagger=H^{-1}\).
Applied to computational basis states, the Hadamard produces balanced superpositions: \(H|0\rangle=\frac{|0\rangle+|1\rangle}{\sqrt{2}},\quad H|1\rangle=\frac{|0\rangle-|1\rangle}{\sqrt{2}}.\) On an arbitrary qubit \(\alpha|0\rangle+\beta|1\rangle\), H performs a discrete change of basis equivalent to a reflection about the axis bisecting X and Z on the Bloch sphere. Two consecutive Hadamard gates implement the identity: \(H^2=I\). The gate interchanges the computational (Z) basis and the X eigenbasis, enabling preparation and measurement in the X basis when combined with quantum measurement.
The Hadamard gate satisfies several useful algebraic relations. It conjugates Pauli operators as \(H X H = Z,\quad H Z H = X,\) thus implementing a basis change between X and Z eigenspaces. Combined with CNOT and phase gates, H generates large subgroups of the Clifford group, which is central to stabilizer codes and quantum error correction. H is its own inverse and Hermitian, and commutes with certain symmetries up to phase. The gate can be decomposed into rotations on the Bloch sphere: \(H = e^{i\phi} R_y(\pi/2) R_z(\pi)\) up to a global phase, linking H to rotation operators used in experimental implementations.
The Hadamard gate is ubiquitous in quantum algorithms. It is used to create initial uniform superpositions in algorithms like the Deutsch–Jozsa algorithm, Grover's algorithm, and Shor's algorithm (as subroutines in state preparation and the Quantum Fourier transform). In the Hadamard test it enables estimation of real and imaginary parts of expectation values for use in quantum phase estimation and variational procedures such as the VQE. In circuit synthesis, H combined with T gate and CNOT forms a universal gate set for quantum computation under the Solovay–Kitaev theorem. In fault-tolerant architectures such as surface code implementations, logical Hadamard operations are implemented via lattice transformations or transversal gates.
Experimentally, Hadamard operations are realized across many physical platforms. In superconducting qubits they are implemented by microwave-driven rotations combining X and Z control; in trapped ion systems by laser-induced stimulated Raman transitions; in photonic quantum computing by beam splitters and phase shifters implementing a 50:50 interference; and in spin qubits by magnetic resonance pulses. Specific systems and programs that demonstrate Hadamard usage include devices from IBM Quantum, Google Quantum AI, and experiments at institutions such as MIT, University of Oxford, and Max Planck Institute for Quantum Optics. Noise, calibration and cross-talk affect the fidelity of H gates; performance is characterized by metrics like randomized benchmarking, gate fidelity, and coherence times (T1, T2).
The Hadamard gate is a primitive instance of the Quantum Fourier transform (QFT) on a single qubit: the single-qubit QFT equals H up to global phase. In multi-qubit QFT circuits, H gates act on individual qubits before controlled phase rotations to build the discrete Fourier transform over the computational basis, which underlies algorithms by Peter Shor and others. Decompositions relate H to elementary rotation operators \(R_x\), \(R_y\), and \(R_z\); these decompositions are used in compiling high-level algorithms into native gates on hardware. Because of its role as a change-of-basis between X and Z, H is central to protocols leveraging interference, such as amplitude amplification, phase estimation, and tomography.
Category:Quantum gates Category:Quantum computing