Reading a qubit forces it to pick 0 or 1, with probability equal to the square of the corresponding amplitude — and destroys the superposition in the process.
Why it matters
Measurement is the bottleneck of quantum computing. You can hold an enormous superposition, but you only ever get a handful of classical bits out. Every quantum algorithm is really a scheme for concentrating amplitude onto the answer before you look.
After this you will be able to
When you measure a qubit you get one classical bit, with probability equal to the amplitude squared. Afterwards the qubit is simply in the state you measured — the other amplitude is gone forever. You cannot measure it again to learn more.
Like developing a photograph. Once you have the print, the latent image on the film is spent — you cannot go back and develop it differently to get a different picture.
A conscious observer is needed to collapse the state.
Any irreversible interaction with the environment does it. A stray photon works exactly as well as a physicist — which is precisely why decoherence is such a difficult engineering problem.
From n qubits, one run gives you n classical bits. That is the fundamental bottleneck every quantum algorithm has to design around, and it is why algorithms are run thousands of times.
There is no machine that takes an arbitrary unknown qubit and produces two identical copies of it. The proof takes about three lines and follows directly from the fact that quantum operations are linear.
Every backup tool you have ever used relies on being able to read the original without changing it. That fundamental operation simply does not exist for quantum information.
No-cloning means you can never duplicate quantum information.
You can copy a state you already know how to prepare — just prepare it twice. What is impossible is copying an unknown state handed to you.
This single fact explains three things at once: why quantum key distribution is secure, why teleportation must destroy the original, and why classical error-correction-by-repetition does not transfer to qubits.
Hand-picked and ordered. If you only have time for one, take the first.
The single best starting point in existence. An essay built on spaced-repetition flashcards embedded in the text, so you actually remember it a month later. Assumes nothing but curiosity, and gets you honestly to quantum teleportation.
A rigorous but genuinely well-taught course by John Watrous covering single systems, multiple systems, quantum circuits and the core protocols. The cleanest bridge from intuition to real notation.
Optional but clarifying. Quantum computing does not require a physics course, but if you want to know where the postulates come from rather than accepting them, start here.
You cannot copy an unknown quantum state. The one-line proof is genuinely accessible, and this single fact explains teleportation, QKD security and why error correction is hard.
A drag-and-drop optical table in the browser — lasers, beam splitters, polarisers — that lets you build interference and Bell-test experiments and see the physics rather than the algebra.
Self-paced programming exercises with automatic verification, in the style of code katas. Superposition, measurement, oracles, Grover and teleportation, each as a set of puzzles you must actually solve.
Topics that list Measurement & collapse as a prerequisite.
Two or more qubits sharing a single joint state, so that their measurement results are correlated in ways no classical shared-secret arrangement can reproduce — even though neither qubit has a definite state of its own.
BeginnerA protocol for two parties to agree on a shared secret key such that any eavesdropper necessarily disturbs the transmission and is detected — security resting on physics rather than on computational hardness.
Intermediate