| quantum circuit | |
|---|---|
| Name | Quantum circuit |
| Caption | Schematic of a small quantum circuit with qubit wires and quantum gates |
| Type | Computational model |
| Invented | 1980s |
| Inventors | Paul Benioff, Richard Feynman, David Deutsch |
| Related | quantum computing, quantum gate, Qiskit, Quantum error correction |
quantum circuit
A quantum circuit is a model for quantum computing in which computation is expressed as a sequence of quantum gate operations on quantum bits (qubits). It provides a concrete bridge between theoretical Quantum Physics — including quantum mechanics and unitary evolution — and practical implementations of algorithms such as Shor's algorithm and Grover's algorithm. Quantum circuits matter because they make abstract quantum phenomena programmable and testable on platforms ranging from superconducting qubit processors to trapped ion systems.
Quantum circuits formalize computation using the same mathematics that underpins quantum theory: state vectors in a Hilbert space, unitary matrices, and projective measurement. The model was developed following foundational proposals by Paul Benioff, Richard Feynman, and David Deutsch and is compatible with the quantum circuit model of computation. Circuits represent physical operations (preparation, coherent evolution, and measurement) that must obey conservation of probability and linearity from quantum mechanics. They also serve as the primary language for describing experiments at institutions such as IBM Quantum, Google Quantum AI, Rigetti, and academic groups at MIT, University of Oxford, and Caltech.
A qubit is the fundamental carrier of quantum information, realized physically as a two-level system such as a spin-1/2 particle, a superconducting transmon, or an electronic state in a quantum dot. Quantum gates are unitary operators acting on one or more qubits; standard gate sets include the Pauli gates (X, Y, Z), the Hadamard (H), phase gates (S, T), and entangling gates such as CNOT and CZ. Circuits are typically depicted with horizontal wires for qubits and boxes or symbols for gates, and they culminate in quantum measurement operations producing classical outcomes. Theoretical frameworks related to circuit expressivity include Solovay–Kitaev theorem for gate approximation and the quantum Fourier transform as a circuit subroutine.
Design of quantum circuits begins with algorithm decomposition into primitive gates; compilation maps logical circuits to hardware-native gates while respecting connectivity constraints. Tools such as Qiskit, Cirq, Quil, and Forest enable transpilation, scheduling, and routing. Optimization targets include gate-count reduction, depth minimization, and qubit routing using algorithms like A* search or heuristic methods from graph theory. Techniques such as gate cancellation, template matching, and Clifford+T synthesis reduce costly non-Clifford resources. Resource estimation often employs metrics like quantum volume promoted by IBM and benchmarks from the Quantum Economic Development Consortium.
Quantum circuits have been implemented across diverse platforms: superconducting qubit processors (e.g., Google Sycamore, IBM's processors), trapped ion chains at groups like IonQ and University of Innsbruck, photonic quantum computing systems (e.g., Xanadu), and semiconductor approaches using silicon qubits and quantum dots at Microsoft Quantum and Intel. Hybrid architectures combine circuit-model steps with analog quantum simulators in cold-atom labs such as at JILA and Max Planck Institute for Quantum Optics. Experimental milestones include demonstration of quantum supremacy claims and scalable implementations of small-depth circuits for chemistry simulations and optimization.
Real devices suffer decoherence, gate infidelity, and crosstalk, imposing limits on circuit depth and size. Quantum error correction (QEC) schemes such as the surface code, Steane code, and Bacon–Shor code enable fault-tolerant architectures by encoding logical qubits into many physical qubits. Fault tolerance requires thresholds derived from theory and experimental error rates measured by protocols like randomized benchmarking and gate set tomography. Research from laboratories at Google Quantum AI, IBM Research, Microsoft Research, and universities focuses on reducing error budgets, engineering high-coherence materials, and designing error-corrected logical operations.
Quantum circuits implement core algorithms in cryptography, chemistry, and optimization. Notable circuits realize Shor's algorithm for integer factorization, Grover's algorithm for unstructured search, and variational circuits used in the variational quantum eigensolver (VQE) and quantum approximate optimization algorithm (QAOA). Circuits also underpin protocols in quantum error correction, quantum teleportation, and entanglement distribution for quantum networks. Collaborations between industry and academia — including Google, IBM, Rigetti, Honeywell Quantum Solutions, and university groups — drive application-driven circuit design for problems in quantum chemistry and materials science.
Quantum circuits carry societal implications: powerful quantum algorithms could disrupt public-key cryptography based on RSA, prompting policy responses like the post-quantum cryptography initiatives at standards bodies (e.g., NIST). Access to quantum computing resources raises equity concerns: concentration of capital in corporations could widen technology gaps between wealthy institutions and marginalized communities. Advocates in academia and civil society call for open-source tools (Qiskit, Cirq) and public investment to democratize access, prioritize climate and healthcare applications, and ensure ethical governance. Responsible deployment involves workforce development, inclusive research funding, and preemptive standards from organizations such as the Quantum Economic Development Consortium and national science agencies.
Category:Quantum information science Category:Quantum computing