← All articles

What is a qubit, really?

On this page

1. Bits are everywhere, and they're simple on purpose
2. An analogy: the coin on the table, and the coin in the air
3. A better picture: the dimmer switch
4. Where the analogies break
5. So why not just read all the answers?
6. What is a qubit, physically?
7. One qubit is a toy. Many qubits are something else.
8. Try it yourself
9. Common questions
10. Why this matters outside the lab
11. Sources and further reading

Every computer you've ever used stores information in bits. A bit is a tiny switch that is either off or on, and we write those two states as 0 and 1. Your photos, your bank balance, this sentence and the video you watched last night are all, underneath, very long strings of zeros and ones.

A quantum computer uses qubits instead. A qubit also gives you a 0 or a 1 when you check it. The difference is what it's doing before you check, and that difference is the whole story of quantum computing. This piece builds the idea slowly, with no maths beyond multiplying two small numbers.

Bits are everywhere, and they're simple on purpose

A bit is useful precisely because it's boring. A light switch is on or off. A transistor in your phone's chip lets current through or it doesn't. Because there are only two options, a bit is easy to read reliably and hard to get wrong, even when billions of them are switching every second.

Put eight bits together and you have a byte, which can stand for one letter on your keyboard. Put a few million together and you have a photo. Ordinary computers get their power from sheer numbers of bits and from flipping them incredibly fast. Each individual bit, though, only ever holds one value at a time.

An analogy: the coin on the table, and the coin in the air

Picture a coin lying on a table. It's heads or tails, and you can look whenever you like without changing it. That's a normal bit.

Now flip the coin and freeze it mid-spin. It isn't heads, and it isn't tails yet. It's in a state that will become one or the other when it lands. A qubit is a bit like that spinning coin. Physicists call this state superposition, and it's the first of two ideas you need to understand quantum computing. (The second, entanglement, gets its own piece in Part 3.)

1Ordinary bit
Always 0 or 1

?Qubit
A blend until measured

A better picture: the dimmer switch

The spinning coin has a weakness: it suggests 50/50 every time. A qubit doesn't have to be an even blend. A better everyday picture is a dimmer switch instead of an on/off switch.

Imagine a dimmer that can sit anywhere from fully off to fully on. Now add a strange rule: the moment anyone looks at the light, it snaps to either fully off or fully on. Where the dimmer was set decides the odds. Set it near "on" and you'll usually see the light on. Set it in the middle and it's a fair coin toss. Set it near "off" and you'll usually see it off.

That's much closer to a real qubit. Its setting can be anywhere in between, and that setting controls the chances of each answer when you finally measure it.

Where the analogies break

Analogies are useful until they aren't, and both the coin and the dimmer fall short in important ways. A spinning coin is an ordinary object: at every moment it has a definite position, and we simply can't predict how it will land. The dimmer suggests a qubit is a thing sitting part-way between 0 and 1. Neither picture is right. A qubit has a quantum state with properties no coin or dimmer can reproduce.

What quantum mechanics says, in practice, is this: before you measure a qubit, the theory doesn't give it a definite result. It gives you only the odds of each result. What, if anything, is "really" happening before the measurement is a question physicists still debate, and you'll meet several competing interpretations if you read further. They all make the same predictions, which is what matters for building and using quantum computers.

The state of a qubit is described by two numbers called amplitudes, one attached to 0 and one attached to 1. Amplitudes aren't probabilities. Each has a size and also a kind of direction, called its phase. Phase can't be seen in a single measurement, but it matters a great deal when amplitudes combine. You get the chance of each result by squaring the size of its amplitude. If both amplitudes are about 0.71, then 0.71 × 0.71 ≈ 0.5, so each answer has a 50% chance. If the amplitudes are 0.6 and 0.8, then the chances are 0.36 and 0.64, so you'd read 1 about 64% of the time.

Here's the part no coin or dimmer can show you. Amplitudes behave like waves. They can add together and make an outcome more likely, or cancel out and make it less likely. That cancelling, called interference, is the real source of quantum computing's power. Part 2 walks through it with a worked example.

The honest version: a qubit is a blend of 0 and 1 with a weighting you can steer. When you measure it, the blend collapses to one answer, with odds set by that weighting.

So why not just read all the answers?

Because you can't. When you measure a qubit you get one result, 0 or 1, and the blend is gone. Measure it again in the same way and you get the same answer; the original blend doesn't come back. (Measure it in a different way, which quantum computers can do, and you may get a fresh random result. Either way, the information in the original blend is gone.) You never see the whole spread of possibilities directly.

That's why the popular line "a quantum computer tries every answer at once" misleads people. If it simply held every answer and handed you a random one, it would be no better than guessing. A good quantum algorithm is closer to choreography. It sets up the amplitudes so that paths leading to wrong answers cancel each other out and paths leading to the right answer reinforce. Then a measurement is likely to land on something useful.

What is a qubit, physically?

A bit in your laptop is a tiny transistor. A qubit can be built from several very different things, and companies are betting on different ones:

• Superconducting circuits: tiny loops of metal chilled to a fraction of a degree above absolute zero, colder than outer space. IBM and Google use these.
• Trapped ions: individual charged atoms held in place by electric fields inside a vacuum and controlled with lasers.
• Neutral atoms: uncharged atoms arranged in grids by focused laser beams.
• Photons: particles of light travelling through specially designed chips.

They all share one headache: qubits are extremely delicate. Heat, vibration or a stray electrical signal can knock them out of their in-between state before a calculation finishes. That fragility is the biggest engineering problem in the field, and it has its own article in the library.

One qubit is a toy. Many qubits are something else.

A single qubit isn't very powerful. The interesting part starts when you have several. Two qubits together have four possible results (00, 01, 10, 11), and the pair carries an amplitude for each one. Three qubits carry eight. Every extra qubit doubles the count.

That doubling grows faster than intuition can follow. Fifty qubits carry about a thousand million million amplitudes. Three hundred carry more than there are atoms in the observable universe. Writing down every one of those numbers for an arbitrary 300-qubit state is far beyond any ordinary computer. Ordinary computers can take shortcuts for some kinds of quantum states, especially ones with little entanglement, so the real difficulty depends on the calculation, not just the qubit count. Still, this is one reason quantum machines can, in principle, do things ordinary ones can't.

The catch from earlier still applies. You can only read out one result at the end. All that capacity is only useful if an algorithm steers it, through interference, toward an answer worth reading.

Try it yourself

The small demo on the home page lets you set the weighting on a single qubit and measure it. One measurement tells you almost nothing. A hundred measurements show you the weighting you chose. That's how researchers learn what a quantum computer actually did: they run the same calculation many times and look at the pattern of results, not at any single answer.

Common questions

Is a qubit "0 and 1 at the same time"? It's a fair shorthand, but it's incomplete. A better way to put it: a qubit in superposition has a definite description, its amplitudes, but not a definite value. The "and" lives in the amplitudes, not in the qubit secretly being two things. "At the same time" makes it sound like two ordinary bits glued together, which it isn't.

Will qubits replace the bits in my phone? No. Quantum computers are specialists for a narrow set of hard problems. Everyday computing stays on ordinary bits, which are cheaper, faster for normal tasks and far more reliable.

Can I use a real qubit? Yes. Several companies, including IBM, let anyone run small programs on real quantum hardware over the internet for free. You don't need to understand the maths to try a basic example.

Why this matters outside the lab

Put enough good qubits together and steer them carefully, and certain specific problems should become practical that are out of reach for ordinary computers. The best-known example is Shor's algorithm for factoring very large numbers. Running it at a useful scale needs a large, error-corrected quantum computer that doesn't exist yet. If one is built, it would break the maths that protects most of today's online banking and messaging. That's why banks and governments are paying attention long before a large quantum computer exists. We'll get there in Part 5. First, Part 2 looks at superposition and interference more closely.

Sources and further reading

Tags show what kind of source each one is. A standard or government guidance is an official document; a peer-reviewed paper has been checked by other experts; a preprint has not been peer-reviewed yet; an experiment reports a real-world demonstration; a company announcement is the company's own account. Dates and figures were checked against these sources on 11 October 2026. Spotted an error? Email hello@plainquantum.com and it will be corrected, with a note.

1. BookQuantum Computation and Quantum Information (10th anniversary edition)Michael Nielsen and Isaac Chuang, Cambridge University Press, 2010
2. BookProgramming Quantum ComputersEric Johnston, Nic Harrigan and Mercedes Gimeno-Segovia, O'Reilly, 2019
3. CourseBasics of quantum information (free course)IBM Quantum Learning
4. Peer-reviewed paperPolynomial-time algorithms for prime factorization and discrete logarithms on a quantum computerPeter Shor, SIAM Journal on Computing, 1997
5. Peer-reviewed paperQuantum Computing in the NISQ era and beyondJohn Preskill, Quantum, 2018