Quantum Computing Basics: Maze Solving Mouse

"Quantum Computer = Just a Super Fast PC?"

News says "Quantum computers will break all encryption". I simply thought, "Oh, it must be a computer with like 1000GHz CPU clock speed." But studying it revealed I was dead wrong. It's not a 'faster' calculator; it's a calculator from a 'different dimension'.

1. Maze Analogy: Mouse vs Water

The analogy that clicked was 'Solving a Maze'.

• Classical Computer (Current): Release one Mouse (1) into the maze.

  • At a fork, it tries left. Dead end? Come back and try right.
  • A Supercomputer is just a Very Fast Mouse (Usain Bolt Mouse). But it still checks paths one by one.

• Quantum Computer: Pour Water (0 and 1 Superposition) into the maze.

  • Water doesn't hesitate at forks. It flows left and right simultaneously.
  • Instantly, it fills all paths, and only the stream exiting the maze remains.

What makes Quantum Computers scary is this 'Superposition'. With 100 forks, a classic PC checks $2^$ times. A Quantum PC scans them all at once.

2. Qubit: Being 0 and 1

A classic Bit is like a light switch. On (1) or Off (0). A Quantum Bit, Qubit, is like a "Spinning Coin". It's not heads or tails yet; it exists as both heads AND tails.

Because of this weird property, performance explodes exponentially (x2), not additively (+), as you add qubits.

• 2 Bits: Stores 1 of 4 states.
• 2 Qubits: Stores ALL 4 states simultaneously.

3. Entanglement: Quantum Telepathy

The second key concept is Entanglement. When two qubits are entangled, measuring one instantly determines the state of the other, no matter the distance. Einstein hated this, calling it "Spooky Action at a Distance."

I initially thought, "Isn't it just pre-determined?" Like if I put two coins in envelopes, one heads, one tails. If I open one and see heads, the other is tails. But Quantum Entanglement is different.

The Key: They are UNDECIDED until measured. When you measure Qubit A and it collapses to 0, Qubit B simultaneously collapses to 1. It wasn't determined beforehand; the act of measurement defined reality for both.

This is why Quantum Key Distribution (QKD) is unhackable. If a hacker tries to "measure" the key in transit, the entanglement breaks, and the intrusion is instantly detected.

4. Quantum Gates: Controlling Probability

Classical computers use Logic Gates (AND, OR, NOT). Quantum computers use Quantum Gates.

• Hadamard Gate (H): Puts a qubit into superposition. Input 0 -> "50% chance 0, 50% chance 1".
• Pauli-X Gate (X): Similar to NOT. Flips 0 to 1.
• CNOT Gate: Entangles two qubits. If Control is 1, flip Target.

These gates manipulate probability distributions. It's like adjusting valves to control the flow of "water" in our maze analogy.

5. Shor's Algorithm: The End of RSA

In 1994, Peter Shor proved that a quantum computer could factor large numbers in Polynomial Time. RSA encryption relies on the fact that factoring large numbers is impossible for classical computers (takes billions of years). Shor's Algorithm solves this in minutes.

If Google's Willow chip or IBM's Quantum System scales up, all current internet security (HTTPS, Banking, Email) will be broken. That's why NIST is rushing to standardize Post-Quantum Cryptography (PQC). A "Harvest Now, Decrypt Later" attack is a real threat—hackers are saving encrypted data today to crack it 10 years later.

6. Why isn't it on my desk yet? (Error Rate)

Why can't I buy a MacBook Quantum? Error Rate.

Qubits are incredibly sensitive. Temperature, vibration, or stray calling signals cause Decoherence—the qubit collapses into a regular bit. Ideally, they need Absolute Zero (-273°C).

Current error rates are 0.1% ~ 1%. Compare that to a classical CPU's error rate of $10^$. We need Quantum Error Correction—using multiple physical qubits to form one logical qubit—but this requires millions of qubits. We are currently at the 100~1,000 qubit stage.

7. Real World: IBM & Google

• IBM Quantum Experience: You can actually run code on a real quantum computer via the cloud. I tried running a "Hello World" entanglement circuit. The results weren't perfect (due to noise), but it worked.
• Google Sycamore: In 2019, Google achieved "Quantum Supremacy," solving a problem in 200 seconds that would take a supercomputer 10,000 years.

8. So is it better than my MacBook?

"Can I run League of Legends at 1 million FPS on a Quantum Computer?" The answer is NO.

Quantum computers are god-like only for 'Problems requiring checking all possibilities' (Encryption cracking, Drug discovery, Path optimization). For regular tasks like Excel, YouTube, or Gaming, current CPUs are much better. It's like "Using a Nuclear Fusion Reactor to boil Ramen"—inefficient.

Quantum Strengths:

• Factoring: Shor's Algorithm
• Database Search: Grover's Algorithm ($O(N)$ -> $O(\sqrt)$)
• Molecular Simulation: Drug discovery
• Optimization: Logistics, Portfolio management

Quantum Supremacy vs. Quantum Advantage

You might hear these two terms often.

• Quantum Supremacy: A quantum computer doing something that a classical computer cannot do in a reasonable time (even if that task is useless). Google's Sycamore achieved this in 2019.
• Quantum Advantage: A quantum computer doing something useful (like discovering a new battery material) faster/cheaper than a classical computer. We form not there yet.

We are currently in the NISQ (Noisy Intermediate-Scale Quantum) era. The hardware exists, but it's noisy and error-prone. The race is now on to build fault-tolerant machines.

9. Summary: Changing the Paradigm

After understanding Quantum Computers, I now see why Google and IBM are wrestling with cryogenic freezers (Absolute Zero). It's not just about building a "faster computer", but humanity's challenge to control "God's Dice".

Asking "Is the qubit 0 or 1?" before measurement is a philosophical question. Quantum computing turns this philosophical uncertainty into a computational weapon. It's daunting, but exciting.