Chapter Nineteen - Quantum Computing

CHAPTER NINETEEN

Quantum Computing

A CLASSICAL COMPUTER is a machine made of certainty.

Every bit is either a 0 or a 1.
Each operation flips switches, moves electrons, and runs logic gates that say “if this, then that.”
It’s fast, binary, and mechanical. Like a glorified abacus with electricity.

But quantum systems don’t care about certainty.

They thrive in the blur.
And someone had a wild idea:

What if we built a computer that used quantum weirdness instead of fighting it?

Enter the qubit.

A quantum bit isn’t just 0 or 1.
It’s both at the same time.
In superposition, a qubit exists in a blend of 0 and 1, with certain probabilities attached.
It doesn’t pick until it’s measured.

Now imagine stringing together multiple qubits.
Each new one doubles the size of the computational space.

Two classical bits can hold four possible states, but only one at a time.
Two qubits can hold a superposition of all four at once.
Three qubits = 8. Four = 16.
With n qubits, a quantum computer can process 2ⁿ states simultaneously.

But it gets crazier.

You can entangle qubits, linking them so that the state of one instantly affects the state of another, even across space.
Now your calculations aren’t just superposed, they’re coordinated across multiple dimensions of probability.

Quantum gates then manipulate these qubits, rotating and interfering with their states to perform logic operations. Not by flipping bits, but by bending probability amplitudes.

The result?

You don’t brute-force your way to an answer.
You interfere your way to it.
The correct solution emerges as the only one that doesn’t cancel itself out.

It’s not faster in the classical sense.
It’s smarter. Like cutting through a maze by walking every path at once.

Quantum computers won’t replace classical ones for most tasks.
But for certain problems, like factoring huge numbers, simulating molecules, and optimizing systems, they could be exponentially faster.

In 2019, Google claimed “quantum supremacy.” Showing that its 53-qubit Sycamore processor performed a task in 200 seconds that would take the best supercomputers thousands of years.

It wasn’t really useful, but it was historic.

Quantum computing is still young.
It’s noisy, delicate, and error-prone.
Qubits decohere. Systems crash. Scaling is hard.

But the principle is sound.
We are building machines that think in superposition.
That process entangled information.
That calculate in the language of reality itself.

And the deeper you go, the weirder it gets.

Because there’s one question left, one ghost in the machine we still don’t understand.

Does the mind collapse the wavefunction?