paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Dependency-Aware Compilation for Surface Code Quantum Architectures

面向表面码量子架构的依赖感知编译
OOPSLA 9(OOPSLA1)2025匹配度 1/10 · 论文聚焦量子表面码架构下的量子电路编译(量子比特映射与路由),使用模拟退火做离散优化,属于量子编译/优化方向。它与用户关注的 PL→AI 静态分析、AI→PL、浮点程序分析、贝叶斯程序分析以及 LLM/Agent 交叉均无直接关联。引用 10 inbox
Abtin Molavi, Amanda Xu, Swamit Tannu, Aws Albarghouthi
crossref: 2026-09-10

AI 速览

一句话:提出依赖感知的量子电路编译算法,用模拟退火近最优地完成量子比特映射与路由。

本文研究面向实现表面码纠错码的量子计算机的量子电路编译问题。近最优编译对效率与正确性都至关重要,其核心包括将电路量子比特映射到设备量子比特,以及为相互作用的量子比特规划执行路径。作者提出一种新算法,利用电路操作之间的依赖结构构造离散优化问题,并通过模拟退火这一经典简单方法进行近似求解。大量评估表明,该方法在真实工作负载编译上兼具强大能力与灵活性。

问题
为基于表面码的量子计算机编译量子电路时,如何高效且近最优地完成量子比特映射与交互路径路由。
方法
利用电路操作的依赖结构构造离散优化问题,并用模拟退火算法近似求解。
评估
在现实工作负载上进行广泛评估,表明该方法强大且灵活。
原文摘要(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.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@article{paperbot3202,
  title = {Dependency-Aware Compilation for Surface Code Quantum Architectures},
  author = {Abtin Molavi and Amanda Xu and Swamit Tannu and Aws Albarghouthi},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {9},
  number = {OOPSLA1},
  year = {2025},
  doi = {10.1145/3720416}
}