paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Orchestrated trios: compiling for efficient communication in Quantum programs with 3-Qubit gates

Orchestrated Trios:面向带 3 量子比特门的量子程序的高效通信编译
ASPLOS Proceedings of the 26th ACM International Conference on Architectural Support for Programming Languages and Operating Systems2021匹配度 1/10 · 论文主题是量子程序编译与三量子比特 Toffoli 门分解/路由优化,属于量子编译方向;与研究画像中的静态分析、LLM/Agent、浮点程序分析或贝叶斯程序分析均无直接交集。引用 21 inbox
Casey Duckering, Jonathan M. Baker, Andrew Litteken, Frederic T. Chong
crossref: 2026-09-12

AI 速览

一句话:提出 Orchestrated Trios 编译结构:先分解为三量子比特 Toffoli,再路由到邻近量子比特组,最后分解到硬件门。

当前量子计算机易错,需优化以减少操作数并提高编译成功率。硬件仅支持一、二量子比特门,且二量子比特门只能作用于物理连通的量子比特对。典型编译器先分解,再路由数据。本文提出新编译器结构 Orchestrated Trios:先将程序分解为三量子比特 Toffoli,随后把高层 Toffoli 的输入路由到邻近量子比特组,最后再分解为硬件支持的门。该结构重新组织分解与路由顺序,以利用三量子比特操作降低通信开销与操作数。摘要未报告具体定量评估。

问题
当前量子计算机易错且硬件连接受限,典型编译器先分解再路由,可能造成较高通信开销与操作数。
方法
Orchestrated Trios 先分解到三量子比特 Toffoli,再路由其输入到邻近量子比特组,最后完成到硬件门的一、二量子比特分解。
评估
摘要未报告具体实验评估;其目标指标是降低操作数并最大化编译程序成功概率。
原文摘要(Abstract)

Current quantum computers are especially error prone and require high levels of optimization to reduce operation counts and maximize the probability the compiled program will succeed. These computers only support operations decomposed into one- and two-qubit gates and only two-qubit gates between physically connected pairs of qubits. Typical compilers first decompose operations, then route data to connected qubits. We propose a new compiler structure, Orchestrated Trios, that first decomposes to the three-qubit Toffoli, routes the inputs of the higher-level Toffoli operations to groups of nearby qubits, then finishes decomposition to hardware-supported gates.

链接与引用

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

BibTeX
@inproceedings{paperbot6145,
  title = {Orchestrated trios: compiling for efficient communication in Quantum programs with 3-Qubit gates},
  author = {Casey Duckering and Jonathan M. Baker and Andrew Litteken and Frederic T. Chong},
  booktitle = {ASPLOS},
  year = {2021},
  doi = {10.1145/3445814.3446718}
}