The Physics Booklet
This booklet answers the big questions: why does quantum computing exist, what can it do that ordinary computing cannot, and how do physicists write and think about it? Along the way you will learn the real physics words — the same ones scientists use — one at a time, with pictures. When you want to type quantum programs, the Qubble Booklet teaches the language; this booklet teaches the ideas.
1Why quantum computing?
Some problems are too big for ordinary computers — not because the computers are slow, but because the number of possibilities explodes. A molecule with a few dozen electrons has more possible arrangements than there are atoms in Earth. An ordinary computer must check possibilities more or less one by one; the universe does not.
Nature itself runs on quantum rules. A quantum computer is a machine that uses those same rules — blends of possibilities, and waves that add up or cancel — as its working parts. For certain problems, that lets it take shortcuts no ordinary computer can take.
Honest note: a quantum computer is not a faster computer for everything, and it does not "try every answer at once." It helps for some problems, where a clever arrangement of waves makes wrong answers cancel and right answers add up. Chapter 4 shows that trick — it is the heart of the whole subject.
2Bits vs qubits
An ordinary computer is built from bits. A bit is a switch: it is 0 or it is 1, always exactly one of them. Everything your tablet does is billions of switches flipping.
A quantum computer is built from qubits (say: KEW-bits, short for "quantum bits"). A qubit can be definitely 0, definitely 1 — or a blend of possibilities, part pointing at 0 and part pointing at 1. Each part of the blend has a strength, called an amplitude. In Quave, the amplitude bars you see everywhere show exactly these strengths. That picture is the state itself, not a guess.
Left: a bit — a switch. Right: a qubit — two amplitude bars you can watch.
# See a blend with your own eyes (paste into the Studio): q = qubit # a fresh qubit: definitely 0 spin q # make an equal blend of 0 and 1 plot_state q # the bars ARE the qubit's state
3Superposition: the blend
The physics word for the blend is superposition (say: soo-per-po-ZI-shun). "Superpose" just means "place on top of each other" — like two overlapping ripples on a pond. A qubit in superposition holds amplitudes for 0 and for 1 in one single state.
Careful with words — this is the most misquoted idea in all of physics. A qubit in superposition is not "both 0 and 1 at the same time." It is one state: a blend of possibilities, with an amplitude for each. When you measure it, you get exactly one answer. The blend is real (you can see it in the bars); the answer is single.
Physicists write the full blend of a system as its state vector — simply the list of all the amplitudes. Quave's amplitude-bar display is the state vector, drawn as bars so you can watch it change gate by gate.
4Phase & interference: where the power comes from
Every amplitude has a strength and a hidden direction, called its phase. You cannot see phase in a single measurement — but when two paths through a computation meet, phase decides everything. Paths whose phases match add up (a taller bar). Paths whose phases are opposite cancel out (the bar disappears). This adding-and-cancelling is called interference — the same thing waves of water, sound, and light do.
Interference: matching waves grow; opposite waves erase each other.
This is where quantum computing's shortcut lives. A quantum algorithm choreographs the phases so that wrong answers cancel themselves out and right answers pile up. The computer never "checks everything" — it lets the wrong paths erase each other.
# The cancel trick — interference you can watch: q = qubit spin q # open two paths (a blend) phase q # flip the hidden direction of the 1 part spin q # paths meet: 0s add, 1s cancel plot_state q # one bar stands; the other erased itself
phase q line
and run again. Same gates, different phases — the opposite bar wins.5Measurement: the blend becomes one answer
A measurement asks a qubit the question "0 or 1?" — and it always gets exactly one answer. Taller bars are likelier answers. After the measurement the blend is gone: the qubit now really is whatever it answered, and asking again just repeats that answer.
Careful with words: measurement does not "peek at an answer that was secretly there all along." Before the measurement there was a blend; the measurement produces one definite outcome from it. That is also why quantum randomness is genuine — it is not a pretend random number.
One measurement can never show you the amplitudes. To see the pattern hiding
in a blend, physicists repeat the experiment many times and count the outcomes — a
histogram. In Quave, histogram ..., shots: 200 does exactly what a real lab
does: run, measure, count, repeat.
q = qubit,
spin q, histogram q, shots: 1000. The counts settle near
half-and-half — that pattern is the blend showing itself.6Entanglement: a shared state
Entanglement happens when two qubits stop having separate states and share one state between them. In a famous entangled pair (a Bell pair), each qubit's answer alone is random — but compare the two answers, and they agree every single time. Not because they secretly decided in advance, and not because one messaged the other: the pair is one state.
Careful with words: entangled qubits are correlated, but you cannot use them to send a message — not even a slow one, and certainly not faster than light. The agreement only appears when the two results are brought together and compared.
An entangled qubit has no little state of its own — only the pair does. That
is why Quave always shows the whole system's bars: drawing separate bars for each qubit would
be a lie the moment you use link.
# A Bell pair — the same experiment real labs run: a = qubit b = qubit spin a # blend the first qubit link a, b # entangle: now ONE shared state histogram a, b, shots: 200 # random, but always agreeing
00 and
11 — never 01 or 10. Random and correlated at once.7Reading the notation
Physics has a shorthand for quantum states, and once you can read it, papers and books stop looking like magic runes. The funny bracket |0⟩ is called a ket (say: ket, like "kettle"). It just means "the state named inside." So |0⟩ = "the state 0", |1⟩ = "the state 1", and physicists write |ψ⟩ (the Greek letter psi) to mean "some state we are talking about."
How to read a state: each possibility gets a ket, and each ket gets an amplitude.
Amplitudes → chances. The chance of an outcome is its amplitude's size, squared. An amplitude of 0.71 gives a chance of 0.71 × 0.71 ≈ 0.5 — a fair coin. Squaring is also why a negative amplitude (phase flipped, like −0.71) gives the same chance on its own — the minus sign only matters when paths interfere (chapter 4).
Several qubits: write all the answers inside one ket: |00⟩, |01⟩, |10⟩, |11⟩. In Quave the first letter is the first qubit you made (q0 is the leftmost digit), so |10⟩ means "first qubit 1, second qubit 0". Three qubits → eight kets, |000⟩ to |111⟩ — each new qubit doubles the list. A Bell pair is written 0.71·|00⟩ + 0.71·|11⟩: only "both 0" and "both 1" have amplitude.
Circuit pictures: physicists also draw programs as circuit diagrams, and Quave's canvas uses the same symbols — each horizontal wire is one qubit, time flows left to right, a box on a wire is a gate, a dot connected to ⊕ is a linked (controlled) gate across two wires, and a little meter is a measurement.
Everything in Quave has a notation name: the amplitude bars plot one bar per ket, the bar height is the amplitude's size, and the bar colour is its phase. When you read 0.71·|00⟩ + 0.71·|11⟩, you can picture the exact two bars the Studio would draw.
plot_state — then read the bars out loud as
"0.71 ket zero-zero plus 0.71 ket one-one." You are speaking physics.8Thinking in quantum
Ordinary programs and quantum programs are shaped differently. Here is the same job — "find the right answer" — in both styles of thinking:
That is the one-sentence answer to chapter 1's question: the shortcut comes from interference — from arranging waves so the wrong answers erase themselves. A quantum programmer's real job is wave choreography.
This is also why quantum helps only for some problems: you need a structure the waves can exploit. For everyday jobs — games, documents, web pages — ordinary computers are and will remain the right tool. The famous myth "a quantum computer tries every answer at once" fails at step 3: a blend over every answer, measured, just returns one random answer. Without interference there is no advantage at all.
9What is it actually for?
Where scientists expect quantum computers to matter most:
Simulating nature. Molecules, materials, and chemical reactions are themselves quantum — blends, phases, entanglement and all. Ordinary computers choke on the exploding possibilities; a quantum computer speaks nature's own language. Designing medicines, batteries, and new materials is the most hoped-for use.
Certain math problems. A famous quantum recipe (Shor's algorithm) can, in principle, break the number-factoring locks that protect much of today's internet — which is why new "quantum-safe" locks are already being rolled out. Another (Grover's algorithm) speeds up searching through unstructured possibilities, though only modestly.
Those are the categories. Here are four stories — real scenarios where scientists are working to make quantum computing solve useful problems:
The medicine hunter designing new drugs by simulating molecules
A scientist wants a medicine that sticks to one bad protein in the body — like designing a key for a very complicated lock. To know if a candidate molecule will stick, she must work out how its electrons arrange themselves. But electrons follow quantum rules: their possibilities multiply so fast that even the world's biggest supercomputer can only approximate a medium-sized molecule, and the approximations sometimes point to the wrong key.
A quantum computer can hold that same blend of electron possibilities natively — its qubits play the role of the molecule's electrons. Instead of approximating nature, it imitates nature. Scientists could then test thousands of candidate keys in simulation and only build the most promising ones in a real lab — saving years.
Status: early demonstrations on tiny molecules exist; useful drug-sized simulations are still being worked toward.
The battery builder finding better materials for clean energy
Better batteries, better solar panels, and cheaper fertilizer all depend on the same question: "what happens, exactly, when these atoms meet?" One famous example: plants and certain bacteria turn air into fertilizer at ordinary temperatures using a molecule called nitrogenase — while our factories need enormous heat and pressure to do the same job, burning huge amounts of energy. Nobody fully knows the molecule's trick, because simulating it defeats ordinary computers.
A quantum computer could simulate that molecule's quantum blend directly and show chemists the trick. Crack it, and fertilizer — and, with similar simulations, battery and solar materials — could get dramatically cheaper and cleaner.
Status: one of the most-studied target problems in quantum computing research; not yet solved.
The code breaker & the lock maker why the internet is changing its locks
When you buy something online, your payment is protected by a math lock: multiplying two huge secret prime numbers is easy, but un-multiplying (factoring) the result would take an ordinary computer longer than the age of the universe. That one-way street is the lock.
Shor's algorithm shows that a big enough quantum computer could use interference to make the wrong factors cancel out and the right ones add up — opening the lock in hours instead of eons. No machine that big exists yet, but the mere recipe changed the world: mathematicians designed new "quantum-safe" locks that even a quantum computer cannot pick, and banks, browsers, and governments have already begun switching to them. A discovery about tomorrow's computers is re-locking today's internet.
Status: the algorithm is proven math; machines large enough to run it on real locks do not exist yet; the new locks are being rolled out now.
The secret keepers keys that reveal any eavesdropper
Two people want to share a secret key so no spy can read their messages. Quantum physics offers something no ordinary technology can: send the key as quantum states, and the rules you learned in this booklet stand guard. A spy who intercepts a qubit must measure it — and measurement disturbs the blend (chapter 5). Unknown quantum states cannot be copied either, so the spy cannot quietly duplicate the key and pass it along.
The two key-sharers compare a small sample of their results; if a spy peeked, the disturbance shows up as errors, and they simply throw that key away and try again. The laws of physics — not clever code — are what catch the spy.
Status: real and working today — quantum key links run in several cities and even via satellite. (This one uses quantum communication more than a quantum computer.)
And honestly: today's real quantum machines are small and noisy, and many claims in the news are overblown. A quantum computer is not faster at everything; it will not replace your laptop. It is a new kind of tool — a wave-choreography machine — for problems with the right shape.
When you read a quantum headline, ask the three honest questions: Does it use interference, or is it just called "quantum"? Is the speed-up proven or hoped for? And could an ordinary computer do the same with a better trick? Scientists ask exactly these.
10The "wow": decades on a supercomputer, minutes on a quantum one
You have heard the hype: "quantum computers will change everything!" Most grown-ups — honestly, most adults you will ever meet — could not tell you why. You are about to be able to. The stories in chapter 9 were the warm-up. This chapter is the main event: problems where the gap is not "a bit faster," but decades versus minutes — or impossible versus possible.
First, feel the explosion. Every qubit you add doubles the list of amplitudes a computer must keep track of. Doubling sounds tame. It is not:
The doubling staircase. Around 50 qubits, just storing the list defeats the biggest supercomputers. Around 280, there are more amplitudes than atoms in the visible universe.
An ordinary computer simulating a quantum system must store that whole list. At about 50 qubits the list outgrows the memory of the largest supercomputers on Earth. There is no clever upgrade that fixes this — the list simply does not fit in our universe once you go far enough. A quantum computer never stores the list, because its qubits are the list. That is the entire secret of the hype, in one sentence.
The molecule that will not fit impossible → possible
Chemists dream of exactly simulating the important molecules of life and industry — the fertilizer molecule from chapter 9, new battery chemistries, catalysts that could pull carbon from the air. Writing down the exact quantum state of one such molecule can take more numbers than every hard drive on Earth could hold, so today's supercomputers use rough approximations and sometimes get the answer wrong.
A quantum computer with enough good qubits holds that state natively — the molecule's blend lives in the machine. Published research estimates that simulations which are simply out of reach classically could run on a future error-corrected quantum computer in days or hours. This is not "faster"; it is crossing from can't to can.
Status: the target everyone is building toward; estimates come from published research and are pending physicist review.
The un-crackable lock, cracked longer than the universe's age → about a day
The math locks protecting the internet (chapter 9) are safe because factoring a modern-sized key with the best known ordinary methods would take the fastest supercomputers longer than the age of the universe. Shor's algorithm — proven math, not a hope — shows a large, error-corrected quantum computer could do it in roughly a day, according to published research estimates. Same problem, same physics, a billion-billion-fold different answer — because interference lets the wrong factors cancel themselves instead of being checked one by one.
Status: proven algorithm; no machine large enough exists yet; the estimate is from published research, pending physicist review.
The honest "maybe" pile hoped-for, not proven
You will also hear that quantum computers will optimize traffic, predict the weather, or supercharge AI. For most of these, a real quantum speed-up is hoped for but not proven — scientists are still checking whether the waves can actually exploit the problem's shape. A good scientist (that's you now) keeps two piles: "proven math" and "exciting maybe" — and never mixes them up.
Status: open research questions.
So what is Quave, then? Quave is not a quantum computer — it is a simulator: your ordinary computer honestly storing the full amplitude list, which is exactly why it stops at 12 qubits (4,096 amplitudes — easy for a laptop). But here is the wonderful part: the ideas are the same ideas. The cancel trick you run in the Studio is the same interference Shor's algorithm scales up. Your Bell pair is the same entanglement that guards quantum keys. You are practicing the real moves on a small stage — and the small stage is the only honest place to learn, because it is the one place the whole state can still be seen. The giants who build the big machines started by understanding exactly what you are looking at.
reg = qubits 12, spin a few, and plot_state. Now
imagine the bar chart doubling with every added qubit until it outgrows the planet. That
imagined chart is what a real quantum computer holds.11Inside a real quantum machine
What does a real quantum computer look like? Not a beige box. The most famous kind looks like a golden chandelier — layer after layer of gleaming discs and cables, hanging inside a canister the size of a person. The chandelier is actually a giant refrigerator working downward: each layer is colder than the one above, and the bottom plate — where the qubit chip lives — sits a few thousandths of a degree above absolute zero. Colder than outer space.
A cartoon of the "chandelier": a refrigerator in layers, with the qubit chip at the coldest point — colder than the space between the stars.
Why so cold? Because blends are shy. The tiniest nudge of heat, vibration, or stray radio noise acts like an accidental measurement and smears the blend away. Physicists call this decoherence — the quantum state losing its delicate phases to the noisy world. Everything strange about a real quantum machine — the cold, the vacuum, the shielding — is one long fight to give qubits a moment of perfect quiet.
What is a qubit made of? Different labs bet on different answers: tiny superconducting circuits (the chandelier machines), single atoms held in place by light (trapped ions and neutral atoms), and particles of light themselves. Each contender holds a blend, spins it with pulses, links pairs, and measures — exactly your five Qubble moves, built from metal, lasers, and cold.
Real qubits still make errors, so the field's great engineering quest is error correction: weaving many noisy physical qubits into one dependable "logical" qubit. You cannot fix errors by copying (unknown quantum states cannot be copied — chapter 8), so scientists invented cleverer tricks: spreading one qubit's information across an entangled team, so an error in any one place can be caught and undone without ever peeking at the secret itself. First demonstrations already work; scaling them up is the race you are watching in the news.
12Glossary: physics ↔ plain words ↔ Qubble
The words in this booklet are the real ones. Here is the map between physics language, plain language, and the Qubble words you type:
| Physics word | Plain words | In Qubble |
|---|---|---|
| qubit | the smallest quantum piece; can hold a blend of 0 and 1 | q = qubit |
| superposition | a blend of possibilities in one state | what spin / turn create |
| amplitude | the strength of one possibility (chance = size squared) | the height of a bar in plot_state |
| phase | the hidden direction of an amplitude | the bar's colour; flipped by phase |
| interference | matching waves add, opposite waves cancel | the cancel trick: spin · phase · spin |
| measurement | the blend produces one definite answer | measure, counted by histogram |
| entanglement | two qubits share one state; correlated, no messaging | link a, b |
| state vector | the full list of amplitudes of the whole system | the amplitude bars, all of them |
| gate | one move that changes the state | spin, flip, phase, turn, link |
| Hadamard gate (H) | the equal-blend maker | spin |
| X gate (NOT) | swap 0 and 1 | flip |
| Z gate | flip the phase of the 1 part | phase |
| rotation (Ry) | a partial spin, by an angle in degrees | turn q, by: 60 |
| CNOT (controlled-NOT) | flip the second qubit when the first is 1 — the entangler | link a, b |
| |0⟩, |1⟩, |ψ⟩ (ket) | "the state named inside the bracket" | the labels under the bars |
Every explanation on this page follows Quave's honesty rules (no "both at once", no faster-than-light stories, no "tries every answer at once") and is pending physicist review. Spot something confusing or wrong? Tell a teacher or parent to write to SenSym.