Dependency-Aware Compilation for Surface Code Quantum Architectures

Explore a conference presentation that addresses the critical challenge of compiling quantum circuits for fault-tolerant quantum computers implementing surface codes. Learn about a novel dependency-aware compilation algorithm developed by researchers from the University of Wisconsin-Madison that tackles two fundamental problems: mapping circuit qubits to device qubits and routing execution paths between interacting qubits. Discover how this approach exploits the dependency structure of circuit operations to formulate discrete optimization problems that can be efficiently approximated using simulated annealing, a classic optimization technique. Examine the extensive evaluation results demonstrating the algorithm's power and flexibility for compiling realistic quantum computing workloads, which is essential for both efficiency and correctness in practical quantum applications. Gain insights into quantum error correction, surface code architectures, and optimization techniques that are crucial for the advancement of fault-tolerant quantum computing systems.