Quantum computing, explained without the hype
What qubits are, why errors are the whole problem, and which jobs quantum computers might eventually do better than any supercomputer.
Quantum computing headlines tend to swing between “this changes everything” and “this is decades away”. Neither helps you understand the technology. This explainer covers what a quantum computer is, what it can’t do, and what to watch for.
Bits and qubits
An ordinary computer stores information in bits, each either 0 or 1.
A quantum computer uses qubits. Thanks to a property called superposition, a qubit can be in a blend of 0 and 1 at the same time, with the balance described by precise probabilities. Qubits can also be entangled, meaning their states are linked so that measuring one tells you something about the others, no matter how the calculation proceeds.
When you finally measure a qubit, it snaps to a plain 0 or 1. The art of quantum algorithms is arranging the calculation so that wrong answers cancel each other out and the right answer becomes the likely outcome of that measurement.
Faster only at certain problems
A common myth is that quantum computers try every answer at once and pick the best. They don’t. For most everyday tasks, such as browsing, spreadsheets or even most AI, a quantum computer would be no faster, and often far worse.
Quantum computers are expected to excel at a narrower set of problems with a special mathematical structure, including:
- Simulating molecules and materials, since nature itself is quantum. This could help design batteries, catalysts and drugs.
- Certain optimisation and sampling problems.
- Factoring large numbers, which is why today’s encryption will eventually need upgrading.
Errors are the whole problem
Qubits are extraordinarily fragile. Heat, vibration and stray electromagnetic fields disturb them, introducing errors within tiny fractions of a second. Today’s machines are noisy, and noise limits how long a calculation can run.
The fix is quantum error correction: spreading the information of one reliable logical qubit across many physical qubits, constantly checking for errors and correcting them without destroying the calculation. It works in principle, and has been demonstrated in labs, but it needs a lot of physical qubits per logical one.
Reaching large numbers of reliable logical qubits, a fault-tolerant quantum computer, is the milestone the whole field is working toward. Much of the current engineering and software effort is aimed at it.
The encryption question
A large fault-tolerant quantum computer could break the public-key encryption that protects much of the internet today. That is why governments and tech companies are already moving to post-quantum cryptography: new algorithms believed to resist quantum attacks. The switch is happening now because data stolen today could be decrypted later.
How to read quantum news
A few questions cut through most announcements:
- Physical or logical qubits? Big physical-qubit counts matter less than error rates.
- What problem was solved? Was it useful, or a benchmark designed to favour quantum hardware?
- Compared to what? Classical computers and algorithms keep improving too.
The honest answer on timing is that useful, fault-tolerant machines are still ahead of us, but the steps toward them are now measurable, and worth following.
