paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Quantum Circuits for Dynamic Runtime Assertions in Quantum Computation

量子计算中动态运行时断言的量子电路
ASPLOS Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems2020匹配度 1/10 · 论文聚焦量子计算中的运行时断言与调试,属于量子程序验证/测试方向;与用户关注的 PL↔AI、LLM 改进静态分析/形式化验证、浮点程序分析、贝叶斯程序分析及其与 LLM 的交叉均无直接关联。引用 83 inbox
Ji Liu, Gregory T. Byrd, Huiyang Zhou
crossref: 2026-09-12

AI 速览

一句话:提出用辅助量子比特实现动态运行时断言的量子电路,可断言经典态、纠缠与叠加态。

量子计算中的运行时断言面临两大挑战:qubit 不可克隆,且测量会使叠加态坍缩为经典态并丢失并行信息。本文提出通过辅助 qubit 进行运行时计算,间接收集目标 qubit 的信息,从而克服上述限制。作者设计了分别用于断言经典态、纠缠态和叠加态的量子电路。实验在 IBM Q 量子计算机上进行,结果表明这些断言电路在软件调试和错误检测中有效,并能提高多种量子算法的成功率。

问题
量子计算缺乏有效的运行时断言机制,且受不可克隆定理与测量坍缩限制,传统断言方法难以直接应用。
方法
利用辅助 qubit 间接收集目标 qubit 信息,设计量子电路分别断言经典态、纠缠态和叠加态。
评估
在 IBM Q 量子计算机上开展实验,验证其在调试与错误检测中的有效性,并观察其对多种量子算法成功率的提升。
原文摘要(Abstract)

In this paper, we propose quantum circuits for runtime assertions, which can be used for both software debugging and error detection. Runtime assertion is challenging in quantum computing for two key reasons. First, a quantum bit (qubit) cannot be copied, which is known as the non-cloning theorem. Second, when a qubit is measured, its superposition state collapses into a classical state, losing the inherent parallel information. In this paper, we overcome these challenges with runtime computation through ancilla qubits, which are used to indirectly collect the information of the qubits of interest. We design quantum circuits to assert classical states, entanglement, and superposition states. Our experimental results show that they are effective in debugging as well as improving the success rate for various quantum algorithms on IBM Q quantum computers.

链接与引用

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

BibTeX
@inproceedings{paperbot5393,
  title = {Quantum Circuits for Dynamic Runtime Assertions in Quantum Computation},
  author = {Ji Liu and Gregory T. Byrd and Huiyang Zhou},
  booktitle = {ASPLOS},
  year = {2020},
  doi = {10.1145/3373376.3378488}
}