paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Optimizing Quantum Circuits, Fast and Slow

优化量子电路:快与慢
ASPLOS Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 12025匹配度 2/10 · 该论文研究量子电路优化,核心是重写规则与酉合成的统一,属于量子编译与程序变换方向;与用户关注的静态分析、LLM/Agent 与 PL 交叉、浮点程序分析及贝叶斯程序分析均无直接交集,仅共享广义的 PL/编译优化背景。引用 22 inbox
Amanda Xu, Abtin Molavi, Swamit Tannu, Aws Albarghouthi
crossref: 2026-09-12dblp: 2026-09-12arxiv: 2026-09-12

AI 速览

一句话:统一重写规则与酉合成,提出极简算法GUOQ优化量子电路,大幅超越现有优化器。

量子电路优化对在量子处理器上成功执行电路至关重要,核心目标是最小化量子操作数量。论文将两类思路——快速的标准化重写规则 pass 与慢速、需在电路空间搜索的酉合成——统一为抽象电路变换框架,使重写与重合成可被同一视角刻画。基于该框架,作者提出极简算法 GUOQ,利用重写与重合成之间的协同来优化量子电路。在广泛基准上的大量评估表明,GUOQ 显著优于现有优化器。

问题
量子电路需最小化量子操作数量才能在量子处理器上成功执行,因此量子电路优化十分关键。
方法
论文将重写规则(快速标准优化 pass)与酉合成(慢速、需搜索电路空间)统一为抽象电路变换框架,并提出极简算法 GUOQ 来利用两者协同。
评估
作者在广泛基准上进行了大量评估,结果表明 GUOQ 能显著优于现有优化器。
原文摘要(Abstract)

Optimizing quantum circuits is critical: the number of quantum operations needs to be minimized for a successful evaluation of a circuit on a quantum processor. In this paper we unify two disparate ideas for optimizing quantum circuits, rewrite rules, which are fast standard optimizer passes, and unitary synthesis, which is slow, requiring a search through the space of circuits. We present a clean, unifying framework for thinking of rewriting and resynthesis as abstract circuit transformations. We then present a radically simple algorithm, guoq, for optimizing quantum circuits that exploits the synergies of rewriting and resynthesis. Our extensive evaluation demonstrates the ability of guoq to strongly outperform existing optimizers on a wide range of benchmarks.

链接与引用

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

BibTeX
@inproceedings{abs-2411-04104,
  title = {Optimizing Quantum Circuits, Fast and Slow},
  author = {Amanda Xu and Abtin Molavi and Swamit Tannu and Aws Albarghouthi},
  booktitle = {ASPLOS},
  year = {2025},
  doi = {10.1145/3669940.3707240}
}