What's This Actually About?
Understanding Quantum Computing
Hook: the day Google claimed quantum supremacy and IBM rebutted it the same afternoon — and the question this course answers.
Learning Material
1 pagesLesson 1 — What's This Actually About?
Understanding the Complex: Understanding Quantum Computing
October 23, 2019. Google published a paper in Nature. The headline: a quantum processor called Sycamore had performed a calculation in 200 seconds that would take the world's most powerful classical supercomputer 10,000 years.
Quantum supremacy, they called it. The moment computers crossed a threshold that couldn't be uncrossed.
IBM posted a rebuttal blog the same afternoon.
IBM's response argued that the specific calculation Google chose was artificial, that classical computers could simulate it in 2.5 days with the right approach, and that "quantum supremacy" was a misleading marketing term rather than a scientific milestone. Two teams, two interpretations, one afternoon. The field had arrived at a fork in the road, and nobody could agree which path they were on.
Five years later, the word "quantum" appears in more press releases, investment decks, and government strategy documents than ever. Billions of dollars have moved. The US, China, and the EU have each declared quantum technology a strategic national priority. The EU alone committed €1 billion to its Quantum Flagship program; the US Department of Energy announced $625 million in quantum network research; China's state investment is estimated in the billions, though exact figures are classified.
And yet: most people who use the phrase "quantum computing" couldn't explain what a qubit is, why it matters, or why the whole endeavor is harder than it looks.
That's not a criticism. It's just the gap this course exists to close.
Here's what you hear most often about quantum computing:
"It will break all encryption." Full stop, no nuance.
"It will solve problems classical computers never can." Somehow. Eventually.
"China is winning the quantum race." Or America is. Depending on who you ask.
All three statements contain truth. All three are more complicated than they look. And none of them tells you what's actually happening inside a quantum computer — what makes it different, why it's so hard to build, and what it can and can't actually do.
That's the puzzle.
Here's the thing about quantum computers: they don't work the way most people imagine.
The most common misconception is that a quantum computer "tries all answers simultaneously" — like a magic brain that checks every possibility in parallel and picks the winner instantly. This idea is so widespread that even technical articles sometimes slip into it. It's also wrong. Or at least, deeply incomplete.
The reality is stranger and more specific. Quantum computers aren't faster at everything — they're faster at a small class of problems that happen to have the right mathematical structure. For most tasks you'd actually want to compute, a classical laptop would win.
The question is which problems fall into that special class. And why.
There's a second layer to this that matters even more.
One of those special problems — factoring large numbers — turns out to be the mathematical foundation of most encryption on the internet today. The RSA algorithm, used to secure banking, email, government communications, and virtually every HTTPS connection, relies on the fact that factoring a 2,048-bit number is computationally intractable for classical computers.
A sufficiently powerful quantum computer running Shor's algorithm — discovered by mathematician Peter Shor in 1994 — would break it.
This isn't theoretical. The math is solid. The question isn't whether a quantum computer could break RSA. It's when — and whether we'll have migrated to quantum-resistant encryption before that day arrives.
And here's the twist: that day might be closer than you think in one sense, and further than you think in another. State actors may already be collecting encrypted internet traffic today, storing it, planning to decrypt it once the hardware catches up.
The NSA issued guidance to US national security systems in 2022, recommending immediate migration away from RSA and elliptic-curve encryption to post-quantum alternatives — not because quantum computers exist yet, but because the migration itself takes years and the window is closing.
So: what can a quantum computer actually do that a classical one can't?
That's the question this course answers. Not the physics-textbook version. Not the "qubits are magic" version. The honest version, with stated limits, named actors, real stakes, and a clear account of where we are and where we might be going.
By the end, you'll understand what a qubit is and why it matters. You'll understand why Shor's algorithm is both impressive and terrifying. You'll understand why error correction is the real bottleneck — not the physics, but the engineering. And you'll understand who's building these things, why, and whose money is paying for it.
The central question:
What can a quantum computer actually do that a classical one can't — and why is the road there so much harder than the headlines suggest?
Let's find out.
Next lesson: Why should I care? — Three reasons this topic is worth your time beyond the hype.
Reading time: approx. 8–9 minutes