The World Before Quantum: Why Regular Computers Have Limits

The World Before Quantum: Why Regular Computers Have Limits

Alice's Impossible Day

Imagine waking up tomorrow with a superpower: you can calculate the exact trajectory of every planet in the solar system, instantly add up a billion numbers, and look up any fact about history, science, or your favorite video game in the blink of an eye. You'd feel like a god of mathematics, right?

Now imagine being asked to do something seemingly simple: find the shortest route that visits exactly 60 cities scattered across a country, starting and ending in your hometown. No city can be visited twice. You can use any map, any calculator, any computer ever invented. How long would it take you?

If you answered "a few seconds" or "maybe an hour," you've just stumbled into one of the most profound mysteries of computer science. That problem—called the Traveling Salesman Problem—has stumped the world's most powerful supercomputers for decades. No matter how fast our technology gets, this problem seems to slip through our fingers like water through a sieve.

This is the story of why your smartphone, despite containing more computing power than the machines that sent astronauts to the Moon, still has fundamental limitations. This is the story of classical computing: its glorious achievements, its surprising weaknesses, and why the brilliant engineers and physicists who built our digital world are now reaching for something entirely new—something called quantum computing.

But before we can appreciate why quantum computers are such a big deal, we need to understand what regular computers actually are, how they work, and crucially, why there are certain problems that no matter how much we improve them, they simply cannot solve quickly. That's what this chapter is about.

---

The Machine That Changed Everything

From Babbage's Dream to Your Pocket

The story of classical computing begins not with Silicon Valley or Bill Gates, but with a nineteenth-century English mathematician named Charles Babbage. In 1837, Babbage imagined a machine called the Analytical Engine—a steam-powered mechanical monster that could follow instructions stored on punched cards. It would take numbers, perform calculations, and produce results automatically. His collaborator, Ada Lovelace, realized this machine could do more than just arithmetic; it could follow patterns of logic, potentially solving any problem that could be expressed as a series of steps. She wrote what we now consider the first computer program, an algorithm to calculate Bernoulli numbers.

Unfortunately, Babbage's machines remained dreams. The technology to build them didn't exist, and most people thought he was crazy. For nearly a century, his visions sat gathering dust in journals and letters.

Then came World War II.

The codebreakers at Bletchley Park in England needed to crack the German Enigma machine—an encryption device that made Nazi communications virtually unreadable. Alan Turing, a brilliant mathematician, designed a mechanical computing machine called the "Bombe" that could test different settings rapidly. It wasn't fast by modern standards, but it was fast enough. Historians believe the codebreaking efforts shortened the war by two to four years, saving millions of lives.

Turing's work went further than just building machines. He developed the theoretical foundation for what computation actually meant. His "Turing machine" was a hypothetical device that could simulate any computer algorithm—a concept so fundamental that it's still taught in computer science courses today. If an algorithm could be written for any problem, a Turing machine could theoretically solve it. The question was how long it would take.

By the 1940s and 1950s, vacuum tubes and then transistors replaced mechanical parts. Computers shrank from room-sized monsters to table-sized boxes. The Apollo missions in the 1960s were guided by computers with less processing power than a modern digital watch. Your smartphone contains millions of times more computing power than those vintage machines.

This transformation happened through a principle so consistent it became known as a law: Moore's Law.

The Magic of Miniaturization

In 1965, Gordon Moore—the cofounder of Intel—observed something remarkable. The number of transistors (the tiny switches that perform calculations) on a computer chip was doubling roughly every two years. This meant computers were getting exponentially more powerful while simultaneously becoming cheaper and smaller.

Think about what exponential growth actually means. If you start with a single grain of rice and double it every day, after 30 days you'll have over a billion grains—enough to feed a small country. That's the power of exponential growth, and that's what happened to computing power for nearly fifty years.

Your smartphone contains a processor with billions of transistors. Each transistor is about 14 nanometers wide—roughly 100 times smaller than a red blood cell. These microscopic switches flip on and off billions of times per second, performing calculations at speeds Babbage couldn't have imagined.

But here's where the story takes a dramatic turn. Moore's Law is hitting a wall.

The problem is fundamental physics. Transistors are becoming so small that they're approaching the size of individual atoms. At this scale, strange things happen. Electrons—the tiny particles that carry electrical charge—start behaving unpredictably. They can quantum tunnel through barriers that should stop them. They vanish from one location and appear in another. Atoms don't stay put; they vibrate with thermal energy. The classical physics that makes transistors work starts to break down.

The latest computer chips have features measured in picometers—a thousand times smaller than a nanometer. At this scale, you're essentially trying to control individual electrons with tools made of atoms. It's like trying to do surgery with a hammer.

This isn't just a temporary engineering challenge. Most physicists and engineers believe we've reached the practical limits of how small we can make transistors using current technology. We can still improve computers, but not by simply making them smaller and faster the way we've done for decades.

This is the first hint of why we need something new. But before we explore quantum computing, we need to understand exactly what classical computers can and cannot do—and why some problems are harder than others, not just for our current machines, but in principle.

---

The Language of Machines: Bits and Logic Gates

The Foundation: Just 0s and 1s

Every calculation your computer performs, from displaying this text to running a video game, comes down to a single concept: the bit. A bit is the simplest possible piece of information—it can be either 0 or 1, nothing else. That's it. Two states. On or off. Yes or no.

Your computer's processor contains billions of these tiny switches, called transistors, which can be either on (conducting electricity, representing 1) or off (not conducting, representing 0). Everything your computer does—from rendering graphics to calculating spreadsheets to playing music—emerges from manipulating these simple states.

Why only two states? Because it's easier to build reliable systems with just two clearly distinct options. A light switch is either on or off. A coin is either heads or tails. When things need to be small, fast, and reliable, simplicity wins.

When you press a key on your keyboard, your computer converts that action into a sequence of bits. The letter "A" becomes the binary number 01000001. The color blue in an image might be represented as a specific pattern of 24 bits. Music, video, programs, documents—all of it is encoded as strings of 0s and 1s.

This encoding system, called binary, might seem limiting at first. How can you represent the complexity of a photograph or a symphony with just two digits? But consider this: with just ten bits, yo