The engineering discipline and technology stack that performs computation using quantum-mechanical phenomena — superposition, entanglement and interference — over registers of qubits, spanning hardware platforms (superconducting circuits, trapped ions, photonics, neutral atoms), error correction, and algorithms such as Shor’s factoring and Grover’s search that offer provable or conjectured speed-ups over classical computation for specific problem classes including cryptanalysis, simulation of quantum systems and combinatorial optimisation.

Semantic Classification

Content

Definition

Quantum computing realises the quantum computation paradigm as working machines. Where a classical bit is definitely 0 or 1, a register of n Qubits occupies a superposition described by 2ⁿ complex amplitudes; quantum gates manipulate all amplitudes simultaneously, and interference is choreographed so that measurement yields a useful answer with high probability. The field’s theoretical case rests on algorithms with proven separations: Shor’s algorithm (1994) factors integers and computes discrete logarithms in polynomial time, threatening RSA and elliptic-curve cryptography, while Grover’s algorithm gives a quadratic speed-up for unstructured search. Feynman’s original motivation — efficiently simulating quantum systems themselves — remains the application with the clearest expected advantage, in quantum chemistry and materials science.

In complexity-theoretic terms, quantum computers define the class BQP (bounded-error quantum polynomial time), believed to sit strictly between P and PSPACE and to be incomparable with NP; contrary to popular framing, they are not expected to solve NP-complete problems efficiently. This makes Computational Complexity Theory the discipline that delimits honest claims of quantum advantage. For Combinatorial Optimisation, approaches such as the quantum approximate optimisation algorithm (QAOA) and quantum annealing offer heuristic routes whose practical benefit over the best classical heuristics is still an open empirical question.

Current Landscape

Hardware is in the transition from the NISQ (noisy intermediate-scale quantum) era towards early fault tolerance. Superconducting platforms (IBM, Google), trapped ions (Quantinuum, IonQ), neutral atoms (QuEra, Pasqal) and photonics (PsiQuantum, Xanadu) compete on qubit count, gate fidelity and error-corrected logical qubits; thousands of high-quality logical qubits are needed for cryptographically relevant workloads. The credible threat to public-key cryptography has already reshaped security practice: NIST finalised its first post-quantum cryptography standards (FIPS 203 ML-KEM, FIPS 204 ML-DSA, FIPS 205 SLH-DSA) in August 2024, and “harvest now, decrypt later” drives migration planning across governments and financial infrastructure. National programmes in the US, EU, UK and China treat quantum computing as strategic infrastructure, with the UK’s National Quantum Strategy committing £2.5 billion over ten years.

Dated developments: