Quantum Circuit

A quantum circuit is the standard model of quantum computation, representing a quantum algorithm as a sequence of quantum gates applied to a register of qubits. Unlike the quantum Turing machine, which generalizes the classical tape-based model, the quantum circuit model generalizes the classical logic circuit: it is a network of unitary operations that transform an initial quantum state into a final state, which is then measured to extract classical information.

The quantum circuit model was developed by David Deutsch, Richard Feynman, and others in the 1980s, and was placed on firm theoretical ground by the work of Bernstein and Vazirani (1993) and Yao (1993). It is the practical foundation of all current quantum computing hardware, from superconducting qubits to trapped ions to photonic systems. The model defines the complexity class BQP and underwrites the Church-Turing-Deutsch principle by providing the concrete computational framework within which "universal quantum computation" is realized.

A key theorem, the Solovay-Kitaev theorem, establishes that any quantum circuit can be approximated to arbitrary accuracy using a finite set of universal quantum gates. This means that quantum computation, like classical computation, has a universal gate set — a small collection of operations from which all others can be constructed. The practical challenge is not theoretical universality but physical fidelity: quantum gates are noisy, and achieving the error rates required for quantum error correction remains the central engineering problem of the field.