🏠 Home 📘 Track 1: Quantum Basics L08 — The Bloch Sphere L09 — Multiple Qubits L10 — Interference
L09 §2 · Meet the Qubit ~15 min

Multiple Qubits — The Exponential Leap

One qubit lives on a sphere. Add a second — and instead of two spheres, you get something fundamentally richer: a state space that doubles with every qubit you add, exploding beyond anything classical hardware can track.

✦ One Idea n qubits don't represent 2ⁿ states one at a time — they hold all 2ⁿ states simultaneously, and this exponential growth is the engine that makes quantum computers capable of things classical computers never can be.
multiple qubits exponential state space 2ⁿ states tensor product entanglement preview no math required
Section 01
① Hook

The Multiplication Problem

🧮
Think before reading on
You know one qubit can be in superposition. What about two?

A classical computer with 3 bits can be in exactly one of 8 states at any moment. A quantum computer with 3 qubits in superposition can hold how many states simultaneously?

L08 showed you the Bloch sphere — a complete map of a single qubit's state. Every point on that sphere is a different quantum state. That is already infinitely richer than a classical bit.

But quantum computing's real power does not come from one qubit. It comes from what happens when you combine them. And what happens is not what you expect.

With classical bits, combining them is straightforward: 3 bits give you 8 possible configurations, and your computer is in exactly one of them at any time. The states add up neatly — one combination, chosen, fixed.

With qubits, the rules change fundamentally. Combining qubits does not add their state spaces — it multiplies them. Two qubits give 4 simultaneous states. Three give 8. Ten give 1,024. Fifty give over a quadrillion. Each qubit you add doubles the entire state space — and a quantum computer in superposition inhabits all of them at once.

🔑
The fundamental asymmetry
A classical computer with n bits stores one number between 0 and 2ⁿ−1. A quantum computer with n qubits in superposition holds all 2ⁿ numbers simultaneously — each with its own amplitude. This is not a matter of running faster. It is a completely different relationship between the hardware and information.
Section 02
② Intuition

Two Analogies for Exponential Growth

The library — one book vs all books open

📚 Analogy — The Library
A classical computer is like a reader in a library who can have exactly one book open at a time. To find an answer buried in one of a million books, they must open each book in sequence — one, then the next, then the next. A million books means at least a million steps.

A quantum computer is like every book in the library being open simultaneously, every page visible at once. The information in all million books is available in a single moment. With the right algorithm, you can extract the answer you need without reading every book individually.

The catch: you cannot simply read all the books at once. Measurement — the act of extracting an answer — collapses everything to a single book. The art of quantum algorithms is preparing the superposition so that when you look, the right book is overwhelmingly likely to appear.

The chessboard — exponential doubling

♟ Analogy — Grains of Rice on a Chessboard
There is an old story about a king who agreed to reward a chess inventor with rice: one grain on the first square, two on the second, four on the third, doubling each time. The king laughed — until his advisors calculated the total. By square 64, the pile would weigh more than all the rice ever grown in human history.

This is the power of doubling. It feels modest at first — 1, 2, 4, 8, 16 — but by the time you reach 50 doublings, you are at over a quadrillion.

Each qubit you add is one more square on the chessboard. The state space doubles. At 10 qubits you have 1,024 states. At 30 qubits you have over a billion. At 50 qubits you have more states than there are stars in the observable universe. At 300 qubits, more states than there are atoms in it.
Section 03
③ Framework

The State Table — From 1 to n Qubits

Let's make the doubling concrete. The table below shows exactly how the state space grows and what each level means.

Qubits (n)Simultaneous states (2ⁿ)Classical bits can storeMilestone
121 of 2Single qubit — superposition of |0⟩ and |1⟩
241 of 4First entanglement possible — Bell pairs
381 of 8Smallest meaningful quantum register
101,0241 of 1,024State of a simple quantum circuit
301,073,741,8241 of ~1 billionNeeds 4 GB RAM to simulate classically
50~1.1 × 10¹⁵Impossible to storeBeyond any classical supercomputer
300~10⁹⁰More than atoms in universeTheoretical max — entire universe as RAM

The four two-qubit basis states

With two qubits, there are four possible definite outcomes when you measure. In superposition, a two-qubit system holds all four simultaneously — each with its own amplitude.

|00⟩
Qubit 1 = 0, Qubit 2 = 0
Both qubits measured as 0. The "all-zeros" state.
|01⟩
Qubit 1 = 0, Qubit 2 = 1
First qubit 0, second qubit 1.
|10⟩
Qubit 1 = 1, Qubit 2 = 0
First qubit 1, second qubit 0.
|11⟩
Qubit 1 = 1, Qubit 2 = 1
Both qubits measured as 1. The "all-ones" state.

A two-qubit quantum computer in full superposition holds |00⟩, |01⟩, |10⟩, and |11⟩ all at the same time — each with its own independently controllable amplitude. Measuring collapses the entire system to one of these four outcomes instantaneously.

📐
Why it multiplies rather than adds — the tensor product
When you combine two systems, their state spaces are joined by an operation called the tensor product (written ⊗). Two qubits with 2 states each gives 2 × 2 = 4 combined states. Three qubits: 2 × 2 × 2 = 8. The tensor product is why the state space explodes rather than accumulates. Track 2 gives the full mathematical treatment. For now, the key insight is simply that combining quantum systems multiplies their state spaces.
Section 04
④ Theory

Why This Changes Everything

L03 introduced the exponential wall — the observation that some problems grow so fast that no classical computer built from any amount of hardware could ever solve them in a useful time. The number of states to search grows as 2ⁿ, and classical hardware can only explore them one at a time.

The exponential state space of multiple qubits is the direct answer to that wall. A quantum computer does not explore those 2ⁿ states sequentially — it holds them all at once and, with the right algorithm, processes them in parallel.

Classical Computer
🚶
Explores states one at a time
With n bits, it can be in exactly one of 2ⁿ states. Searching all states requires 2ⁿ steps. Adding one more bit doubles the work required.
Quantum Computer
🌐
Holds all 2ⁿ states simultaneously
With n qubits in superposition, all 2ⁿ states coexist with independent amplitudes. Adding one qubit doubles the parallel state space, not the work.

Not all multi-qubit states are independent — entanglement

There is something even more powerful lurking here. Not all two-qubit states can be written as a simple combination of two independent single-qubit states. Some two-qubit states are entangled — they are genuinely joint states of the system, with no way to separate qubit 1 from qubit 2.

In an entangled state, measuring one qubit instantly determines the outcome of measuring the other — regardless of the distance between them. This is what Einstein called "spooky action at a distance." It is real, experimentally confirmed, and it gives quantum computers coordination capabilities that go far beyond what independent qubits could provide.

🔮
Simulating quantum systems is the original motivation
In 1982, Richard Feynman asked: why is it so hard to simulate physics on classical computers? His answer: because quantum systems with n particles live in a 2ⁿ-dimensional state space, and classical computers cannot track exponentially many amplitudes. His proposed solution: build a computer that is itself quantum, and use superposition to simulate superposition. The exponential growth that makes quantum systems hard to simulate classically is exactly what makes quantum computers powerful. The problem and the solution are the same phenomenon.
⚠️
Superposition alone is still not enough
Holding 2ⁿ states at once is only the beginning. Measuring immediately gives a random answer — useless without structure. The exponential state space is the raw material. Interference shapes it. Entanglement links qubits. Algorithms engineer the amplitudes so that when you finally measure, the right answer has an overwhelming probability. All three ingredients together are what make quantum computation powerful.
Section 05
⑤ Interactive

State Space Explorer

Drag the slider to add qubits one at a time. Watch the state space double with every qubit added — each glowing square is one simultaneous state the quantum computer holds right now. Compare to the classical row, which can only ever light one square. Then press Measure to collapse everything to a single outcome.

Live Simulator · L09
Quantum vs Classical State Space
Each qubit doubles the state space · Measure collapses all states to one
Number of qubits 3
12345 678910
8
Quantum: simultaneous states
1
Classical: states at once
8×
Quantum advantage ratio
⚡ Quantum — all states active simultaneously 8 states · 3 qubits in superposition
💻 Classical — one state at a time 8 possible states · only 1 active
🔬 Three experiments
1. Feel the doubling: Start at 1 qubit and drag slowly to 10. Count how the quantum grid grows: 2, 4, 8, 16… Each step doubles. At 10 qubits you have 1,024 simultaneous states — the classical row still shows just 1.

2. Measure and collapse: Set any number of qubits, press Measure. All the glowing states collapse to a single one — highlighted amber. That is the Born Rule applied to a many-qubit system. Run again to get a different (random) outcome. Individual results are unpredictable; the superposition is gone the moment you look.

3. The classical impossibility: At 10 qubits the quantum grid has 1,024 cells. To simulate this on a classical computer, you would need to track 1,024 amplitudes — one per cell. At 30 qubits that is over a billion. At 50, classical simulation becomes physically impossible. The simulator stops at 10 for exactly this reason.
Quick Check
Lesson Summary

What You Now Know About Multiple Qubits

  • ⚡
    n qubits hold 2ⁿ states simultaneously — not one at a time
    Each qubit added doubles the entire state space. Classical bits store one configuration from 2ⁿ options. Qubits in superposition hold all 2ⁿ at once, with independent amplitudes for each.
  • ♟
    The growth is exponential — and quickly becomes astronomical
    30 qubits hold over a billion states. 50 qubits surpass any classical supercomputer. 300 qubits hold more states than there are atoms in the observable universe. This is the direct answer to the exponential wall from L03.
  • 🔗
    Not all multi-qubit states are independent — entanglement exists
    Some two-qubit states cannot be separated into individual qubit states. These entangled states give quantum computers coordination capabilities with no classical equivalent. Entanglement is coming in L12.
  • 🎯
    The state space is the raw material — interference sculpts it
    Holding 2ⁿ states is only useful if you can steer the measurement toward the right answer. Interference — coming in L10 — is the mechanism that amplifies correct answers and cancels wrong ones from this vast superposition.
How clearly did the exponential state space land?

You have the state space — vast, parallel, exponential.
But measuring it just gives random noise.
What steers the probability toward the right answer?

→ Interference — L10
Sources & Further Reading
← Previous
The Bloch Sphere
L08 — A map of all single-qubit states
← → navigate lessons · Space = mark complete