What Is "Quantum" About Quantum Computing?
summary
Starts from a sound, complete reversible classical language and proves that adding three concrete ingredients — a square root of NOT operator, a finite clock of phases (ζ with ζ^4 = 1) and one algebraic equation relating them — yields a discrete, exact language that is dense in the unitaries. It shows O(log T) bits precision suffices for T-step runs, compiles and runs a Shor-style factor-15 example (slow but functional), and proves universality while acknowledging alternative cube-root axioms and open questions about quantum advantage.
AI-written summary · about
chapters (15)
- 0:00Introduction
- 1:48Classical plus quantum
- 3:31Quantum algorithms overview
- 13:51Personal journey
- 19:49Classical reversibility
- 23:01Physical computing principles
- 24:25Reversible programming
- 32:10What makes quantum unique
- 35:21Quantum axioms defined
- 41:08Intuition behind axioms
- 44:42Quantum primitives in code
- 48:38Reversibility in classical
- 50:41Quantum speedup questions
- 51:46Summary and future
- 52:29Q&A
related talks
01h 02mQuantum Computing Concepts
41mQuantum Computing
30mQuantum Computing for Programming Languages Researchers
22mQbC: Quantum Correctness by Construction
43mQuantum Hello World, Understanding Quantum Computing Today
13mQbC: Quantum Correctness by Construction
15mToward A Quantum Programming Language for Higher Level Formal Verification
28mA type-theoretic account of quantum computation (Extended Abstract)
