Lesson 1 of 9
The problem it is actually for
Tell a problem a quantum computer could genuinely help with from one it cannot.
01 · Learn · the idea
A soil bacterium does at room temperature what a factory needs 400°C and one per cent of the world's energy to do — and nobody can compute how.
How it works
- A quantum system's parts cannot be described separately they add and cancel against each other
- So you must track every combination at once 2 to the power of n values
- Each extra particle DOUBLES what you have to write down
- Around 50 particles the memory passes any computer ever built
- So build the machine out of the same stuff as the problem Feynman, 1981
In numbers
Memory needed to hold the state of n particles
The first three points are not zero. They are 16 megabytes, 17 gigabytes and 17 terabytes — and at the scale the fourth one forces, they are invisible.
Side by side
What the machine is shaped for
The common misread
That a quantum computer is a faster computer, so it will speed up whatever you already run. It is a special-purpose instrument, like a wind tunnel — magnificent, and no help at all with a letter.
The words
- qubit
- the quantum machine's unit of information — the next item is about what its state actually is
- period
- how often a pattern repeats; some hard questions turn into finding one
Carry this
Ask what shape the problem is, not how powerful the machine is. Capability is almost always a match between a tool's shape and a job's.
Full lesson
A chemist with a molecule she cannot compute
Nitrogen makes up most of the air. Plants cannot use it from the air, so almost every crop on earth depends on ammonia made in a factory. That factory runs at about 400°C and 200 atmospheres of pressure, and burns through roughly one per cent of the world’s energy supply doing it.
A bacterium in the soil does the same reaction at room temperature, using an enzyme called nitrogenase. Nobody can say exactly how. The active part of that enzyme is a cluster of iron and sulphur atoms, and to predict how its electrons arrange themselves you have to track them all at once — because in a quantum system, the parts are not separable.
That is the shape of the problem. Not “a very big sum”. A sum whose size doubles every time you add one more particle.
Why doubling is the whole story
Describe one electron’s state and you need a couple of numbers. Two electrons need four. Three need eight. The pattern is 2 to the power of n — one number for every combination the system could be in, and they all matter at once, because they can add and cancel against each other.
Work it through with real memory. A single one of those numbers takes about 16 bytes to store properly.
- 20 particles: 16 megabytes. A photograph.
- 30 particles: 17 gigabytes. A laptop, straining.
- 40 particles: 17 terabytes. A server room.
- 50 particles: 18 petabytes. More than the largest supercomputers hold.
Every extra particle doubles it. Not “makes it harder” — doubles it. There is no faster chip that fixes this, because the difficulty is not in the arithmetic. It is in how much there is to write down.
Meanwhile the bacterium in the soil does it in a fraction of a second, and it is not doing arithmetic at all. It is simply being a quantum system.
Feynman’s move
In 1981 the physicist Richard Feynman put the obvious question. If a quantum system is impossibly expensive to simulate on an ordinary computer, but nature runs it for free, why not build a computer that is itself quantum? Let the machine’s own particles do what the particles you are studying do.
That is what a quantum computer is. Not a faster computer. A machine built out of the same stuff as the problem, so that the problem’s difficulty stops being a difficulty.
This is why the honest list of things quantum computers are good for is short and specific:
- Simulating quantum systems — molecules, materials, chemical reactions. The original purpose, and still the strongest one.
- Problems with a hidden repeating structure. Factoring a large number is the famous one. It is not that the machine tries every factor; it is that the question can be turned into “what is the period of this pattern?”, and finding a period is something a quantum machine can do in one go.
- Some searching and optimisation, with a real but modest gain — roughly a square root, so a search taking a million steps takes a thousand. Useful. Not a revolution.
And the list of what it cannot help
This half matters more, because it is where the claims go wrong.
Anything whose difficulty is the amount of data is a bad fit. To work on a billion customer records, a quantum machine must first have those billion records loaded into it, one at a time. The loading takes as long as the ordinary computer would have taken to just do the job. The speed-up drowns before it starts.
So: not spreadsheets. Not video. Not databases. Not sorting. Not adding numbers faster. And not, in any general sense, the everyday work of the computer you are reading this on.
A quantum computer is a special-purpose instrument, like a wind tunnel. A wind tunnel is magnificent and it will not help you write a letter. Nobody is embarrassed by that, because nobody ever claimed a wind tunnel was the future of letters.
The instrument and the world
There is a habit of thought worth breaking here. We ask “how powerful is it?” as if power were one quantity, and machines could be ranked on it. That question has no answer. The useful question is narrower and harder: what shape is this problem, and does the machine share that shape?
The bacterium is not powerful. It is well matched. Most of what looks like capability, in machines and in institutions alike, is really a match between the shape of a tool and the shape of a job — and most disappointment is what happens when someone forgets to check.
02 · Try · the lab
03 · Check · quick quiz
1. A company wants to speed up a nightly job that sorts 40 billion sales records. Would a quantum computer help?
- No — the difficulty is the amount of data, and it all has to be loaded in one item at a time
- Yes — sorting is exactly the kind of repeated operation quantum machines do at once
- Yes — 40 billion records is only about 36 qubits' worth
- No — but only because current machines are too small; a larger one would
Answer
No — the difficulty is the amount of data, and it all has to be loaded in one item at a time — Loading the data costs about as much as doing the job the ordinary way, so any speed-up drowns before it starts. This is not a size problem that a bigger machine fixes.
2. Why does simulating 50 interacting particles defeat an ordinary computer?
- The number of values you must track doubles with each extra particle
- The arithmetic involved is too precise for ordinary chips
- Quantum particles move too fast to be measured in time
- Fifty is beyond the number of variables a program can hold
Answer
The number of values you must track doubles with each extra particle — It is 2 to the power of n, so each added particle doubles the memory. Fifty particles need about 18 petabytes. The arithmetic is easy; there is just impossibly much of it.
3. Which of these is the strongest reason to expect quantum computers to matter?
- Nature already runs quantum systems for free, so a quantum machine is shaped like the problem
- They can try every possible answer simultaneously and pick the best
- They will eventually be faster than ordinary computers at everything
- Their chips run at much higher clock speeds
Answer
Nature already runs quantum systems for free, so a quantum machine is shaped like the problem — Feynman's point: build the machine out of the same stuff as the problem. "Trying every answer at once" is the most common description and it is not what happens — the rest of this course is about what does.