This post is the single entry point for the zhichai.net column "From Coins to Error Correction" — a ~100-article quantum computing course that grows over time. The author recommends bookmarking this navigation post rather than individual articles. As of the latest update, all ten batches (100 articles) are complete.
Key points
- Audience: Written for anyone who has heard of quantum computing but never had it explained from scratch. No physics background, programming, or love of math required — the first batch uses only a coin and some multiplication. By the end, readers should understand why quantum error correction is one of the most ingenious machines humanity is building, and be able to judge "quantum breakthrough" news on their own.
- Two reading paths: A main path reading sequentially from article 001, where each piece states its prerequisites; and a shortcut path where experienced readers jump in at any article and follow its prerequisite navigation backward.
- Editorial policy: Explains principles, not news. Time-sensitive industry content is marked with a "(2026-11 perspective)" label and revised when the landscape changes.
- Structure of each article: Starts from a concrete object (coin, drawer, spinning top), and every analogy is explicitly torn down by the author to show where it fails. Each piece ends with three "takeaways" and a hook to the next article.
- Honest disclaimer: As of 2026, quantum computing has not changed anyone's daily life and can do far less than headlines claim — but the principles are real, the machines are real, and the error-correction milestones are real. The column neither hypes nor pours cold water.
The ten-batch roadmap (all complete ✅)
| Batch | Theme | Articles | | :--- | :--- | :--- | | 1 | Intuitive foundations: building the worldview without formulas | 001–010 | | 2 | Minimal math toolbox: complex numbers, arrows, matrices | 011–020 | | 3 | Quantum gates and circuits: H, CNOT, teleportation, Bell, no-cloning | 021–030 | | 4 | Core algorithms I: Deutsch-Jozsa, Bernstein-Vazirani, Grover, Simon, QFT, Shor | 031–040 | | 5 | Core algorithms II and simulation: phase estimation, VQE, QAOA, HHL, QML | 041–050 | | 6 | Noise and quantum error correction: T1/T2, stabilizers, surface codes, magic state distillation | 051–060 | | 7 | Hardware deep dive: superconducting, trapped-ion, photonic, neutral-atom, topological, silicon spin | 061–070 | | 8 | Quantum information ecosystem: QKD/BB84, quantum networks, blind computing, benchmarks, Qiskit/Cirq/PennyLane | 071–080 | | 9 | Frontiers and open problems: BQP, post-quantum cryptography, verifiability | 081–090 | | 10 | Hands-on workshop: real cloud runs, Grover, VQE for H₂, BB84, surface code cycles, pulse-level tuning | 091–100 |
Sample article links (first batch):
1. A coin that splits in two: what superposition is 2. One peek changes the world: why measurement is irreversible 3. Telepathic dice: entanglement, and why it can't ship parcels 4. Making wrong answers cancel: the only source of quantum computing power 5. The popular misunderstanding of "exponential parallelism": superposition ≠ speed 6. The toppling top: coherence, decoherence, and fragile quantum states 7. Four boxes for quantum: superconducting, ion trap, photonic, neutral atom 8. A machine bigger than a chip: dilution refrigerators and what a quantum computer really looks like 9. What quantum advantage actually measures: sampling, benchmarks, and "proof" 10. A decision tree for quantum computing: what's usable in 2026 and what isn't
The column also interlinks with existing quantum articles on the site: older relevant posts receive an "absorbed into the column" note, and the column cites them as live examples. The post will continue to grow as time-sensitive articles are revised and new milestones appear.