paperbot · PL 论文追踪

全部论文 待读 收藏

P2 COMPAS: A Distributed Multi-Party SWAP Test for Parallel Quantum Algorithms

COMPAS:面向并行量子算法的分布式多方 SWAP 测试
ASPLOS Proceedings of the 31st ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 22026匹配度 0/10 · 该论文研究分布式量子计算架构中的多方 SWAP 测试与多元迹估计,属于量子算法与量子体系结构方向;与用户的 PL/AI、LLM 辅助静态分析、浮点程序分析或贝叶斯程序分析等研究画像没有直接关联。引用 4 inbox
Brayden Goldstein-Gelb, Kun Liu, John M. Martyn, Hengyun (Harry) Zhou, Yongshan Ding, Yuan Liu
crossref: 2026-09-12dblp: 2026-09-12arxiv: 2026-09-12

AI 速览

一句话:提出 COMPAS,用预共享 Bell 对在分布式 QPU 上实现多方 SWAP 测试与多元迹估计,兼得常数深度与线性 Bell 对消耗。

量子比特数量有限使分布式多 QPU 架构成为扩展量子计算的重要方向,但跨设备执行算法需协同设计电路深度与纠缠开销。本文将多元迹估计识别为适合分布式的关键子程序,并用于 Rényi 熵估计、虚拟冷却与蒸馏等任务。作者提出 COMPAS:利用预共享纠缠 Bell 对,在互连的模块化/分布式 QPU 网络上实现多方 SWAP 测试与多元迹估计。该架构仅引入常数深度开销,Bell 对消耗随电路宽度线性增长,适合近期硬件;不同于只能在电路深度或 GHZ 宽度渐近最优性间取舍的方案,COMPAS 同时实现二者。文中还分析网络层错误并模拟电路级噪声影响。

问题
分布式多 QPU 架构受限于每芯片量子比特数,跨设备执行量子算法需控制电路深度与纠缠开销;多元迹估计是可分布式化的关键子程序。
方法
提出 COMPAS,利用预共享 Bell 对在多方互连的模块化/分布式 QPU 网络上实现多方 SWAP 测试,从而完成多元迹估计。
评估
从网络层错误分析,并模拟电路级噪声对架构性能的影响;理论对比显示仅增加常数深度且 Bell 对消耗与电路宽度线性相关,同时兼顾深度和 GHZ 宽度渐近最优性。
原文摘要(Abstract)

The limited number of qubits per chip remains a critical bottleneck in quantum computing, motivating the use of distributed architectures that interconnect multiple quantum processing units (QPUs). However, executing quantum algorithms across distributed systems requires careful co-design of algorithmic primitives and hardware architectures to manage circuit depth and entanglement overhead. We identify multivariate trace estimation as a key subroutine that is naturally suited for distribution, and broadly useful in tasks such as estimating Rényi entropies, virtual cooling and distillation, and certain applications of quantum signal processing. In this work, we introduce COMPAS, an architecture that realizes multivariate trace estimation across a multi-party network of interconnected modular and distributed QPUs by leveraging pre-shared entangled Bell pairs as resources. COMPAS adds only a constant depth overhead and consumes Bell pairs at a rate linear in circuit width, making it suitable for near-term hardware. Unlike other schemes, which must choose between asymptotic optimality in circuit depth or GHZ width, COMPAS achieves both at once. Additionally, we analyze network-level errors and simulate the effects of circuit-level noise on the architecture.

链接与引用

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

BibTeX
@inproceedings{Goldstein-GelbL26,
  title = {COMPAS: A Distributed Multi-Party SWAP Test for Parallel Quantum Algorithms},
  author = {Brayden Goldstein-Gelb and Kun Liu and John M. Martyn and Hengyun (Harry) Zhou and Yongshan Ding and Yuan Liu},
  booktitle = {ASPLOS},
  year = {2026},
  doi = {10.1145/3779212.3790143}
}