What Is Quantum Computing?

Quantum computing is a model of computation that uses the principles of quantum mechanics, including superposition, entanglement, and interference, to process information in ways that are not efficiently simulable by classical computers for certain problem classes. Where a classical bit can be in one of two states (0 or 1), a quantum bit (qubit) can exist in a superposition of both simultaneously, and multiple qubits can be entangled so that operations on one affect the state of others in correlated ways. By designing algorithms that exploit these properties, quantum computers can in principle solve specific problems, such as integer factoring, unstructured database search, and quantum system simulation, with fundamentally better asymptotic scaling than any known classical approach.

The theoretical foundations were laid in the 1980s by researchers including Paul Benioff, Richard Feynman, and David Deutsch, who proposed that quantum systems could perform computations that classical machines could not efficiently replicate. Practical implementation has been a decades-long engineering challenge that is now producing systems with enough qubits and low enough error rates to demonstrate early quantum advantage on selected problems.

Qubits and Quantum Hardware

Physical realizations of qubits include superconducting circuits, trapped ions, photonic systems, spin qubits in semiconductors, and neutral atoms held in optical tweezer arrays. Superconducting qubits, operating at millikelvin temperatures to reduce thermal noise, have been the dominant platform for large-scale experimental systems because their fabrication leverages existing semiconductor manufacturing processes. Trapped-ion qubits offer lower gate error rates and longer coherence times but face challenges in scaling to large numbers of ions with individual addressability. A comparative review in Nature Reviews Physics surveys the relative maturity and engineering trade-offs of leading qubit technologies.

Quantum Gates and Circuits

Quantum computation is typically described in the quantum circuit model, where a computation is a sequence of quantum gates applied to an initial qubit state. Single-qubit gates rotate the qubit state on the Bloch sphere; two-qubit gates such as the CNOT and controlled-Z create entanglement between pairs of qubits. Any quantum computation can be decomposed into a universal gate set consisting of a small number of gate types. The circuit model provides an abstraction layer between algorithms and physical implementations, allowing algorithm designers to describe computations without specifying the physical qubit platform.

Quantum Algorithms

Quantum algorithms are procedures designed to exploit quantum parallelism and interference to outperform classical algorithms on specific tasks. Shor's algorithm factors integers in polynomial time, threatening current public-key cryptography. Grover's algorithm searches an unstructured database of N items in O(N^(1/2)) operations, a quadratic improvement over classical exhaustive search. Variational quantum eigensolvers (VQE) and the quantum approximate optimization algorithm (QAOA) are near-term hybrid classical-quantum approaches designed for chemistry simulation and combinatorial optimization on hardware with limited qubit counts and gate fidelities. IBM's open-source Qiskit framework provides a widely used implementation environment for both circuit-based and variational quantum algorithms.

Quantum Error Correction

Physical qubits are susceptible to decoherence and gate errors, and useful quantum computations require error rates far below what current hardware achieves. Quantum error correction (QEC) encodes a single logical qubit into many physical qubits, distributing the information so that errors affecting individual qubits can be detected and corrected without measuring the encoded logical state. The surface code is the most widely studied QEC code because it requires only nearest-neighbor interactions and has a favorable error threshold. Google's Nature paper on below-threshold surface code operation demonstrated that adding more physical qubits per logical qubit reduced logical error rates, a prerequisite for fault-tolerant quantum computation.

Applications

Quantum computing is being explored for applications across science and industry:

• Cryptography: Shor's algorithm motivates post-quantum cryptography standards; quantum key distribution offers information-theoretic security
• Drug discovery and molecular simulation: quantum systems naturally represent electronic structure, enabling accurate simulation of chemical reactions
• Optimization: combinatorial problems in logistics, finance portfolio balancing, and network routing are candidates for quantum speed-up
• Machine learning: quantum kernel methods and quantum sampling algorithms may accelerate specific learning tasks
• Materials science: simulating strongly correlated electron systems to design new superconductors, catalysts, and battery materials
• Climate modeling: accelerating numerical simulation of fluid dynamics and atmospheric chemistry in high-resolution climate models