Quantum Computing
Why a Quantum Computer Lives in a State of Controlled Contradiction
The most powerful computers being built today work precisely because they haven't decided what they're doing yet.
The Idea
Classical computers are ruthlessly decisive. Every bit is either 0 or 1 — on or off — and all computation flows from that binary certainty. Quantum computers exploit a different regime of physics entirely, one where particles exist in superposition: genuinely inhabiting multiple states at once until the moment they are measured. A quantum bit, or qubit, isn't just 0 or 1 — it's a weighted blend of both, described by probabilities that evolve according to quantum mechanics. But superposition alone doesn't make a useful computer. The real power comes from two additional phenomena. The first is entanglement: when qubits are entangled, the state of one is instantly correlated with the state of others, regardless of distance, so manipulating one changes what you know about all the rest. The second is interference — the same wave-like property that lets two ripples cancel each other out. A quantum algorithm is choreographed so that wrong answers interfere destructively and cancel themselves, while correct answers interfere constructively and amplify. What you get when you measure isn't a random guess from a sea of possibilities — it's the answer that survived. The deepest strangeness here isn't the jargon. It's that a quantum computer doesn't explore every possible solution one by one. In some meaningful sense, it explores them simultaneously — and then collapses into the right one. That is genuinely, categorically different from anything a classical machine can do.
In the World
In December 2023, Google's quantum research team announced that their Sycamore processor had completed a computation in under a minute that they estimated would take the world's fastest classical supercomputer 47 years. That claim is contested — IBM and others have argued the classical estimate is too pessimistic — but the underlying point stands: for specific, carefully chosen problems, quantum machines are pulling ahead. The problem Sycamore solved was deliberately abstract, chosen to showcase quantum advantage rather than solve anything practical. But researchers don't need to wait long for the practical applications to crystallise. The most consequential near-term target is molecular simulation. Classical computers struggle to model even modestly sized molecules accurately, because the quantum behaviour of electrons interacting with each other grows exponentially complex. A quantum computer, operating in the same quantum regime as the molecules themselves, handles this naturally. This matters enormously for drug discovery — simulating how a protein folds, or how a potential drug molecule binds to a receptor, is precisely the kind of problem that has resisted classical computation for decades. It matters for materials science too: designing room-temperature superconductors or more efficient solar cells requires modelling electron behaviour at a level of fidelity that classical machines simply cannot reach. The era of quantum advantage for real-world chemistry is not yet here, but it is the clearest horizon researchers are working towards.
Why It Matters
Understanding what quantum computing actually is — rather than the vague promise of 'exponentially faster computers' — changes how you read a lot of headlines. It is not a universal speed upgrade. A quantum computer will almost certainly never replace your laptop for browsing or spreadsheets; classical machines are better at those tasks by design. What quantum computers offer is dominance over a specific class of problems: those involving vast solution spaces, molecular simulation, or optimisation at scale. The one area where the implications are genuinely urgent is cryptography. Most of the encryption protecting financial systems, private communications, and government data relies on the fact that factoring very large numbers is computationally intractable for classical machines. A sufficiently large quantum computer running Shor's algorithm would make that tractable — and some encrypted data being harvested today could be decrypted later, once the hardware catches up. Governments and standards bodies are already racing to develop post-quantum cryptography as a result. Knowing this helps you hold the technology with appropriate nuance: neither the hype of 'it will solve everything' nor the dismissal of 'it's all theoretical.' It's a genuinely revolutionary tool for a specific set of problems — and some of those problems matter a great deal.
A Question to Ponder
If a quantum computer solves a problem by exploring many possibilities simultaneously and then collapsing into an answer, does it experience — in any meaningful physical sense — the paths it didn't take?
Get a new one of these every morning.
Start learning with Thinkable