| quantum gate | |
|---|---|
| Name | Quantum gate |
| Type | Quantum logic operation |
| Invented | 1980s |
| Inventor | Benioff, Feynman (conceptual), Deutsch (formalization) |
| Field | Quantum computing, quantum information |
quantum gate
A quantum gate is a basic quantum circuit operation that performs a deterministic unitary transformation on the state of one or more qubits. Quantum gates are the building blocks of quantum algorithms and quantum circuits, enabling phenomena such as superposition, entanglement, and interference that give rise to potential computational advantages over classical classical gates. They are central to research in Quantum Physics, Quantum computing, and experimental platforms such as superconducting qubit, trapped ion and photonic systems.
In formal terms a quantum gate corresponds to a linear, reversible operator acting on a finite-dimensional Hilbert space associated with a register of qubits or higher-dimensional qudits. Unlike irreversible classical gates like NAND, quantum gates must be unitary (or, in the presence of measurement, represented by completely positive trace-preserving maps), preserving the overall probability amplitude. The notion of a quantum gate emerged from foundational work by Paul Benioff, Richard Feynman, and David Deutsch, and it underpins practical frameworks such as the quantum circuit model and the Quantum Turing machine.
Quantum gates are represented mathematically by unitary matrices U acting on the tensor-product Hilbert space of n qubits, typically (C^2)^{\otimes n}. Single-qubit gates correspond to 2×2 unitaries and can be visualized as rotations on the Bloch sphere. Common parametrizations use the Pauli matrices σ_x, σ_y, σ_z and the special unitary group SU(2). Multi-qubit gates use larger matrices built from tensor products and controlled operations; for example, a controlled gate is often written using projectors and tensor factors. Quantum operations that are not strictly unitary (e.g., due to quantum measurement or decoherence) are modeled by quantum channels and completely positive trace-preserving (CPTP) maps, with dynamics described by the Lindblad equation in open-system settings.
Standard single-qubit gates include the Hadamard H, Pauli X, Y, Z, the phase gate S, and the T gate (π/8 phase). Multi-qubit primitives include the controlled-NOT (CNOT), controlled-Z (CZ), Toffoli (controlled-controlled-NOT), and SWAP. Many algorithms employ composite gates: for example, the QFT uses sequences of controlled phase rotations. Quantum programming toolkits and languages such as Qiskit, Cirq, and Quipper expose gate sets and abstractions for compiling high-level algorithms into these gate primitives.
Quantum gates are realized in diverse hardware systems. Superconducting circuits developed at institutions such as IBM, Google Quantum AI, and Rigetti Computing implement microwave-driven single- and two-qubit gates with tunable couplers. Trapped ion systems from groups like IonQ and laboratories at Innsbruck and UMD use laser-driven stimulated Raman transitions to enact gates such as the Mølmer–Sørensen gate. Photonic quantum computing platforms use linear optics, beam splitters, and nonlinear optics for measurement-based and linear-optical gates in projects like Xanadu. Other platforms include spin qubits in silicon and NV center implementations. Each platform faces trade-offs in gate fidelity, speed, connectivity, and scalability.
A gate set is universal if arbitrary unitary operations can be approximated to arbitrary precision using finite sequences from the set. The Solovay–Kitaev theorem guarantees efficient approximation when a discrete gate set densely generates SU(2^n). Common universal sets include {H, T, CNOT} and continuous analogues using arbitrary rotations plus an entangling two-qubit gate. Practical quantum compilation decomposes high-level unitaries (e.g., from Shor's algorithm or Grover's algorithm) into native gates using techniques such as Quantum Shannon decomposition, KAK decomposition for two-qubit unitaries, and optimal synthesis algorithms. Compilers must consider hardware constraints like qubit connectivity and native gate fidelities; mapping and routing routines insert SWAP gates to satisfy physical layouts often employed in devices by IBM Quantum or Google Sycamore.
Real-world quantum gates are imperfect, characterized by gate errors, decoherence channels, and crosstalk. Noise models include depolarizing, dephasing, amplitude damping, and coherent control errors; these are quantified by process fidelity, diamond norm, and randomized benchmarking protocols such as randomized benchmarking and interleaved benchmarking. Fault-tolerant quantum computing uses quantum error correction codes—like the surface code and Steane code—and fault-tolerant gate constructions (e.g., magic state injection for T gates) to suppress logical error rates below thresholds. Threshold theorems establish conditions under which scalable quantum computation is possible given gate error rates below a critical value. Active research aims to improve native gate fidelities and reduce resource overhead for error correction in platforms led by academic groups and companies such as Microsoft Quantum and Honeywell Quantum Solutions.
Category:Quantum computing Category:Quantum gates