| quantum circuit model | |
|---|---|
| Name | Quantum circuit model |
| Caption | Schematic of a quantum circuit with gates and qubits |
| Field | Quantum physics |
| Introduced | 1980s |
| Developers | David Deutsch, Peter Shor, Richard P. Feynman, Charles H. Bennett |
| Notable institutions | IBM, Google, University of Oxford, Massachusetts Institute of Technology, Stanford University, California Institute of Technology |
| Examples | Shor's algorithm, Grover's algorithm |
quantum circuit model
The quantum circuit model is a theoretical framework for describing quantum computation in which computation is expressed as a sequence of quantum gates acting on qubits, followed by measurements. It provides an analogue of classical circuit descriptions such as Boolean circuits, enabling formal analysis of algorithms, complexity, and realizations on physical hardware. The model emerged in the 1980s from work by Paul Benioff, Benioff and especially David Deutsch, and it was popularized through contributions by Richard Feynman and later by algorithmic breakthroughs such as Shor's factoring algorithm and Grover's search algorithm. The model is central to modern efforts in quantum information science at institutions like IBM, Google, and academic groups at MIT and University of Oxford.
In the quantum circuit model, the basic unit of information is the qubit, represented by a vector in a two-dimensional complex Hilbert space. State evolution is unitary and described by operators in the group U(2^n) for n qubits. Standard components include single-qubit rotations (e.g., Pauli X, Y, Z and phase gates), two-qubit entangling gates such as the CNOT and CZ, and multiqubit gates like the Toffoli gate when needed. Circuits begin with preparation of input states (often computational-basis states), proceed through layers of gates, and terminate with projective quantum measurement in specified bases. The circuit formalism naturally represents concepts such as entanglement, superposition, and quantum interference. Theoretical descriptions draw on linear algebra, operator theory, and the postulates of quantum mechanics as developed in texts like Nielsen & Chuang.
A gate set is universal if any unitary operation can be approximated to arbitrary accuracy by a finite sequence from the set. Notable universal sets include the set of all single-qubit gates together with CNOT, and finite discrete sets such as the Clifford+T gate set. The Solovay–Kitaev theorem provides efficient synthesis for dense gate sets, while specialized compilation techniques target resource metrics like gate count and circuit depth. Synthesis and optimization tools are developed by groups at IBM Research, Google Quantum AI, and open-source projects such as Qiskit and Cirq to compile high-level algorithms (e.g., Shor's algorithm, Quantum Fourier transform) into device-specific sequences. Resource estimates for algorithms often count T-gate counts, CNOT counts, and qubit overhead.
The quantum circuit model defines classes such as BQP (bounded-error quantum polynomial time) and serves as the primary formalism for proving complexity-theoretic relations among P, NP, and other classes. Equivalence results show that circuit-based quantum computation is polynomially equivalent to models like the quantum Turing machine proposed by Deutsch and to measurement-based models such as measurement-based quantum computation (MBQC) under efficient reductions. Complexity-theoretic results, including oracle separations and hardness of simulating certain quantum circuits (e.g., those related to BosonSampling), guide expectations about classical simulability and quantum advantage. Works by researchers at Microsoft Research and universities contribute to formal analyses of circuit depth, width, and trade-offs.
Real quantum circuits are affected by decoherence and gate errors modeled as noisy quantum channels, described by completely positive trace-preserving maps. Quantum error correction (QEC) codes such as the Shor code, Steane code, and surface code protect logical qubits using redundancy and syndrome measurements. Fault-tolerant constructions embed logical gates into circuits while controlling error propagation; threshold theorems guarantee scalable computation if physical error rates fall below a threshold. Leading experimental platforms implement QEC demonstrations at institutions including IBM, Google, and Honeywell/Quantinuum. Techniques such as dynamical decoupling, error mitigation, and quantum tomography are used for characterization and improvement of circuit performance.
Physical realizations of the quantum circuit model map abstract gates to hardware primitives. Implementations include superconducting qubits (transmon devices) pioneered by groups at Yale University and commercialized by IBM and Google, trapped-ion systems developed at University of Innsbruck and companies like IonQ and Honeywell, photonic approaches used by Xanadu and in BosonSampling experiments, and semiconductor spin qubits pursued at Google and Intel. Architectures vary by connectivity graph, native gate set, coherence times, and scaling strategies; architectures often target modularity, cryogenic control, and error-corrected logical qubit layouts like the surface code lattice.
Quantum circuits implement a range of algorithms across domains: number-theoretic algorithms (Shor's algorithm) for factoring and cryptanalysis; search and unstructured problems (Grover's algorithm); quantum simulation of many-body systems (as envisioned by Richard Feynman and developed in algorithms by Seth Lloyd); algorithms for linear algebra such as the HHL; and quantum machine learning proposals. Near-term applications focus on variational quantum algorithms like VQE (variational quantum eigensolver) and QAOA (quantum approximate optimization algorithm), which compile parametrized circuits to approximate ground states or combinatorial optima. Benchmarks such as randomized benchmarking and cross-entropy benchmarking quantify circuit performance in experimental demonstrations of quantum advantage.
Category:Quantum computing models