Dependency-Aware Compilation for Surface Code Quantum Architectures

TL;DR

This paper presents a novel dependency-aware compilation algorithm for surface code quantum architectures, improving efficiency and correctness in mapping and routing quantum circuits.

Contribution

It introduces a new algorithm that exploits dependency structures for near-optimal quantum circuit compilation on surface code architectures.

Findings

Efficient near-optimal compilation achieved with simulated annealing.

Algorithm effectively handles realistic quantum workloads.

Significant improvements over previous methods in mapping and routing.

Abstract

Practical applications of quantum computing depend on fault-tolerant devices with error correction. Today, the most promising approach is a class of error-correcting codes called surface codes. We study the problem of compiling quantum circuits for quantum computers implementing surface codes. Optimal or near-optimal compilation is critical for both efficiency and correctness. The compilation problem requires (1) mapping circuit qubits to the device qubits and (2) routing execution paths between interacting qubits. We solve this problem efficiently and near-optimally with a novel algorithm that exploits the dependency structure of circuit operations to formulate discrete optimization problems that can be approximated via simulated annealing, a classic and simple algorithm. Our extensive evaluation shows that our approach is powerful and flexible for compiling realistic workloads.