CAT 2022 Slot 1 VARC: The Gap Between Quantum Physics and Quantum Hype

Every few years, a headline announces that quantum computers are about to render modern encryption obsolete, cure diseases classical computers cannot model, or otherwise usher in a technological discontinuity as significant as the transistor. The underlying physics is real: a quantum computer, by exploiting superposition and entanglement, can in principle explore a computational space that grows exponentially with the number of qubits, and for a narrow class of problems — most famously integer factorization, via Shor's algorithm — this translates into a genuine, exponential speed-up over the best known classical methods. The trouble is that this narrow class of problems is considerably narrower than popular coverage tends to suggest, and the gap between "a quantum algorithm exists on paper" and "a quantum computer can run it usefully" remains, for most practical purposes, enormous.

The central obstacle is decoherence: qubits lose their delicate quantum state through interaction with their environment on timescales measured in microseconds to milliseconds, and every gate operation performed on them introduces a small probability of error. Classical bits are essentially immune to this problem — a transistor is either on or off, robustly — but a qubit's continuous, fragile state must be protected through quantum error correction, which itself consumes additional physical qubits to encode a single reliable "logical" qubit. Current estimates suggest that a fault-tolerant quantum computer capable of breaking modern RSA encryption would require on the order of a million physical qubits; the largest publicly known machines, as of this writing, operate with qubit counts in the low thousands, and error rates remain far above the threshold at which large-scale error correction becomes practical.

None of this means quantum computing is a mirage. In narrow domains — simulating molecular structures for drug discovery, optimizing certain classes of financial portfolios, some forms of cryptographic key distribution — smaller, noisier machines may deliver genuine value well before fault tolerance is achieved, a regime researchers term "noisy intermediate-scale quantum" computing. But the gap between this modest, near-term promise and the exponential-everything narrative that dominates public discussion serves specific interests: it helps technology companies justify enormous research budgets to investors, helps governments justify strategic funding programs framed as an arms race with geopolitical rivals, and helps a small number of well-publicized results — often on problems specifically chosen because they favour quantum over classical methods — stand in for a broader capability that does not yet exist.

The historical pattern is a familiar one to observers of prior technological waves: a genuine scientific advance gets wrapped in a narrative whose confident timelines serve the immediate interests of those telling it, while the harder, more uncertain engineering reality is left for specialists to sort out, largely out of public view, on a schedule the popular narrative rarely bothers to specify. Recognizing this pattern does not require dismissing the underlying science; it requires distinguishing what is established from what is aspirational, and asking, of any particular claim, who benefits from the public believing it sooner rather than later.