🏠 Home 📘 Track 1: Quantum Basics L02 — Classical Computers L03 — Why Something Different? L04 — The Qubit
L03 §1 · Why Quantum? ~15 min

Why We Need Something Different

Classical computers are extraordinary. But certain problems defeat them completely — not because of weak hardware, but because of mathematics itself.

✦ One Idea Some problems grow so explosively that no classical computer — no matter how fast — will ever solve them. The gap is not an engineering problem. It is a mathematical wall.
exponential complexity cryptography molecular simulation classical limits no math required
Section 01
① Hook

Is There Actually a Problem?

🎯
Before we start — what do you think?
Trust your gut. There's no wrong answer yet.

Classical computers get faster every year. Given enough time and hardware, couldn't they eventually solve any problem? What's the real limit?

Before we talk about limits, give credit where it's due. The classical computer in your pocket is the most sophisticated tool in human history. It runs on the same on/off switches you saw in L02 — billions of them, orchestrated with breathtaking precision.

So the question is real: if classical computers are this good, what problem could they possibly have?

Section 02
② Intuition

What Classical Computers Do Brilliantly

🌦️
Weather Forecasting
Simulates the entire atmosphere in minutes — saving thousands of lives per year
🧠
AI & Deep Learning
Trains billion-parameter models on terabytes of data — GPT, AlphaFold, Stable Diffusion
🎬
Real-time 3D Rendering
Traces billions of light rays per second to generate movie-quality images at 60fps
🔐
Encryption
Secures every bank transfer, password, and private message on the internet in real time
🚀
Space Navigation
Guides rockets to Mars with centimetre precision across 300 million kilometres
💊
Drug Discovery
Simulates small molecules to screen thousands of drug candidates per day

All of that — using nothing but billions of on/off switches running NOT, AND, and OR gates, one step at a time. Classical computers are genuinely extraordinary at problems where more data means a bit more time.

What classical does well
Fast, exact, predictable
Tasks where the number of steps grows slowly — linearly or polynomially — with the size of the input. More data → a bit more time. Totally manageable.
Examples: sorting, searching, encryption, rendering, AI inference
Where it breaks down
Exponential explosions
Tasks where the number of steps doubles — or worse — each time you add one more unit of input. More data → impossibly more time.
Examples: factoring large numbers, molecular simulation, combinatorial optimisation
🔑
The Catch
For many important problems, even the smartest algorithms still have to check possibilities one by one. When the number of possibilities grows exponentially, time explodes past billions of years — no matter how fast the hardware gets. A billion-times faster classical computer is still hopelessly stuck.
Section 03
③ Framework

Where They Hit a Wall

These aren't edge cases. They are some of the most consequential problems in science, security, medicine, and industry — and classical computers are fundamentally blocked on all of them.

🔓
Breaking Codes — Cryptography
ClassicalFactoring a 2048-bit RSA key takes longer than the age of the universe on the best known algorithms. Every bank, hospital, and government relies on this being hard.
💥 Today's entire internet security depends on factoring being impossible in practice.
🧬
Designing New Medicines — Molecular Simulation
ClassicalSimulating a molecule with n electrons requires 2ⁿ numbers. Even caffeine (74 electrons) is at the edge of what's possible for the world's fastest supercomputers.
💊 Blocking progress on cancer, Alzheimer's, antibiotic resistance — right now.
📦
Optimizing Everything — Logistics & Finance
ClassicalFinding the optimal route for 50 cities: roughly 3 × 10⁶⁴ possible orderings. Best algorithms give approximations — never guarantees. The search space is simply too large.
🚚 Billions lost annually to suboptimal supply chains, portfolios, and logistics decisions.
⚛️
Simulating Quantum Systems — Physics Itself
ClassicalSimulating n quantum particles requires storing 2ⁿ amplitudes. At ~50 particles, even the world's best supercomputers are overwhelmed. Feynman saw this in 1981.
🔬 Blocking room-temperature superconductors, solar cells, and fusion energy research.
⚠️
These Are Not Engineering Failures
These problems aren't slow because computers are weak. They are fundamentally exponential — classical computers will never solve them efficiently, no matter how fast the hardware gets. Moore's Law cannot save you from exponential complexity. This is a math problem, not a hardware problem.
💊
Real story — 2025
A team at a major pharmaceutical company spent 18 months and $40 million simulating one small protein on the world's fastest supercomputer — only to get an approximate result. The molecule had too many electrons. One state at a time was never going to be enough.
Section 04
④ Theory

The Root Cause — One State at a Time

All those problems share a single root cause. There is one fundamental constraint at the heart of classical computing, and everything else follows from it.

The Classical Ceiling

🖥️
Classical
1 path
at a time
vs
❓
Something else?
many paths
at once

One state at a time.
That single limit turns many of tomorrow's most important problems into today's impossibilities.

When you have n bits, there are 2ⁿ possible states. A classical computer picks one and checks it. Then picks another. Then another. If the problem requires searching through many states to find the answer — and no shortcut exists — you are stuck searching sequentially through an exponentially large space.

Watch what that looks like in practice:

Classical — 4 bits
0
0
0
0
Always exactly one of 16 possible states. Must check the others one by one.
→
What if…?
?
?
?
?
What if all 16 states could be active simultaneously — processed in one step?
📐
Exponential is different in kind, not just degree
At n = 300, the number 2³⁰⁰ exceeds the number of atoms in the observable universe. No engineering improvement — not a million-times faster chip, not a billion computers working in parallel — can dent a number that large. The wall is mathematical.

Something needs to change at a deeper level than hardware. The question is: what?

Section 05
⑤ Interactive

How Long Would It Take?

Choose a problem, drag the slider to change the size, and watch what happens to classical time. The moment you feel the bar slam — that's the wall.

CLASSICAL vs QUANTUM — TIME COMPLEXITY EXPLORER
Drag the slider · Switch problems · See the gap grow
Key size (bits) 512
🖥️ Classical time
—
⚛️ Quantum time
—
Classical: checks one possibility at a time → exponential explosion.
Quantum: explores many simultaneously → stays reasonable.
Classical: —
Quantum: —
🔬 Try this
Slide to the largest size. Watch classical time go from seconds… to centuries… to billions of years. That's the wall we're hitting right now. Notice the quantum bar barely moves. That gap is why an entirely different approach is needed.
Quick Check Test your understanding
Lesson Summary

What You Now Know About the Classical Wall

  • 🖥️
    Classical computers are extraordinary — but sequential
    They check one possibility at a time. For most tasks that's perfectly fine. For a specific class of problems, it's a fatal constraint.
  • 📈
    Exponential growth is categorically different
    At n = 300, two-to-the-power-of-300 exceeds the number of atoms in the universe. No hardware improvement touches a number that large. The wall is mathematical, not technological.
  • 🔓
    The problems that matter most are exactly the blocked ones
    Cryptography, drug discovery, molecular simulation, combinatorial optimisation — the highest-stakes problems in science and industry all run into the same classical ceiling.
  • ⚠️
    This is not an algorithm problem either
    Researchers have been searching for shortcuts for decades. For many of these problems, no classical shortcut exists — or is expected to exist. The only way out is a fundamentally different kind of computation.
How confident do you feel about this?

Classical computers are stuck checking one state at a time.
The problems that matter most require exploring an astronomical number of states.

What if information itself could be in multiple states at once…?

Sources & Further Reading
← Previous
Classical Computers
L02 — Bits, binary, and the light switch
← → navigate lessons · Space = mark complete