Your guide to quantum computing.
0%
Menu
What Is Quantum? The Technology The Different Quantum Computers Changing the World The Security Story Investing Landscape Learn (curriculum) Companies Applications Glossary Timeline Evaluating Claims Courses Quantum, But Friendly Inside a Quantum Computer Quantum in the Real World Quantum Computing Foundations Quantum Circuits, Algorithms, and Industry Fault-Tolerant Quantum Computing and Technical Strategy My Progress News FAQ Additional Resources Ask Quantum AI Agents ★ Saved
About About us Methodology Contact Disclaimer
My Progress
0%

Quantum Curious

See full progress
SAVE YOUR PROGRESS

Progress lives in this browser and is lost if you log out or clear it: unless you save it with your email. Same email on any device = same progress.

Dark mode

Guided View
New to all this? We add extra plain-English hints and reminders as you learn. Same lessons, with the help built in.

Expert View
You just want the lessons: clean, fast and compact, with no extra reminders. This is the default view.

Interface language

Learn: the curriculum

An ordered path, not a blog archive. It starts with linear-algebra intuition, the actual prerequisite most resources skip, and ends with what quantum computers provably cannot do. Prerequisites are shown; your position is tracked in your browser.

01 Linear algebra intuiti on 02 Qubits and superpositi on 03 Measurement 04 Entanglement 05 Gates and circuits 06 Interference: the actu al source of advantage 07 The major algorithms 08 Decoherence and noise 09 Error correction and l ogical qubits 10 What quantum computers provably cannot do

Filled markers are steps your tracked progress has passed; the outlined ring is where you are now. Arrows show prerequisites. Tap any step to jump to it.

Each step names where its content lives at your depth: the friendly lesson sets for Curious, the intermediate Academy course for Technical, the advanced course for Expert. Switch depth in the header at any time.
1 [α, β] M·v

Linear algebra intuition

Vectors, bases, matrices as transformations, and tensor products. The ACTUAL prerequisite for quantum computing, which most resources skip.

2 A cold-atom experiment at Jagiellonian University: atoms cooled to where superposition rules. Tomasz Kawalec · CC BY-SA 4.0 ↗

Qubits and superposition

From the definite bit to the amplitude-carrying qubit. Why '0 and 1 at the same time' is a shortcut, not the truth.

Prerequisites: linear algebra intuition

3 today's quantum forecast 🌤️ 70% heads 30% tails before you measure, the odds are ALL anyone can know, even nature

Measurement

One classical outcome per shot; the distribution is the output. Why looking changes things, and why algorithms repeat.

Prerequisites: qubits superposition

4 the spooky link measured: H instantly: H too any distance apart: across a room or across a galaxy

Entanglement

Joint structure no independent description reproduces: a resource, not a faster-than-light telephone.

Prerequisites: measurement

5 A NIST ion trap: quantum logic gates were first demonstrated on trapped ions. NIST · Public domain ↗

Gates and circuits

X, Z, H, rotations and CNOT; circuits as time-ordered choreography; why compilation to real hardware changes everything.

Prerequisites: qubits superposition

6 Tonomura's double-slit experiment: single electrons building an interference pattern. A. Tonomura / Belsazar · CC BY-SA 3.0 ↗

Interference: the actual source of advantage

Wrong answers cancel, right answers reinforce. The one-sentence truth of quantum speedup lives here.

Prerequisites: gates circuits

7 CLASSICAL the best available algorithm, step by step QUANTUM amplitudes over paths: wrong paths cancel the useful comparison is not "one path versus all paths" but the best algorithm available per problem

The major algorithms

Deutsch-Jozsa for intuition, Grover for search, Shor for cryptography: each with its honest reality check.

Prerequisites: interference

8 room temperature up here 🌡️ each layer: colder… …and colder… the chip: colder than space 🥶 ~0.01° above absolute zero "the chandelier": mostly a very fancy fridge

Decoherence and noise

Why qubits are divas, what T1/T2 mean, and why the useful life of quantum information is finite.

Prerequisites: gates circuits

9 PHYSICAL QUBITS noisy · error-prone · many error-correcting code + decoding ONE LOGICAL QUBIT reliable · what algorithms see one logical qubit may need hundreds or thousands of physical qubits plus classical control

Error correction and logical qubits

Many noisy physical qubits become one dependable logical qubit, and 'below threshold' becomes the field's honest scoreboard.

Prerequisites: decoherence noise

10 STRONG AT · simulating molecules · best-combo searches · (someday) code-breaking NOT BUILT FOR · loading websites · running your games · email, spreadsheets, apps a specialist tool, not a better laptop

What quantum computers provably cannot do

The most common misconception in the field, treated head-on: quantum computers do NOT try all answers in parallel. Interference is the mechanism.

Prerequisites: interference, major algorithms

Prefer it fully guided? The Academy delivers this same spine as three assessed courses (Beginner, Intermediate, Advanced) with knowledge checks and capstones.

Open the Academy →

Quantum, But Friendly

How Small Is Small?The Spinning CoinBit vs QubitSpooky Friends Final test

Inside a Quantum Computer

The Golden ChandelierHow It ThinksGood At, Bad At Final test

Quantum in the Real World

Quantum You Already OwnThe Great Quantum RaceFollowing the Quantum Money Final test

The Academy

Quantum Computing FoundationsQuantum Circuits, Algorithms, and IndustryFault-Tolerant Quantum Computing and Technical Strategy The full curriculum

Quick answers

GlossaryFAQ Additional ResourcesAsk Quantum Quantum News