Quantum Computing

Quantum computing is a model of computation that uses quantum phenomena — superposition, interference, and entanglement — to process information in ways no classical computer can efficiently imitate. For a small set of carefully chosen problems, a large fault-tolerant quantum computer could deliver enormous speed-ups; for most everyday tasks it offers no advantage at all. Understanding which is which is the heart of the subject.

The qubit

The basic unit is the qubit. A classical bit is either 0 or 1; a qubit can occupy a superposition of both, written

|ψ⟩ = α|0⟩ + β|1⟩,  |α|² + |β|² = 1

where α and β are complex amplitudes. Measuring the qubit yields 0 with probability |α|² or 1 with probability |β|², and collapses the superposition. The power is not that a qubit "stores both values at once" — measurement still returns a single bit — but that n qubits share a state described by 2ⁿ amplitudes that evolve and interfere together.

Why interference, not parallelism

A quantum algorithm does not simply test every possibility in parallel and read off the answer. It arranges the amplitudes so that paths leading to wrong answers cancel by destructive interference while paths leading to the right answer reinforce. The whole art of algorithm design is engineering that cancellation. Without it, the 2ⁿ amplitudes are inaccessible — measurement would just return a random outcome.

The flagship algorithms

Shor's algorithm (1994) factors large integers in roughly polynomial time, exponentially faster than the best known classical method. Because the security of RSA encryption rests on factoring being hard, a large-scale quantum computer would break it — the reason "post-quantum" cryptography is now being standardised. Grover's algorithm searches an unstructured list of N items in about √N steps instead of N, a quadratic (not exponential) speed-up. Equally important is quantum simulation: modelling molecules and materials whose quantum behaviour overwhelms classical computers, a likely first practical application in chemistry and drug design.

The engineering barrier

Qubits are fragile. Any stray coupling to the environment causes decoherence, scrambling the computation. Leading hardware — superconducting circuits (Google, IBM) and trapped ions (IonQ, Quantinuum) — fights this with extreme isolation and cooling, but physical qubits remain noisy. The path to useful machines runs through quantum error correction, which spreads one reliable "logical" qubit across many physical ones; current estimates require hundreds to thousands of physical qubits per logical qubit, far beyond today's devices.

A common misconception

Quantum computers are not simply "faster computers." They are not better at spreadsheets, video, or most software, and they will not replace classical machines. Their advantage is confined to specific problem structures — factoring, search, simulation, certain optimisation — where quantum interference can be exploited. Demonstrations of quantum supremacy mark scientific milestones on contrived benchmarks, not broad practical superiority.