| quantum computation | |
|---|---|
| Name | Quantum computation |
| Field | Quantum Physics, Computer science |
| Introduced | 1980s |
| Notable institutions | IBM, Google, Microsoft, D-Wave, Rigetti, Intel, Oxford, MIT, UC Berkeley, Los Alamos National Laboratory, Los Alamos |
| Notable people | Richard Feynman, David Deutsch, Peter Shor, Lov Grover, John Preskill |
quantum computation
Quantum computation is the study and application of computational systems that exploit principles of quantum mechanics—such as superposition, entanglement, and quantum interference—to perform information processing tasks. It matters within Quantum Physics because it translates foundational physical laws into new models of computation with potential advantages in speed, simulation of quantum systems, and secure communications.
Quantum computation arises directly from the formalism of Quantum mechanics and the quantum theory of open systems. Early theoretical proposals by Richard Feynman and David Deutsch framed computation in terms of unitary evolution and reversible gates, linking closely to experiments in atomic physics, quantum optics, and condensed-matter realizations. The discipline bridges theoretical computer science notions such as Turing machines and complexity classes with laboratory practice in quantum information science. It is informed by research at institutions including IBM, Google and national laboratories such as Los Alamos and NIST.
At the core of quantum computation are qubits, two-level quantum systems that generalize classical bits via linear superposition in a two-dimensional Hilbert space. Qubits can be embodied by physical platforms such as superconducting circuits, trapped ions, quantum dots, topological states, and photonic modes. Key operations include single-qubit rotations and entangling two-qubit gates like the CNOT, governed by unitary operators. Measurements collapse quantum states according to the Born rule, and resources such as entanglement and quantum coherence determine computational power. Foundational theoretical concepts include quantum gates, circuit models, and continuous-variable computation.
Quantum algorithms exploit interference and entanglement to outperform classical counterparts for specific problems. Notable algorithms include Shor's algorithm for integer factorization and discrete logarithms, Grover's algorithm for unstructured search, and quantum simulation algorithms for many-body physics inspired by Feynman's proposals. Complexity-theoretic classifications such as BQP (bounded-error quantum polynomial time) and comparisons to classical classes like NP and P frame expected advantages and limits. Research into quantum algorithm design involves contributions from figures and works like Peter Shor, Lov Grover, John Preskill and textbooks by Michael A. Nielsen and Isaac L. Chuang.
Multiple hardware approaches pursue scalable quantum processors. Major platforms include superconducting qubits developed by companies such as IBM and Google, trapped-ion systems advanced at IonQ and Honeywell/Quantinuum, and annealing devices by D-Wave. Semiconductor efforts by Intel and Quantum dot research at UNSW pursue spin-based qubits. Photonic quantum computing is explored by groups at Xanadu and in integrated optics, while topological approaches motivated by Kitaev target non-Abelian anyons in platforms like Majorana experiments. Complementary infrastructure includes cryogenics, microwave control, and error-characterization facilities at national programs and university cleanrooms.
Decoherence—the loss of phase relationships due to coupling with environments—is the principal physical challenge, studied under open quantum systems theory. Quantum error correction codes such as the surface code, concatenated code, and Steane code protect logical qubits by encoding them into many physical qubits, enabling fault-tolerant quantum computation when error rates fall below threshold values. Experimental milestones report demonstrations of logical qubit primitives at IBM Research and Google Quantum AI, while theoretical limits and threshold theorems were formulated by Peter Shor and others. Active error mitigation and noise spectroscopy are important near-term techniques used in NISQ devices.
Potential applications span quantum simulation of chemical and materials systems, optimization, machine learning primitives, and secure communication via QKD. Quantum algorithms like Shor's algorithm threaten widely used public-key cryptography schemes (e.g., RSA and ECC), prompting transitions to post-quantum cryptography standards led by agencies such as NIST. Governments and defense establishments view quantum computation as a strategic technology affecting national infrastructure, supply chains, and scientific competitiveness; national initiatives (for example the National Quantum Initiative in the United States) coordinate research, industry partnerships, and workforce development.
Scaling to fault-tolerant, useful quantum computers faces technological, economic, and scientific obstacles: qubit quality, coherent control, cryogenic engineering, and supply chains for specialized materials. Policy challenges include export controls, standards setting, and balancing national security with open scientific collaboration. Ethical considerations address dual-use risks to privacy and cryptographic integrity, equitable access to benefits, and stewardship of research funded by public institutions. Responsible deployment requires coordinated policy from governments, industry leaders like Microsoft, IBM, and international bodies, alongside academic guidance from centers at MIT, Oxford, and Caltech.