Building a Compiler for Quantum Computers
summary
Explains why a quantum compiler is essential and shows concrete effects: compiling the same five‑qubit circuit with different passes yields 56% vs 28% correct outcomes on Yorktown, because mapping and optimizations change gate count and noise exposure. Uses the Terra-style compiler (pass manager, unroller, layout and swap mappers) and shows algorithms: trivial/dense/noise-adaptive layout, swap decomposes to three CNOTs, and optimizations like consolidate two‑qubit blocks and one‑qubit rotation folding to shrink depth within short decoherence windows (∼10–90 μs).
AI-written summary · about
chapters (21)
- 0:00Intro
- 0:48Quantum Circuits
- 2:29Some Quantum Gates
- 4:42Pulse Level Programming
- 5:43Why do we need compilers?
- 8:07Basis Gates
- 9:00Qubit Connectivity
- 10:35Not Enough Connectivity?
- 11:26Noise
- 13:24Qiskit Terra
- 14:29The DAG
- 16:32Transpiler Architecture
- 18:54Passmanager Stages
- 20:17Preset Pass Managers
- 22:44The Unroller
- 25:24Layout Example
- 27:55Swap Mapping/Routing
- 29:012-qubit Block Collection
- 30:24Consolidate Blocks
- 32:00Optimize 1Q Operations
- 33:21Quantum Volume?
related talks
46mUnlocking quantum potential with software and compilers
14mDependency-Aware Compilation for Surface Code Quantum Architectures
15mCompositional Quantum Control Flow with Efficient Compilation in Qunity
26mGenerating Compilers for Qubit Mapping and Routing
37mResource-Efficient Quantum Computing by Breaking Abstractions
21mCobble: Compiling Block Encodings for Quantum Computational Linear Algebra
19mExtracting maximum value from today's quantum computers while prep
01h 02mQuantum Computing Concepts