The BASIC-s of Quantum Computing: A Complete Syllabus
The BASIC-s of Quantum Computing
A private, non-commercial education series for kids and adults, teaching BASIC programming fundamentals alongside real quantum mechanics concepts.
Overview
This is a 26-session syllabus for teaching quantum computing concepts using BASIC programming on an Atari 800 emulator, combined with a genuine hardware random number generator (servo-driven hourglass + webcam + microphone, whitened via SHA-256).
The series is designed for participants with zero programming background, focusing on conceptual understanding over mathematical rigor. Every quantum concept has corresponding code that students can run and modify.
Course Philosophy
Why BASIC?
BASIC was chosen deliberately:
- Beginner-friendly syntax - No semicolons, curly braces, or complex type systems
- Line numbers make flow visible - Execution order is explicit, not hidden
- Global variables by default - Simplifies early concepts (though we acknowledge this as a simplification)
- GOSUB/RETURN - Introduces function calls without parameters
Concepts Over Rigor
This series prioritizes understanding the ideas over mathematical precision. As stated in the syllabus:
“nothing here is verifiable quantum computing, everything is a concept demonstration”
We’re honest about what’s real mechanism versus visual metaphor.
Session Map
| # | Topic | Core Idea | Code? |
|---|---|---|---|
| 1 | BASIC Fundamentals | Variables, PRINT/INPUT, FOR/NEXT, IF/THEN, GOSUB | ✅ |
| 2 | Binary & Truth Tables | Counting in binary, building static 2-variable truth tables | ✅ |
| 3 | Real vs Fake Randomness | RND() pseudo-RNG vs hardware RNG (hourglass/webcam/mic) | ✅ |
| 4 | Superposition Tables | N-selectable colored truth table that collapses using real RNG | ✅ |
| 5 | Entanglement Basics | Two linked tables, matching-row correlation | ✅ |
| 6 | Bell’s Theorem / CHSH | Simulating quantum correlation statistics, computing S vs 2 vs 2.828 | ✅ |
| 7 | The Classical Cheat | Students try to beat S=2 with local hidden variables. They can’t. | ✅ |
| 8 | The Bloch Circle | Qubit as DIRECTION, gates as rotations on a circle | ✅ |
| 9 | Real Gate Matrices | Matrix-vector multiply with real numbers | ✅ |
| 10 | Real Grover, N=4 | Exact oracle + diffusion computation for N=4 | ✅ |
| 11 | Grover’s Race | Classical linear search vs real Grover | ✅ |
| 12 | The AND Trap | Debunks fake entanglement from ANDing tables | ✅ |
| 13 | XOR Fairness | Why entropy daemon combines sources with XOR | ✅ |
| 14 | Pseudo-Entanglement | Names lesson 5 as pseudo-entanglement, adds variants | ✅ |
| 15 | Decoherence | Discussion: Why real QC needs cooling, scaling issues | ❌ |
| 16 | Physical Qubits | Superconducting loops, trapped ions, photons | ❌ |
| 17 | No-Cloning | Proof: Why you can’t backup a qubit like a classical file | ✅ |
| 18 | State of the Field | Honest discussion of what QC can/can’t do today | ❌ |
| 19 | Nested Tables | First real TEST: 16-number tensor, check factorability | ✅ |
| 20 | Geometric Circles | Original structure using geometric probability | ✅ |
| 21 | CNOT and Bell State | Real 2-qubit gate, construct entangled state | ✅ |
| 22 | More Gates | Rotation family, SWAP, controlled-Z | ✅ |
| 23 | Naive vs Real QM | Discussion: Real-number method breaks on phase-splitting | ❌ |
| 24 | 3-Qubit Bit-Flip Code | Real quantum error correction with CNOT | ✅ |
| 25 | The Stabilizer Trick | Gottesman-Knill theorem, Pauli strings | ✅ |
| 26 | BB84 Quantum Cryptography | Real, deployed protocol with 25% eavesdropper detection | ✅ |
Hardware Requirements
The Entropy Rig
The course uses a physical hardware random number generator consisting of:
- Servo-driven hourglass (sand grain transit timing)
- Webcam (visual noise)
- Microphone (audio noise)
- All sources combined and whitened via SHA-256
This provides true physical randomness distinct from pseudo-random number generators.
Emulation
- Atari 800 emulator (atari800 recommended)
- Runs Atari BASIC programs that demonstrate quantum concepts
Software Components
Python Support Scripts
- entropy_daemon.py - Captures entropy from webcam + microphone, whitens via SHA-256
- atari_bridge.py - Bridges entropy daemon output to Atari emulator’s R: device
- rng_client.py - Client for consuming random bytes
Atari BASIC Programs
26+ BASIC programs including:
- Static and superposition truth tables
- Bell/CHSH simulation
- Bloch circle visualization
- Real gate matrix operations
- Grover’s algorithm (N=4)
- Quantum error correction
- BB84 protocol simulation
Key Pedagogical Insights
Lessons 9-11: The Real Mechanism
Sessions 9-11 (Real Gate Matrices, Real Grover, Grover’s Race) are the only places running the actual quantum mechanism rather than sampling or concept demonstrations. This is explicitly called out to students.
Session 6 & 9: Require Hand-Computation
Bell/CHSH and Real Gate Matrices require actual hand-computation. Budget at least two meetups for each if participants lack math/physics background.
Decoherence vs No-Cloning
The syllabus makes a critical distinction:
- Decoherence (Session 15): Engineering problem, believed solvable in principle
- No-Cloning (Session 17): Mathematical theorem — permanent, not an engineering gap
Real Numbers vs Complex Numbers
Sessions 9, 10, 19, and 21 restrict to real numbers as a simplification. We’re honest about this:
A 2026 Physical Review Letters paper (Barrios Hita et al.) makes a rigorous case that complex numbers aren’t strictly fundamental to quantum mechanics. Real-number formulations exist that reproduce every experimental prediction. AND this series’ real-number code is narrower than that paper’s general claim.
Notable Achievements
Session 25: Stabilizer Trick
Implements the Gottesman-Knill theorem — tracking 2 Pauli strings instead of 4 amplitudes for the same Bell state. This was the original technical goal stated at the project’s beginning, finally realized once all prerequisite gates (H, CNOT) were built.
Session 26: BB84 Protocol
Teaches a real, currently-deployed quantum cryptography protocol (not speculative). BB84-based quantum key distribution works in real fiber networks today, requiring only single-photon hardware, not large fault-tolerant quantum computers.
Download
The complete syllabus, all lesson materials, and source code are available for download:
Download Complete Syllabus (ZIP, ~137KB)
This download includes:
- Full 26-session syllabus in markdown
- All 26 lesson markdown files
- Build Guide (markdown)
- Kid Explainer (markdown)
- 26+ BASIC code examples
- 3 Python support scripts
- Setup and running instructions
For Educators
Class Format
- Target audience: Kids and adults with zero programming background
- Duration: 26 sessions (can be compressed but concepts may not land)
- Prerequisites: None
- Materials needed: Atari 800 emulator, webcam, microphone, servo + hourglass
Teaching Notes
- Line numbers feel archaic — acknowledge this outright
- Atari BASIC has no scoping — all variables are global, everywhere, always
- Don’t explain GOSUB/RETURN as “like a teleport” — show it running and let students trace it
- Session 8’s Bloch circle is explicitly labeled as a “pure visual cartoon with no real numbers”
References
- Barrios Hita et al., Physical Review Letters 136, 240202 (2026) - Real-number formulation of quantum mechanics
- Gottesman-Knill theorem - Efficient classical simulation of Clifford circuits
- BB84 Protocol - Bennett & Brassard, 1984
Last updated: August 1, 2026
{{/*
- Consider extracting Build_Guide.docx and Kid_Explainer.docx to markdown for web display */}}