Quantum computers keep making headlines and the jargon keeps most people locked out of the conversation. This is a plain-language guide to what quantum supremacy means, why physicists argue about whether it has been achieved, and why it probably will not break your bank account's encryption anytime soon.
Every device you have ever used to read an article, send a message, or watch a video operates on classical computing principles established in the 1940s. At the most fundamental level, a classical computer processes information as bits — tiny switches that are either off (0) or on (1). Everything your smartphone does, every calculation your laptop runs, every transaction your bank processes is ultimately a sequence of these binary operations, performed billions of times per second.
Classical computers are extraordinarily powerful by any human intuition. The device you are reading this on can perform more calculations per second than every human mathematician who has ever lived, working together for their entire careers. But they have a fundamental constraint: each bit must be in a definite state, and complex problems require examining an exponentially growing number of possible states one by one.
For certain categories of problem — searching through enormous datasets, breaking certain types of encryption, simulating the behavior of molecules — this sequential approach hits a wall. No matter how fast classical processors get, some problems remain computationally intractable. Quantum computing is the attempt to route around that wall using the stranger rules of quantum physics.
A qubit — quantum bit — is the basic unit of quantum information, and its most important property is superposition. A classical bit is a light switch: definitively off or definitively on. A qubit is more like a spinning coin: while it is in the air, it is both heads and tails simultaneously. Only when you catch it — when you measure it — does it resolve into a definite state.
This is not a metaphor for our ignorance about what state the qubit is in. It is a genuine physical fact, verified by decades of experiment. The qubit exists in a superposition of states until observation forces it to choose one. This means a register of ten qubits can, before measurement, represent all 1,024 possible ten-bit combinations simultaneously. A 50-qubit register can simultaneously represent over one quadrillion states.
The second critical property is entanglement. When two qubits are entangled, their states become correlated in a way that has no classical equivalent: measuring one instantly tells you something about the other, regardless of the distance between them. Einstein famously called this "spooky action at a distance" and suspected it indicated a flaw in quantum theory. Decades of experiments have confirmed quantum entanglement is real and can be harnessed computationally.
The third property is interference. Quantum algorithms are designed to amplify paths that lead to correct answers and cancel out paths that lead to wrong ones — much like how noise-canceling headphones use destructive interference to eliminate unwanted sound. Combining superposition, entanglement, and interference gives quantum computers their theoretical power over classical machines for specific problem types.
"A quantum computer is not a faster classical computer. It is a different kind of computer — one that processes information according to fundamentally different physical laws. Expecting it to simply replace everything else is like expecting a submarine to replace all boats." — Dr. John Preskill, California Institute of Technology, coiner of the term "quantum supremacy"
In October 2019, Google's AI division published a paper in Nature claiming that its 53-qubit Sycamore processor had achieved quantum supremacy. Specifically, the chip completed a particular sampling problem — verifying a set of random circuit outputs — in 200 seconds, a task Google claimed would take the world's most powerful classical supercomputer approximately 10,000 years.
IBM immediately pushed back, arguing that a classical supercomputer with sufficient disk storage could perform the same calculation in 2.5 days rather than 10,000 years. The dispute illuminated something important: quantum supremacy, as currently defined, applies to a very narrow, very carefully chosen task. Google's sampling problem had essentially no practical application; it was selected precisely because it is hard for classical machines and relatively tractable for quantum ones. It was, in effect, a demonstration of the principle rather than a useful computation.
Subsequent claims of quantum advantage — the preferred term today, since "supremacy" has baggage — have followed a similar pattern: impressive demonstrations on tasks designed to showcase quantum hardware strengths, with immediate classical counter-arguments about how optimal classical algorithms could close much of the gap. The field is making real progress, but the gap between "quantum outperforms classical on a synthetic benchmark" and "quantum computers are solving problems we actually care about" remains enormous.
Current quantum computers are described as NISQ devices — Noisy Intermediate-Scale Quantum machines. The "noisy" part is the crux of the problem. Qubits are extraordinarily sensitive to disturbance. Heat, vibration, stray electromagnetic fields, even cosmic rays can cause a qubit to lose its quantum state — a phenomenon called decoherence. Once a qubit decoheres, its quantum information is lost, and any calculation it was part of becomes unreliable.
Today's best quantum processors can maintain coherent qubits for times measured in milliseconds to seconds — long enough to run short calculations, but not the sustained, complex operations that would yield practical advantages. The solution is error correction: redundantly encoding the information of one logical qubit across many physical qubits, so that if some physical qubits decohere, the logical information can be reconstructed. But effective quantum error correction currently requires roughly 1,000 physical qubits per logical qubit — meaning a computer with 1 million practical logical qubits would need around 1 billion physical qubits. Today's machines have hundreds to a few thousand physical qubits.
This is the central engineering challenge of the field, and progress is genuinely being made. IBM, Google, Microsoft, and a constellation of startups are pursuing different physical architectures — superconducting circuits, trapped ions, photonic systems, topological qubits — each with different noise profiles and scalability characteristics. No one architecture has clearly won.
This is the question that brings cybersecurity professionals to sleepless nights, and the honest answer is: yes, eventually, but probably not for a very long time, and the internet is already preparing. In 1994, mathematician Peter Shor published an algorithm showing that a sufficiently powerful quantum computer could factor large integers exponentially faster than any known classical algorithm. Since RSA encryption — the backbone of internet security for decades — relies on the practical impossibility of factoring very large numbers, a powerful enough quantum computer running Shor's algorithm would undermine it.
"Sufficiently powerful" means millions of stable logical qubits. We are currently at hundreds of noisy physical qubits. The gap is roughly three orders of magnitude in qubit count, plus orders of magnitude in error rate improvement. Most cryptographers estimate this is 15 to 30 years away — possibly never, if engineering challenges prove more stubborn than hoped.
The US National Institute of Standards and Technology finalized its first set of post-quantum cryptography standards in 2024, with further standards following. Major technology companies and governments are beginning the slow process of migrating critical infrastructure to quantum-resistant encryption. The threat is taken seriously, but the timeline is measured in decades, not years.
The applications that make physicists genuinely excited are in molecular simulation. Classical computers struggle to accurately simulate the quantum behavior of molecules larger than a few dozen atoms — which is a significant constraint for drug discovery and materials science. A quantum computer is, at its core, a quantum system simulating other quantum systems. Even near-term, noisy quantum computers may be able to model the behavior of small but chemically interesting molecules more accurately than any classical supercomputer.
Pharmaceutical companies are investing in quantum computing partnerships precisely because of this potential. The ability to accurately model protein folding, chemical reactions, and molecular interactions at the quantum level could accelerate drug discovery from decades to years. Similarly, new battery chemistries, solar cell materials, and industrial catalysts might be designed computationally rather than through expensive trial and error in physical laboratories.
Optimization problems — logistics, financial portfolio construction, supply chain routing — are another area of genuine promise, though classical algorithms have proven more competitive here than early enthusiasts projected. Quantum machine learning remains highly speculative, with many proposed advantages turning out to be achievable classically upon closer analysis.
Quantum computing deserves the significant investment it is receiving. It is addressing fundamental physical limits of classical computation and may, in a decade or two, transform certain industries. But it is not on the verge of making your laptop obsolete, breaking all encryption, or solving artificial general intelligence. The most useful mental model is a specialized tool that will eventually be extraordinarily powerful for a specific set of problems — molecular simulation, certain optimization tasks, cryptanalysis — while classical computers continue to handle everything else.
The journalists and press releases that describe quantum computers as simply "faster computers" are misleading. So are the ones that describe them as science fiction. The reality, as is so often the case with genuinely transformative technology, is more interesting and more nuanced than either framing captures.
Quantum supremacy (also called quantum advantage) refers to the moment when a quantum computer performs a specific task faster than any classical computer could in any reasonable timeframe. It does not mean quantum computers are generally superior — they excel only at narrow problem types.
Google claimed quantum supremacy in 2019 with its Sycamore processor on a synthetic sampling problem. IBM disputed the claim. Multiple subsequent demonstrations have shown quantum advantage on carefully chosen tasks, but general-purpose supremacy remains elusive.
Eventually, a sufficiently powerful quantum computer running Shor's algorithm could break current RSA encryption. However, the machines needed are estimated to require millions of stable logical qubits — far beyond today's hundreds of noisy physical qubits. Post-quantum cryptography standards are already being deployed as a precaution.
Most experts estimate 10 to 20 years before fault-tolerant quantum computers can outperform classical machines on problems of commercial relevance like drug discovery or materials science. Near-term applications are narrow and mostly in optimization and simulation.
A qubit is the basic unit of quantum information. Unlike a classical bit, which is either 0 or 1, a qubit can exist in a superposition of both states simultaneously until measured. This property, combined with entanglement, gives quantum computers their theoretical power.