A short, interactive explainer
How Quantum Computers Work
A quantum computer is not a faster version of your laptop. It is a machine that uses the strange rules of very small things — superposition, entanglement, interference — to explore many possibilities at once and let the wrong ones cancel out. Six stops, no maths required.
By the end you'll be able to explain
- why a qubit is not just a bit that is 'both 0 and 1', and what actually happens when you measure it
- how superposition, entanglement and interference each do a different job inside a calculation
- why more qubits alone does not mean a more useful machine — and what error rates have to do with it
- which real problems quantum computers are built for, and which ones they will never speed up
Stop 01 of 6 · compare cards
A classical bit vs. a qubitQuantum bit — the basic unit of information in a quantum computer.
Everything your phone does comes down to bits: tiny switches that are off or on, 0 or 1, always one or the other. A qubit is the quantum version — and the difference is not that it is 'both at once'.
Picture a bit as a coin lying flat on a table. Heads or tails, 0 or 1. You can look at it whenever you like and the answer is always definite. Every photo, message and video game is billions of these coins, flipped very fast.
Now picture the same coin spinning on its edge. While it spins it is not heads and it is not tails — it is in a state that will become one of them when it stops. That spinning state is the qubit's superpositionA qubit's state before it is measured: a lean toward 0 or 1 that has not yet resolved into either.. Crucially, the spin is not 50/50 by default: you can bias it so that when it lands it is, say, 80% likely to be heads. The qubit stores that bias, not an answer.
The catch is reading it. The moment you look — physicists call this measurementThe act of reading a qubit, which forces it to settle into a definite 0 or 1. — the spin stops and you get a plain heads or tails, and the bias is gone. So a single qubit does not hand you more information than a bit. The power comes from what you can do to many of them before you look.
CLASSICAL BIT
Always definitely 0 or 1. Click it to flip — it is only ever one of the two.
Click to flip it.
QUBIT
A spinning coin: while it spins it holds a bias toward 0 or 1, not an answer.
It only becomes 0 or 1 the instant you look — a moment called measurement.
Try this
- Click the classical bit a few times. It jumps between 0 and 1. There is no in-between, and no surprise.
- Watch the qubit spin without clicking. It never settles. That unsettled state is what a quantum computer works on.
What just happened
The bit changed state only because you told it to, and it was always exactly one value. The qubit is doing something a bit cannot: holding a lean toward 0 or 1 that has not been resolved yet. A quantum computer's job is to nudge those leans across many qubits so the right answer becomes very likely before anyone looks.
Common misconception
“A qubit is 0 and 1 at the same time, so it stores twice as much information.” — When you read a qubit you get exactly one bit out: a 0 or a 1. The superposition is a probability lean, not a second stored value. Its power shows up only when many qubits are steered together before measurement.
Check yourself
You measure a single qubit that was in superposition. How much information do you get out?
One bit — a definite 0 or 1, no more than a classical bit gives you. Whatever bias the qubit held is used up by the measurement. This is why quantum speed-ups come from clever choreography across many qubits, not from packing more data into each one.
Why it matters
This is the single most common thing news articles get wrong, and it makes quantum computers sound like magic super-laptops. Once you see that a qubit stores a lean rather than an answer, the real story — steering probabilities — makes sense.
Stop 02 of 6 · rotatable 3d
Superposition is a point on a sphere
Physicists have a precise picture for that spinning coin: an arrow inside a sphere. Where the arrow points is the qubit's state. Drag the sphere to see the whole space of possibilities, then measure to watch it collapse.
The sphere is called the Bloch sphereThe standard picture of one qubit's state: an arrow inside a sphere, with 'definitely 0' at the north pole and 'definitely 1' at the south.. The north pole means 'definitely 0'. The south pole means 'definitely 1'. Every other direction the arrow can point is a superposition — a different mix of the two. An arrow pointing at the equator is a perfectly even 50/50 lean; an arrow tilted toward the north pole leans toward 0.
This picture does two things for you. First, it makes 'superposition' concrete: it is not a mystery, it is just an arrow that is not pointing at a pole. Second, it shows what a quantum gateA basic operation on qubits — geometrically, a rotation of the state arrow. Quantum programs are built from gates the way ordinary programs are built from instructions. — the basic operation in a quantum program — actually does: it rotates the arrow. Every quantum algorithm is a choreography of rotations.
Measurement is the one operation that is not a rotation. It snaps the arrow to a pole, north or south, with odds set by how close it already was. Then the arrow stays there. That is why you cannot peek mid-calculation: peeking is measuring, and measuring destroys the superposition you were computing with.
Try this
- Drag the sphere around. The amber arrow is the qubit's state. It is not at either pole — that is superposition.
- Click 'Measure it' several times, resetting in between. The arrow snaps to a pole. Which pole is random, but you will get both over a few tries.
- Try measuring twice without resetting. Nothing changes the second time. Once measured, the qubit stays put.
What just happened
Measuring collapsed the superposition: the arrow jumped from its tilted position to a pole and stayed there. A second measurement gave the same pole because there was no superposition left to collapse. This is exactly why a quantum program does all its work first and measures only at the very end.
Common misconception
“A quantum computer tries every answer at the same time and then just reads off the right one.” — If you measured a qubit in an even superposition you would get a random answer, not the right one. Trying everything at once is only half the trick — the other half, interference, is about making the wrong answers cancel before you look. That is stop four.
Check yourself
An arrow on the Bloch sphere points exactly at the equator. If you measure the qubit, what do you get?
A 0 or a 1 with equal odds — a coin flip. The equator is the 50/50 line. Tilt the arrow toward the north pole and 0 becomes more likely; at the pole itself, 0 is certain.
Why it matters
Quantum programmers do not think in 0s and 1s; they think in rotations of arrows like this one. Understanding the sphere is understanding what a quantum gate is — and it is the reason a quantum program looks nothing like ordinary code.
Stop 03 of 6 · network diagram
EntanglementA link between qubits so strong that they share one state: measuring one instantly fixes the other, however far apart they are. connects qubits
Two qubits can be linked so that measuring one instantly fixes the other — however far apart they are, with nothing travelling between them. Click either qubit and watch its partner.
Entangle two qubits and their arrows stop having separate directions. There is one shared state for the pair, and the only thing you can say about each qubit alone is 'random'. But the pair is perfectly correlated: if one reads 0, the other is guaranteed to read 1 (or, for a different entangled state, guaranteed to match).
The temptation is to think the answer was secretly decided in advance, like two sealed envelopes. Experiments over fifty years, recognised with the 2022 Nobel Prize in Physics, ruled that out: the correlations are stronger than any pre-agreed plan could produce. The qubits genuinely did not have individual values until one was measured.
Two things entanglement does not do: it does not send a message (the person holding the second qubit sees a random result until you tell them what you got), and it does not let you copy information. What it does do is let a quantum computer treat many qubits as one enormous shared state — which is where the exponential room to compute comes from.
Click either qubit to measure it.
Try this
- Click the left qubit. Both resolve at once. The right one did not wait to be asked.
- Reset, then click the right qubit instead. Same thing — it does not matter which one you measure first.
- Reset and repeat five or six times. Which qubit gets 0 is random each time, but they always disagree.
What just happened
Each time, the pair produced opposite values, and the qubit you did not click resolved at the same instant as the one you did. There is no signal in the diagram because there is none in nature: the two qubits share a single state, so fixing one half fixes the other. Notice also that you could not choose the outcome — that is why entanglement cannot carry a message.
Common misconception
“Entanglement lets you send information faster than light.” — The results are random on each side. You only discover the correlation when you compare notes afterwards — by phone, email, or another ordinary channel. Nothing usable travels between the qubits.
Check yourself
Your entangled partner is on the Moon. You measure your qubit and get 1. What does your partner see when they measure theirs, and what do they learn from it?
They see 0, every time — but to them it just looks like a random result. They learn nothing about you until you send them your result by ordinary means. The correlation is real and instant; the information is not.
Why it matters
Entanglement is what makes a group of qubits more than the sum of its parts: 300 entangled qubits describe more states than there are atoms in the observable universe. It is also the resource behind quantum-secure communication, where any eavesdropper breaks the entanglement and gives themselves away. — The Nobel Prize in Physics 2022
Sources: The 2022 Nobel Prize in Physics recognised experiments with entangled photons that established the violation of Bell inequalities — NobelPrize.org
Next stop →Stop 04 of 6 · flow diagram
How a calculation actually flows
Superposition gives you room to explore, entanglement links it all together — but how does that become an answer? Five stages, and the crucial one is the third: interferenceThe stage where the wave-like phases of different answers combine: wrong answers cancel, right answers reinforce. It is what makes a quantum computer more than a random-number generator.. Click each stage.
A quantum program starts by setting every qubit to a known state, usually all 0. Then gates rotate and entangle them until the machine holds a superposition over every possible answer at once. So far this sounds like 'try everything' — and if you measured now, you would get one random answer, no better than guessing.
The stage that makes it a computer is interference. Each possible answer carries not just a probability but a phaseWhere in its wave cycle a quantum path sits — its crest or trough. Two paths with opposite phases cancel when they meet. — think of it as the crest or trough of a wave. The gates are arranged so that paths leading to wrong answers arrive with opposite phases and cancel out, like two ripples meeting, while paths leading to the right answer arrive in step and reinforce. Designing that arrangement is what a quantum algorithm is.
Only then do you measure. Because the wrong answers have (mostly) cancelled, the reading is very likely to be a right one. Run it a few times to be sure, and hand the result to an ordinary computer to display. Notice what this means: a quantum computer only speeds up problems where someone has found a way to make the wrong answers cancel. For most everyday tasks, no such trick exists — which is why it will never replace your laptop.
Click each stage to see what happens there.
Try this
- Click 'Apply gates' and then 'Measure'. Skipping interference would give you a random answer — the 'try everything' half alone is useless.
- Now click 'Interference' and read it slowly. This is the only stage that makes wrong answers less likely. Everything else is set-up or read-out.
What just happened
You walked the same path every quantum program takes. The stage most explanations skip — interference — is the one doing the work: it turns 'a superposition of every answer' into 'a superposition heavily weighted toward the right answer'. Without it, measuring a quantum computer is just rolling dice.
Common misconception
“Quantum computers will make everything faster — games, spreadsheets, the web.” — A speed-up exists only where an algorithm can make wrong answers cancel. Factoring large numbers, searching unstructured lists, and simulating molecules have such algorithms. Loading a web page does not, and never will.
Check yourself
A friend says: 'A quantum computer tries every answer at once, so it finds the right one instantly.' Which stage are they forgetting, and why does it matter?
Interference. Trying every answer at once just gives a superposition where each answer is equally likely — measuring it returns a random one. Interference is what cancels the wrong answers so the measurement is likely to be right. No interference, no computer.
Why it matters
In 1994 Peter Shor showed exactly such a cancellation trick for finding the prime factors of huge numbers — the hard problem that protects most internet encryption today. That single algorithm is why governments and banks care about quantum computing, and why 'post-quantum' encryption is being rolled out now. — Shor, 1994 (arXiv:quant-ph/9508027)
Sources: Shor's 1994 algorithm factors integers in polynomial time on a quantum computer — Peter Shor, arXiv:quant-ph/9508027
Next stop →Stop 05 of 6 · sourced chart
Qubit counts have climbed fast — and unevenly
Headlines love qubit counts, and the numbers have grown dramatically. But the chart hides the harder story: today's qubits make mistakes, and fixing those mistakes eats most of the machine.
In 2019 Google's Sycamore chip had 53 qubits and performed a carefully chosen task faster than the best classical supercomputer of the day could simulate — the first widely accepted demonstration that quantum hardware could do something classical machines struggle with. By the end of 2023 IBM had built Condor with 1,121 qubits. On the chart that looks like a rocket.
The complication is noiseUnwanted disturbance — heat, vibration, stray fields — that nudges a qubit's state and introduces errors.. A qubit's superposition is fragile: heat, vibration and stray fields nudge the arrow, and after a fraction of a millisecond the state has drifted or collapsed. Every gate also has a small chance of rotating the arrow slightly wrong. Chain a few hundred gates together and those small errors swamp the answer.
The fix is quantum error correctionSpreading one qubit's state across many physical qubits so that errors can be detected and undone. Costly: it can take hundreds or thousands of physical qubits per reliable logical one.: spreading one 'logical' qubit's state across many physical qubits so that errors can be detected and undone. Depending on the error rate, that can mean hundreds or thousands of physical qubits per useful logical one. This is why the field has shifted from bragging about raw qubit counts to reporting error rates and logical qubits — and why 1,121 noisy qubits is a milestone, not a finish line.
Try this
- Hover the 2019 and 2023 points. 53 to 1,121 in four years — a twenty-fold jump in raw count.
- Look at 2024 and 2025. The line flattens and even dips. Labs started optimising for fewer, better qubits rather than bigger numbers.
What just happened
The chart shows two eras. Up to 2023, progress was measured in raw qubit count and the line climbs steeply. After that it levels off — not because progress stopped, but because the goal changed to lower error rates and error-corrected logical qubits, which do not show up on a raw-count chart at all.
Common misconception
“The computer with the most qubits is the most powerful.” — A thousand noisy qubits can be less useful than a hundred very clean ones, because error correction may need hundreds of physical qubits to make a single reliable logical one. Qubit count, error rate and connectivity together decide what a machine can do.
Check yourself
IBM's Condor has 1,121 qubits. Roughly how many reliable, error-corrected 'logical' qubits does that give you?
Far fewer than 1,121 — with current error rates, error correction can need hundreds or thousands of physical qubits per logical one, so a chip like Condor supports at most a handful of logical qubits, if any. That gap is the central engineering challenge of the field.
Why it matters
A 2019 estimate found that breaking today's standard 2048-bit RSA encryption would take about 20 million noisy physical qubits running for roughly eight hours — against machines that have just passed a thousand. That gap is why encryption is not broken yet, and why the migration to post-quantum encryption has a decade-long runway rather than a panic. — Gidney & Ekerå, 2019 (arXiv:1905.09749)
Sources: Google Sycamore reached 53 qubits (2019) — Arute et al., Nature 574 (2019). IBM Osprey (433 qubits, 2022) and Condor (1,121 qubits, end of 2023) — The Quantum Insider, roadmap survey. Factoring 2048-bit RSA estimated at ~20 million noisy qubits over ~8 hours — Gidney & Ekerå, arXiv:1905.09749
Next stop →Stop 06 of 6 · glossary
Key terms, recapped
Every technical term this page used, in one place. Tap a card to reveal its definition — and try saying each one in your own words before you do.
A good test of understanding is whether you can connect the terms to each other rather than recite them one at a time. Try this chain: a qubit holds a superposition, which the Bloch sphere pictures as an arrow; gates rotate that arrow; entanglement links arrows into one shared state; interference arranges the phases so wrong answers cancel; measurement reads out a single result; and noise is why all of this is so hard to keep going long enough to be useful.
If any link in that chain feels loose, the stop that introduced it is one scroll up. That is the whole tour — six ideas, each only possible because of the one before.
Try this
- Before tapping a card, say its definition out loud. Then tap to compare. Close counts — it is the idea that matters, not the wording.
- Pick any two terms and explain how one depends on the other. For example: why does measurement make interference necessary?
What just happened
You checked your own recall — the most reliable way to move something from 'I read it' to 'I know it'. If two or three definitions came easily, the tour did its job. If not, the chain above tells you which stop to revisit.
Check yourself
In one sentence: what does a quantum computer do that a classical computer cannot?
It steers a shared superposition across many entangled qubits so that, through interference, the wrong answers to certain problems cancel out before it measures — something no amount of classical speed can imitate for those problems.
Wrap
Superposition to explore possibilities, entanglement to correlate them, interference to cancel the wrong answers, measurement to read one out — and error correction to keep it all alive long enough to matter.
Key takeaways
- why a qubit is not just a bit that is 'both 0 and 1', and what actually happens when you measure it
- how superposition, entanglement and interference each do a different job inside a calculation
- why more qubits alone does not mean a more useful machine — and what error rates have to do with it
- which real problems quantum computers are built for, and which ones they will never speed up
Go deeper
- Quantum supremacy using a programmable superconducting processor — Nature, 2019 (Google's 53-qubit Sycamore result) The paper behind the 53-qubit data point on the chart. The abstract is readable; the rest is for the brave.
- Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer — Peter Shor, 1994 (arXiv) The algorithm that made the world take quantum computing seriously.
- How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits — Gidney & Ekerå, 2019 (arXiv) Where the 'millions of qubits' estimate for breaking today's encryption comes from.
- The Nobel Prize in Physics 2022 — entangled photons and Bell inequalities — NobelPrize.org The experiments that showed entanglement is real, not a bookkeeping trick.