Unlocking quantum potential with software and compilers
summary
Describes compiling algorithms into hardware-ready circuits, showing that devices reach ~1,000 qubits today but require millions for fault tolerance, so software must close the gap. Presents results from polyche checks that detect errors and boost QAOA fidelity ~11% on average up to 33%, and a stratify-elaborate compiler that partitions algorithms to chiplets, reduces inter-chip swaps, handles heterogeneous gate sets, and compiles chiplets in parallel, trading placement, routing, pulse-level tuning, and mid-circuit measurement to cut error and resource cost.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 1:02Quantum computation importance
- 3:07Quantum mechanics basics
- 6:58Algorithms to hardware mapping
- 9:47Quantum software history
- 13:23Missing middle in stack
- 16:14Quantum compilers deep dive
- 23:01Near-term compilation pipeline
- 28:21Scalable compilation challenges
- 30:06Future of quantum stack
- 33:35Current research insights
- 40:45Summary
- 41:08Q&A
related talks
39mBuilding a Compiler for Quantum Computers
14mDependency-Aware Compilation for Surface Code Quantum Architectures
01h 10mThe Rise & Collapse of a Quantum State
26mGenerating Compilers for Qubit Mapping and Routing
32mOptimal Quantum Programs
15mCompositional Quantum Control Flow with Efficient Compilation in Qunity
19mEquality Saturation for Quantum Circuit Optimization
17mQVM: Quantum Gate Virtualization Machine