Dependency-Aware Compilation for Surface Code Quantum Architectures
summary
Presents a compiler that maps logical qubits to a 2D surface‑code grid using a layered interaction graph to expose only the operations that can conflict, then routes two‑qubit gates by searching over gate ordering with simulated annealing instead of a fixed heuristic. Evaluated on >200 benchmarks, the approach finds strictly better schedules on about 60% of compact‑architecture cases versus prior autobraid, and matches a SAT‑based optimal baseline on most small instances, and is integrated into the Whisk compiler.
AI-written summary · about
chapters (6)
- 0:00Surface code compilation intro
- 2:54Surface code mapping and routing
- 5:42Dependency-aware mapping
- 8:11Greedy routing challenges
- 9:56Experimental results
- 12:24Conclusion
related talks
26mGenerating Compilers for Qubit Mapping and Routing
39mBuilding a Compiler for Quantum Computers
46mUnlocking quantum potential with software and compilers
18mAutomated distribution of quantum circuits via hypergraph partitioning
01h 06mTour de gross: A modular quantum computer based on bivariate bicycle codes
19mEquality Saturation for Quantum Circuit Optimization
22mProgramming Abstractions for Quantum Linear Algebra
35mHalving the cost of surface codes by running error correction at the logical level