A normal computer answers questions one at a time. A quantum computer can hold many possibilities at once, let the wrong ones cancel out, and leave you the right answer. This lab lets you play with a real one in your browser.
Classical machines process definite bits. A quantum processor manipulates qubits in superposition, links them through entanglement, and uses interference to amplify correct computational paths while cancelling incorrect ones. Below is a working state-vector simulator — every chart you see is computed from real quantum amplitudes, not animation.
A coin is either heads or tails. A qubit is both — until you look. Flip each a bunch and watch.
A fair coin occupies one definite face. A qubit prepared by a Hadamard gate sits in an equal superposition of |0⟩ and |1⟩; measurement collapses it to one outcome with probability ½. Over many shots both converge to 50/50 — but only the qubit was genuinely "both" beforehand.
Same 50/50 outcome — but the coin was always one thing. The qubit was both at once until measured.
One qubit can be 0 and 1 at the same time. Add another qubit and you can hold 4 combinations at once. Each qubit you add doubles it. Just 20 qubits already hold over a million combinations together.
An n-qubit register lives in a 2n-dimensional complex vector space. Each added qubit doubles the dimension, so the state can encode 2n amplitudes simultaneously. The slider below shows that explosion — 300 qubits would describe more amplitudes than there are atoms in the observable universe.
Possible combinations held at once:
Slide between "definitely 0", "fifty-fifty", and "definitely 1". The bars show how likely each answer is.
Rotating the qubit's state (a Ry rotation) sweeps the |0⟩/|1⟩ amplitudes. Probabilities are |amplitude|², so they always sum to 1.
Until you measure, the qubit is genuinely both, weighted like this.
Two qubits can be linked so they always agree. Open one box and you instantly know the other — even if it's across the room, or across the planet. They stopped being two separate things and became one connected system. This is the "they all work together" part.
A Bell state like (|00⟩ + |11⟩)/√2 has no description as two independent qubits — only the pair has a definite state. Measuring one fixes the other's outcome with perfect correlation, regardless of distance. No information travels faster than light (the individual results look random), but the correlation is real and is the backbone of quantum networking.
Click Entangle, then open either box. The other reveals the same result — every time.
Holding every answer at once is useless if you just get a random one. The trick: a quantum computer makes the wrong answers cancel each other out (like two waves meeting and flattening), and the right answers stack up. When you finally look, the good answer is what's left.
Amplitudes are complex numbers that can add or subtract. A good algorithm engineers destructive interference on incorrect computational paths and constructive interference on correct ones. Below: apply a Hadamard to put a qubit in superposition, then a second Hadamard — interference drives it right back to a certain |0⟩. Two "spread it out" operations combine to a definite answer. That cancellation is the whole game.
Start at a definite |0⟩. Add Hadamard gates one at a time and watch the probabilities.
After 1 H: even 50/50. After 2 H: the |1⟩ paths interfere destructively and you're certain again. Odd vs even count flips the result — pure interference.
This is the real thing in miniature: 3 qubits, real quantum gates. Place gates, then run it. The chart is computed from true quantum math.
A 3-qubit state-vector simulator. Place single-qubit gates (H, X, Z) and two-qubit CNOTs, then evaluate. Output probabilities are |amplitude|² over the 8 basis states; "Run shots" samples the distribution like a real measurement would.
Each line is a possible 3-bit answer and how strongly the machine is "holding" it right now.
You asked: couldn't it be a few computers, each with different jobs, all working together? For regular computers, yes — that's a server cluster. For quantum, the cutting edge is exactly this: link several smaller quantum chips with entanglement so they behave like one bigger one. It's called modular quantum computing, and it's how the field plans to scale up.
Building one monolithic chip with thousands of high-quality qubits is brutally hard. So IBM, Google, and others pursue modular / networked architectures: multiple QPUs connected by quantum links (entanglement distribution, photonic interconnects) and classical control, coordinated to run one larger computation. Your instinct — a cooperating fleet of specialized units — is a live research roadmap, not a misconception.
Glowing links = entanglement sharing work between chips.
Quantum computers won't replace your laptop. They're for a handful of impossibly hard problems — and on those, they could change the world.
Quantum advantage is narrow but profound: problems where the state space grows exponentially (quantum chemistry, certain optimizations, factoring) are natural fits. For everyday computing, classical machines stay better and cheaper.
Simulate molecules exactly to design drugs and catalysts we can't model today.
Find new materials for energy storage, fertilizer, and clean industry.
Could crack today's encryption — forcing the new "quantum-safe" codes.
Optimize traffic, supply chains, and schedules with astronomically many options.
New approaches to optimization and machine-learning subroutines.
Model carbon capture and complex reactions far beyond classical reach.
Here's the part that matters right now: a big enough quantum computer could break the encryption that protects bank logins, messages, and donor records. The scary twist — attackers can steal scrambled data today and unscramble it later when the machines arrive. So the world is already switching to new "quantum-proof" codes.
Shor's algorithm threatens RSA and elliptic-curve cryptography that secure most of today's internet. The "harvest now, decrypt later" threat means adversaries capture encrypted traffic now for future decryption. NIST has standardized post-quantum algorithms (ML-KEM/Kyber, ML-DSA/Dilithium); migration is underway across the industry.
Stuck on a word, a demo, or a "but why?" — ask in plain English and get an honest, jargon-free answer tuned to your reading level.
A scoped AI tutor (Claude) that answers quantum-computing questions at your chosen depth, refuses to hype, and won't invent facts. Your question never leaves our server with any key attached.
Everything else in this lab is free, forever. Quantum Lab+ adds the AI tutor — ask unlimited questions and get answers calibrated to Simple or Deep mode.
⚛️ Unlimited tutor questions
🎚️ Simple ⟷ Deep answers
🧭 Honest, no-hype explanations
💡 Built to make this stuff click
Honesty note: the tutor is an AI and explains quantum computing in accessible terms — it aims to be accurate and admits uncertainty, but it isn't a peer-reviewed source. For research or claims, verify against primary literature.