Classical vs Quantum

Classical vs Quantum Computing

Why Another Kind of Computer?

For seventy years, classical computers have been doubling in power roughly every two years, quietly reshaping everything from medicine to entertainment. So why would anyone want to build a fundamentally different kind of machine? The answer is that there are problems, important, practical ones, where even the fastest classical supercomputer would take longer than the age of the universe to find an answer. Simulating how a new drug molecule binds to a protein, factoring the enormous numbers behind modern encryption, optimizing logistics across a global supply chain: all of these choke the classical machine. Quantum computers are not a faster version of what you already have. They are a different model of computation, one that harnesses the strange rules of quantum mechanics to attack certain problems in ways that classical machines cannot.

How Classical Computers Actually Work

Under the glossy screen of your laptop sits an ocean of transistors, tiny electronic switches. Modern CPUs contain tens of billions of them, each smaller than a virus. Each transistor is either conducting electricity (1) or not (0), and that is the entire alphabet of classical computing. Everything else, images, sound, AI models, operating systems, is built on top of Boolean logic: AND, OR, NOT, NAND, XOR. These logical operations compose into arithmetic, arithmetic into algorithms, and algorithms into the apps you use every day. A classical bit is reliable and cheap, and the machinery around it is astonishingly well engineered. But it has one deep limitation: it can only ever represent a single value at a single time.

A classical bit is like a light switch: it is either ON (1) or OFF (0). Simple, deterministic, and boring in the best way.

Enter the Qubit

Quantum computers replace the bit with a qubit. A qubit can be 0, or 1, or, and this is where classical intuition starts to break, a precise blend of both at once. That blend is called superposition, and it is not a fudged "we just don't know yet" sort of uncertainty. It is a real, physical state in which the qubit genuinely carries information about both possibilities simultaneously.

The classic analogy is a spinning coin. A classical bit is a coin lying flat: heads or tails, full stop. A qubit is a coin spinning in the air: it is not secretly heads or tails, it is something in between, and only when you slap it onto the table (measure it) does it commit to one face.

Mathematically, a qubit state looks like this:

|ψ⟩ = α|0⟩ + β|1⟩

The pointy brackets are Dirac notation: |0⟩ and |1⟩ are simply labels for the two definite states, and |ψ⟩ (psi) names whatever state our qubit is currently in. You will see this notation everywhere, and the next lesson unpacks it properly.

Here α and β are probability amplitudes, complex numbers that encode how much of |0⟩ and how much of |1⟩ the qubit is carrying. When you measure, you get |0⟩ with probability |α|² and |1⟩ with probability |β|². This is the Born rule, and it is the bridge between the wavy quantum world and the concrete numbers you actually read out. The amplitudes α and β must satisfy |α|² + |β|² = 1, which is a fancy way of saying the qubit has to land somewhere when you look.

Entanglement: Connections Without Wires

Now put two qubits together. Classically, two bits have four possible states, 00, 01, 10, 11, and each bit carries its own independent value. Quantum mechanics allows something stranger: the two qubits can exist in a joint state that cannot be described as "qubit A is doing this and qubit B is doing that." They are entangled. Their fates are linked.

A famous example is the Bell state (|00⟩ + |11⟩)/√2. In this state, neither qubit has a definite value on its own, but the moment you measure one and see 0, the other is guaranteed to also be 0, even if they are light-years apart. Measure the first and see 1, the second will also be 1. Perfect correlation, every time.

The tempting classical explanation is: "the qubits must have secretly agreed on an answer ahead of time, like two envelopes mailed with matching cards inside." This is called a hidden variable theory, and it sounds perfectly reasonable. The problem is that it is wrong. In the 1960s, physicist John Bell derived an inequality that any local hidden-variable theory must satisfy. Experiments, most famously those that earned the 2022 Nobel Prize in Physics, have repeatedly shown that nature violates Bell's inequality. The correlations between entangled qubits are stronger than any pre-arranged agreement could produce. Entanglement is genuinely non-classical.

Interference: The Engine of Quantum Algorithms

Superposition alone is not what makes quantum computing powerful. If all a qubit did was "be in both states at once," you would just get random answers when you measured it. The real magic is interference, the ability of quantum amplitudes to add up or cancel out, just like waves on a pond.

Imagine dropping two pebbles into water at the same time. Where the crests of the ripples meet, you get a big crest (constructive interference). Where a crest meets a trough, they cancel and the water stays flat (destructive interference). Quantum amplitudes behave the same way. A clever quantum algorithm is one that is carefully designed so that the amplitudes leading to wrong answers destructively interfere, cancelling each other out, while the amplitudes leading to right answers constructively interfere and grow. When you finally measure, the correct answer has become overwhelmingly likely.

This is why quantum computing is sometimes described as "computing with probabilities that can be negative." Negative amplitudes let wrong answers delete themselves. Classical probability, which can only be non-negative, has no way to do this.

Where Is the Quantum Advantage?

Quantum computers are not universally faster. They shine on a handful of specific problem structures:

What quantum computers are not good at, a crucial misconception to clear up, is "running your existing programs faster." They will not make your web browser faster, your video games smoother, your LLM cheaper to train, or your spreadsheets more responsive. They are not a parallel classical computer. For the vast majority of everyday workloads, a classical CPU or GPU will always be the right tool. Quantum computers are specialists, and they excel only when a problem has the kind of structure that quantum interference can exploit.

What You'll Learn in This Track

Over the next lessons you will go from zero to building real circuits: creating and measuring qubits, applying gates, flipping qubits with Pauli gates, putting them into superposition with the Hadamard gate, and finally entangling them to create Bell states. By the end of the track you will have hands-on intuition for the three quantum ingredients introduced here, superposition, entanglement, and interference, and you will have written and run actual quantum programs in the browser.

Let's begin your quantum journey.