Measurement and the Born Rule in Plain Terms

Updated 2026-10-11 | 4 min read | QUANTUM (QNT) community

The one rule that connects the math to the lab

A quantum computer carries information in amplitudes, numbers that describe a state. But nobody can read amplitudes directly. When you look, you get a plain old bit. The bridge between the hidden amplitudes and the visible bit is called the Born rule, after the physicist Max Born, who proposed it in 1926. If you only remember one rule in quantum computing, this is a strong candidate.

The rule

Say a qubit is described by two amplitudes, one attached to the result 0 and one to the result 1. The Born rule says:

• The chance of getting 0 is the amplitude for 0, squared in size.
• The chance of getting 1 is the amplitude for 1, squared in size.
• These two chances always add up to 1, which is why the amplitudes are kept normalized.

A worked number

Suppose the amplitudes are 0.8 for the result 0 and 0.6 for the result 1. Squaring gives 0.64 and 0.36. So on each measurement you get 0 with probability 64 percent and 1 with probability 36 percent. Check: 0.64 plus 0.36 is exactly 1. Now take an even blend with amplitudes of about 0.707 each: the squares are 0.5 each, a fair coin. A state sitting on the equator of the Bloch sphere behaves like that.

Amplitudes can be negative or even complex, but the squared size is always a positive chance. That is why a plus and a minus blend look identical when measured in the 0/1 basis: the signs vanish when squared.

A coin analogy, with a catch

The amplitudes act like a weighted coin, and the Born rule says how the weighting works. The catch is that an ordinary weighted coin already has a hidden fixed side before you look, you just do not know it. Experiments on Bell inequalities show that quantum results cannot all be explained that way, which is why the quantum case is stranger than a weighted coin.

What happens to the state

After you measure and see 0, the qubit is left in the state 0. Measure it again and you get 0 again, every time. This is often called collapse, though how to interpret it is still debated, and different interpretations (Copenhagen, many-worlds, and others) make the same predictions. For computing, the practical meaning is simple: measuring ends the superposition, and you only learn one run's answer.

Why this shapes algorithm design

A quantum computation is useless if the final state is spread across many answers and you just sample one at random. The art of algorithms is to use interference so the amplitudes of wrong answers cancel and the right answer ends up with most of the squared weight. After that, one measurement, or a handful of repeated runs, reveals it. This is the idea behind Shor's algorithm and Grover's search, and it is why the correct framing is not "trying every answer at once".

Shots

Because each run gives one sample, quantum programs are run many times. Each run is called a shot. To estimate the 64/36 split in the example above, you might run a few thousand shots and count. The more shots, the tighter the estimate, in the same way a coin's bias becomes clearer the more times you flip it. The results of a real device also carry errors, covered in decoherence and noise.

Measuring in a different basis

You can choose what question to ask. Measuring in the plus/minus basis asks "is it plus or minus?" instead of "is it 0 or 1?" In practice this is done by first applying a gate such as the Hadamard (see the gate examples) and then measuring in the usual basis. A state that is a 50/50 coin in one basis can be completely certain in another. That is the geometry of the Bloch sphere at work.

Common misunderstandings

• "Measurement needs a conscious observer." No. Any interaction that records the result in the environment counts. A detector or a stray atom can do it.
• "The amplitude itself is the probability." The probability is the amplitude squared in size. Amplitudes can be negative or complex.
• "A quantum computer returns all the amplitudes." You get one bit string per shot. Reading out all amplitudes of many qubits would take an enormous number of runs.
• "Randomness means the machine is faulty." The randomness is built into the physics and is expected. It is only a problem when the answer should have been certain.

Sources and further reading

• Stanford Encyclopedia of Philosophy: Measurement in quantum theory
• IBM Quantum Learning (successor to the Qiskit textbook)
• Nielsen and Chuang, Quantum Computation and Quantum Information (Cambridge University Press)

Standard textbook physics, reported as of 2026-10-09. Nothing here is financial advice. The QNT memecoin is independent of Quantinuum Ltd, the real company, and of every lab, university and prize body named on this page.

Frequently asked questions

Share on X

Keep reading

• Superposition Explained in Plain English
  Superposition lets a qubit hold a blend of 0 and 1. Here is what it really means, what it does not mean, and why it matters.
• What Is a Qubit? Superposition and Measurement Explained
  A qubit is the basic unit of a quantum computer. Learn how qubits work, how they are built, and why they are fragile.
• The Bloch Sphere Explained: How to Picture a Qubit
  The Bloch sphere is a globe that shows every possible state of one qubit. Here is how to read it, with simple analogies and common mistakes.
• Why Quantum Computers Do Not Try Every Answer at Once
  The popular line that quantum computers try every answer at once is wrong. Here is what really happens: interference, measurement and why speedups are rare.

All Quantum computing guides | Back to top | Search the site

Main pages: Quantum computing explained | Quantum and crypto | Companies | Quantum news | Glossary