Quantum Computing — Core Concepts
What is Quantum Computing?
Quantum computing is computation that exploits quantum mechanical phenomena — superposition, entanglement, and interference — to process information in ways classical computers cannot. It doesn’t make everything faster. It makes specific categories of problems tractable that would otherwise take classical machines longer than the age of the universe.
The field traces back to 1981, when Richard Feynman pointed out that simulating quantum physics on a classical computer is exponentially expensive. His insight: why not build a computer that runs on quantum physics itself? Four decades later, companies are spending billions to prove him right.
How It Works
Classical Bits vs. Qubits
A classical bit is binary: 0 or 1. A qubit uses quantum superposition to exist in a combination of both states simultaneously, described by two probability amplitudes (complex numbers). When you measure a qubit, it collapses to either 0 or 1 — but before measurement, it carries information about both possibilities.
The power scales exponentially: n qubits can represent 2^n states simultaneously. 300 qubits can represent more states than there are atoms in the observable universe. But there’s a catch — you can only extract one measurement result, so the art of quantum computing is steering those probabilities so the right answer is overwhelmingly likely when you measure.
Entanglement
Two qubits can be entangled — correlated so that measuring one instantly determines the other, regardless of distance. Einstein called it “spooky action at a distance” and didn’t believe it. Experiments since the 1980s proved it’s real.
Entanglement isn’t about sending information faster than light. It’s about creating correlations between qubits that let quantum circuits coordinate computations in ways impossible classically. Without entanglement, a quantum computer is no more powerful than a classical one.
Quantum Gates and Circuits
Classical computers use logic gates (AND, OR, NOT). Quantum computers use quantum gates — operations that rotate a qubit’s state on a mathematical sphere called the Bloch sphere. Key gates include:
- Hadamard (H) — puts a qubit into equal superposition (the “coin flip” gate)
- CNOT — flips a target qubit only if a control qubit is 1, creating entanglement
- T gate — applies a small rotation, essential for universal quantum computation
A quantum circuit is a sequence of these gates applied to qubits. Designing effective circuits is the core challenge — you need to create interference patterns where wrong answers cancel out and right answers amplify.
What Quantum Computers Are Good At
Not everything. Specifically:
Cryptography
Shor’s algorithm (1994) can factor large numbers exponentially faster than any known classical method. RSA encryption — which secures most of the internet — relies on factoring being hard. A sufficiently powerful quantum computer could break RSA-2048 in hours. Today’s quantum machines can factor the number 21. The gap is enormous, but governments and banks are already migrating to “post-quantum” encryption standards (NIST finalized its first set in 2024).
Simulation
Feynman’s original vision. Simulating molecular interactions for drug discovery requires tracking quantum states — exponentially expensive on classical hardware. Pharma companies like Roche and Merck have quantum computing research programs. In 2023, IBM simulated a 127-qubit system that would have been impractical classically, though the molecules involved were still simple.
Optimization
Problems like “find the best delivery route across 10,000 locations” or “optimize a financial portfolio across 500 assets” have combinatorial explosion. Quantum approaches like the Quantum Approximate Optimization Algorithm (QAOA) show theoretical speedups, though practical advantage hasn’t been demonstrated yet.
Search
Grover’s algorithm offers a quadratic speedup for searching unsorted databases — turning a million-step search into a thousand-step one. Useful, but not the exponential speedup of Shor’s algorithm.
The Hardware Race
Several competing technologies for building qubits:
| Approach | Used By | Qubits (2025) | Strengths | Weaknesses |
|---|---|---|---|---|
| Superconducting | Google, IBM | 1,000+ | Fast gates, mature | Short coherence time, needs extreme cold |
| Trapped ion | IonQ, Quantinuum | ~50-60 | Long coherence, high fidelity | Slower gates, harder to scale |
| Photonic | PsiQuantum, Xanadu | ~200 (photonic modes) | Room temperature possible | High loss rates, complex |
| Topological | Microsoft | 0 (demonstrated 2025) | Inherent error protection | Unproven at scale |
IBM’s roadmap targets 100,000 qubits by 2033. Google claimed “quantum supremacy” in 2019 when its 53-qubit Sycamore chip performed a calculation in 200 seconds that would have taken a classical supercomputer 10,000 years (though IBM disputed the classical estimate).
Common Misconception
“Quantum computers will replace regular computers.”
They won’t. Quantum computers are terrible at most everyday tasks — sending email, running spreadsheets, playing video games. They’re specialized tools for problems with specific mathematical structure. Your future laptop won’t have a quantum chip. Instead, you’ll send certain problems to a quantum computer in the cloud (like how you’d use a GPU cluster for AI training today) and do everything else classically.
One Thing to Remember
Quantum computing harnesses superposition and entanglement to explore exponentially many possibilities simultaneously — but only for problems with the right structure. It’s a scalpel, not a Swiss army knife.