The Rise & Collapse of a Quantum State
summary
Describes a practical pipeline: rewrite-rule synthesizer converts small peephole circuits into algebraic polynomials and uses a randomized Schwarz–Zippel check (the polynomial identity filter) to cluster billions of candidates into equivalence classes, generating an optimizer in about a minute that beats Qiskit on 95% of benchmarks. Presents a device-agnostic mapping DSL called Amaro that models processors as weighted state machines and auto‑generates compilers (Google validates one), and outlines verified, approximate compilation paths toward million‑qubit fault‑tolerant runs.
AI-written summary · about
chapters (7)
- 0:00Introduction
- 1:08Quantum computing origins
- 14:11Specifications to circuits
- 22:42Optimizing quantum circuits
- 36:58Collapse mapping on devices
- 53:15Verified quantum compilation
- 54:19Q&A
related talks
26mGenerating Compilers for Qubit Mapping and Routing
46mUnlocking quantum potential with software and compilers
22mHow to Synthesize Quantum-Circuit Optimizers
19mExtracting maximum value from today's quantum computers while prep
15mAssertion-Based Optimization of Quantum Programs
26mQrisp: A Framework for Compilable High-Level Programming of Gate-Based Quantu...
39mBuilding a Compiler for Quantum Computers
17mQuantum Applications with Classiq