
A basic operation in quantum computing that manipulates qubits to perform calculations.A quantum gate is the fundamental building block of a quantum computer, analogous to a logic gate in a classical computer. It performs a specific, reversible operation on one or more qubits — the quantum bits of information — transforming their quantum state. While classical gates manipulate bits (0 or 1), quantum gates exploit superposition and entanglement to process information in ways that can solve certain problems exponentially faster.
The concept of quantum gates was formalized in the 1980s and 1990s, with key contributions from David Deutsch (1985) who described universal quantum logic gates, and later Peter Shor (1994) whose factoring algorithm demonstrated their power. The first physical demonstrations came in the late 1990s using ion traps and NMR.
Quantum gates are implemented by applying precisely controlled physical pulses — such as microwave or laser bursts — to qubits. These pulses change the qubit's state, for example, flipping it from 0 to 1, creating a superposition of both, or entangling it with another qubit. The operations are described by unitary matrices, which ensure the process is reversible and preserves quantum information. A sequence of gates forms a quantum circuit, the quantum equivalent of a program.
Quantum gates are used in all quantum computing platforms — superconducting circuits, trapped ions, photonics — to run algorithms for cryptography, drug discovery, materials science, and optimization problems.
A single quantum gate can put a qubit into a superposition of 0 and 1 simultaneously, meaning one operation can process both values at once — a feat impossible for any classical gate.








