| Quantum computer | |
|---|---|
| Name | Quantum computer |
| Type | Quantum computing device |
| Invented | 1980s |
| Inventor | Paul Benioff; theoretical development by Richard Feynman and Yuri Manin |
| Company | IBM, Google, D-Wave Systems, Rigetti Computing, IonQ |
| Platform | Superconducting qubit, Trapped ion, Topological qubit, Photonic quantum computer |
Quantum computer
A quantum computer is a device that performs computation using principles of Quantum mechanics—notably superposition and entanglement—to process information encoded in quantum two-level systems called qubit. Quantum computers potentially solve certain problems more efficiently than classical Turing machine-based processors, with implications for cryptography, materials science, and simulation of quantum systems in quantum physics.
A quantum computer manipulates quantum states according to unitary evolution and measurement postulates of Quantum theory. Logical operations are implemented as quantum gate sequences or analog quantum dynamics to transform multi-qubit registers. Theoretical models include the quantum circuit model, adiabatic quantum computing, and measurement-based quantum computation (cluster states). Early foundational contributions were made by Paul Benioff, Richard Feynman, and David Deutsch, who formalized the idea of a universal quantum Turing machine.
Quantum computing relies on core quantum phenomena: superposition allows qubits to represent linear combinations of basis states; entanglement generates nonclassical correlations across subsystems; and quantum interference enables algorithmic amplitude amplification. Operations respect unitary evolution and are constrained by the no-cloning theorem and measurement-induced state collapse described by the Born rule. Thermodynamic and information-theoretic limits, such as the Landauer's principle and quantum decoherence mechanisms studied in open quantum systems research, determine practical performance.
Architectures define physical qubits, connectivity, and control stacks. Prominent qubit modalities include superconducting qubits (transmons developed by groups at Yale University and companies like IBM and Google), trapped ion qubits (pursued by University of Innsbruck teams and IonQ), photonic quantum computer approaches (e.g., work at Xanadu), and proposals for topological qubits (informed by Alexei Kitaev and experimental efforts at Microsoft Quantum). Alternative platforms include spin qubits in silicon (industrial research at Intel and University of New South Wales), nitrogen-vacancy centers in diamond, and neutral-atom arrays (e.g., ColdQuanta and academic groups). Architecture choices affect gate sets, native two-qubit interactions, and scaling strategies like modular and networked quantum processors.
Quantum algorithms exploit amplitude manipulation for speedups. Landmark algorithms include Shor's algorithm for integer factorization and discrete logarithms, and Grover's algorithm for unstructured search. Quantum simulation algorithms, pioneered by Feynman and formalized by Seth Lloyd, enable efficient modeling of quantum many-body systems. Complexity classes such as BQP (bounded-error quantum polynomial time), QMA, and relationships with classical classes (P, NP, PSPACE) characterize theoretical limits. Algorithmic advances continue with variational hybrid quantum-classical algorithms like VQE (Variational Quantum Eigensolver) and QAOA (Quantum Approximate Optimization Algorithm), often developed in collaboration between academic groups (e.g., MIT, Caltech) and companies.
Practical quantum computing requires mitigation of decoherence and operational errors arising from coupling to environments and imperfect control. Quantum error correction (QEC) codes, such as the surface code and Steane code, enable logical qubits protected by redundancy and syndrome measurement. Fault-tolerant thresholds determine required physical qubit quality; seminal theoretical work by Peter Shor and Andrew Steane established QEC principles. Near-term devices use error mitigation techniques—zero-noise extrapolation, probabilistic error cancellation, and symmetry verification—to improve algorithmic output without full QEC. Understanding noise channels and implementing scalable fault-tolerant quantum computation remain central research targets.
Experimental platforms span superconducting circuits in dilution refrigerators (leading demonstrations by Google's Sycamore), trapped-ion chains (notable implementations at Honeywell Quantum Solutions and IonQ), photonic processors based on integrated optics (research at University of Bristol and Xanadu), and experimental topological platforms exploring Majorana fermion signatures (collaborations involving Microsoft Research and university partners). Benchmarking efforts use randomized benchmarking, quantum volume (proposed by IBM), and task-specific metrics. National laboratories (e.g., Los Alamos National Laboratory, Argonne National Laboratory), consortia like the Quantum Economic Development Consortium, and international programs (e.g., the European Quantum Flagship) coordinate large-scale development.
Promising applications include quantum simulation for quantum chemistry and materials science (drug discovery, catalyst design), optimization problems in logistics and finance via QAOA, and cryptanalysis threats to RSA and ECC necessitating post-quantum cryptography standards (work by NIST). Limitations include qubit coherence times, gate fidelity, scaling overhead for QEC, and algorithmic constraints where classical heuristics remain competitive. Roadmaps by companies and governments project incremental milestones from noisy intermediate-scale quantum (NISQ) devices to fault-tolerant universal quantum computers. Ongoing research integrates advances in quantum control, materials science, and error-correcting codes to realize practical quantum advantage in domains grounded in quantum physics.