Qubits & Superposition
A qubit is the heart of quantum computing. It's like a classical bit — but with a superpower. Understanding qubits and superposition is the single most important step in learning quantum computing. Let's break it down.
What is a Qubit?
In classical computing, a bit is the smallest unit of information. It's either 0 or 1 — like a light switch that's either off or on.
A qubit (quantum bit) is the quantum equivalent. The key difference: a qubit can be 0, 1, or any combination of both at the same time — until you measure it.
Physical implementations of qubits
Unlike classical bits (transistors), qubits use quantum particles. Different companies use different physical systems:
- Superconducting circuits — Used by IBM and Google. Tiny loops of superconducting wire cooled to near absolute zero.
- Trapped ions — Used by IonQ and Honeywell. Individual atoms held in place by electromagnetic fields.
- Photons — Particles of light. Used by PsiQuantum and others.
- Topological qubits — Microsoft's approach. More stable but harder to build.
What is Superposition?
Superposition is the quantum property that allows a qubit to exist in multiple states simultaneously. Mathematically, a qubit's state is described as:
Where:
- |0⟩ and |1⟩ are the two possible measurement outcomes (read as "ket zero" and "ket one")
- α and β are complex numbers called amplitudes — they describe the probability of measuring 0 or 1
- The rule: |α|² + |β|² = 1 (probabilities must add up to 100%)
Don't worry if the math looks scary. Here's what it means in plain English: before you measure the qubit, it exists as a blend of 0 and 1, with some probability of collapsing to each when measured.
Why superposition gives quantum computers power
With n classical bits, you can represent exactly 1 number (one specific combination of 0s and 1s). With n qubits in superposition, you're working with all 2ⁿ possible combinations simultaneously. This is quantum parallelism — not that the computer runs 2ⁿ calculations in parallel, but that its state encodes all possibilities at once.
Interactive: Qubit State Visualizer
Drag the slider to set the probability of measuring |0⟩. Watch how the qubit state changes.
This is called an "equal superposition" — the qubit has a 50/50 chance of collapsing to 0 or 1 when measured. This is what the Hadamard gate creates.
What Happens When You Measure a Qubit?
Here's where quantum computing gets philosophically wild: measuring a qubit destroys its superposition. The moment you observe (measure) a qubit, it "collapses" from its blend of states into a definite 0 or 1 — based on the probabilities encoded in α and β.
After measurement, the qubit is stuck at that value. You can't un-measure it. This is why quantum algorithms must be cleverly designed to extract the answer without prematurely collapsing the superposition.
Multiple Qubits: Exponential Power
The real power of qubits emerges when you combine them. Here's why:
- 1 qubit: 2 states (|0⟩ or |1⟩)
- 2 qubits: 4 states (|00⟩, |01⟩, |10⟩, |11⟩)
- 3 qubits: 8 states
- 10 qubits: 1,024 states
- 50 qubits: over 1 quadrillion states — more than any classical computer can track
- 300 qubits: more states than atoms in the observable universe
And a quantum computer in superposition can work with all of these states at once. That's why even a relatively small quantum computer can tackle problems that would take a classical computer billions of years.
Frequently Asked Questions
Is superposition just a fancy word for randomness?
No — it's deeper than randomness. A random coin flip doesn't care about interference patterns. Superposition is a real physical wave-like state that can interfere with itself, which is what quantum algorithms exploit. Randomness is just unpredictability; superposition is a genuine physical superimposition of states.
Can a qubit hold multiple values forever?
No. Qubits are extremely fragile. Their superposition state breaks down due to interaction with the environment — a process called decoherence. Modern quantum computers can only maintain superposition for microseconds to milliseconds, which is one of the key engineering challenges.
Does quantum computing use the same transistors as classical chips?
No. Quantum bits are implemented using physical quantum systems — not transistors. IBM uses superconducting circuits cooled to temperatures colder than outer space. The engineering required is extremely complex.
Why can't we just simulate a quantum computer classically?
Because the state of n qubits requires 2ⁿ complex numbers to describe. Simulating just 50 qubits requires storing over 1 quadrillion numbers — beyond the memory of any classical computer. This is exactly why quantum computers are so powerful for these types of problems.
Frequently Asked Questions
What will I learn here?
This page covers the core concepts and techniques you need to understand the topic and progress confidently to the next lesson.
How should I use this page?
Start with the overview, then follow the section links to deepen your understanding. Use the table of contents on the right to jump to specific sections.
What should I read next?
Use the navigation below to continue to the next lesson or explore related topics.