paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Statistical Testing of Quantum Programs via Fixed-Point Amplitude Amplification

基于定点振幅放大的量子程序统计测试
OOPSLA 8(OOPSLA2)2024匹配度 2/10 · 本文研究量子程序的统计测试与定点振幅放大,属于程序测试/验证领域,但与用户核心方向(LLM 与静态分析、Agentic 程序分析、浮点程序分析、贝叶斯程序分析及其与 LLM 的交叉)几乎没有交集;论文不涉及 LLM、静态分析、浮点或贝叶斯方法。引用 5 inbox
Chan Gu Kang, Joonghoon Lee, Hakjoo Oh
dblp: 2026-09-10crossref: 2026-09-10

AI 速览

一句话:提出用定点振幅放大加速量子程序统计测试,减少测量次数与运行时间且保持统计保证。

量子程序的输入/输出规约难以直接验证,因为量子态不可直接比较,通常只能通过重复执行、测量和统计比较进行测试,但这需要大量测量才能获得高置信度。本文提出将定点振幅放大(FPAA)适配到量子程序测试中,以加速统计测试。作者形式化描述了该技术,并证明其能在不牺牲原有统计保证的前提下减少所需测量次数并降低运行时间;案例研究进一步展示了其运行时效。

问题
量子程序无法直接比较输入执行后的量子态与期望输出态,只能依赖重复执行、测量和统计比较来检查输入/输出规约,因此需要大量测量且开销较高。
方法
将定点振幅放大(FPAA)适配到量子程序统计测试中,并形式化描述该技术,以在保持统计保证的同时加速测试过程。
评估
从理论上展示该方法在不牺牲原有统计保证的情况下减少测量次数并降低运行时间,并通过案例研究展示其运行效果。
原文摘要(Abstract)

We present a new technique for accelerating quantum program testing. Given a quantum circuit with an input/output specification, our goal is to check whether executing the program on the input state produces the expected output. In quantum computing, however, it is impossible to directly check the equivalence of the two quantum states. Instead, we rely on statistical testing, which involves repeated program executions, state measurements, and subsequent comparisons with the specified output. To guarantee a high level of assurance, however, this method requires an extensive number of measurements. In this paper, we propose a solution to alleviate this challenge by adapting Fixed-Point Amplitude Amplification (FPAA) for quantum program testing. We formally present our technique, demonstrate its ability to reduce the required number of measurements as well as runtime cost without sacrificing the original statistical guarantee, and showcase its runtime effectiveness through case studies.

链接与引用

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

BibTeX
@article{KangLO24,
  title = {Statistical Testing of Quantum Programs via Fixed-Point Amplitude Amplification},
  author = {Chan Gu Kang and Joonghoon Lee and Hakjoo Oh},
  journal = {Proceedings of the ACM on Programming Languages},
  volume = {8},
  number = {OOPSLA2},
  year = {2024},
  doi = {10.1145/3689716}
}