Scheme Pearl: Quantum Continuations
summary
Claims that quantum-circuit simulation reduces to efficiently managing many delimited continuations and demonstrates it by implementing a full simulator in Scheme that models Hadamard as branching choices and Toffoli/CCX as classical updates. Uses shift/reset continuations to spawn branches, carries complex amplitudes as weights, and collapses branches by summing amplitudes (interference) then squaring for probabilities. Shows practicality of list or hash-table collection strategies and notes efficiency needs special symmetries to avoid exponential blowup.
AI-written summary · about
chapters (4)
- 0:00Start
- 0:04High Level View of Shore Algorithm
- 0:29Quantum Superposition
- 22:26The Cove Inspector Theorem
related talks
30mSymbolic Execution of Hadamard-Toffoli Quantum Circuits
26mRapunSL: Untangling Quantum Computing with Separation, Linear Combination and Mixing
15mProgramming and Reasoning with Partial Observability
35mSQUIP or Why We Need to Study Processors Like Nature
27mAsk Me Anything with Margaret Martonosi
58m“SPMD Programming Using C++ and ISPC"
25mDemo: The Reduction of Girard’s Paradox as Music
34mNew Tools for Peak Memory Scheduling