arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2411.09121cs.LOcs.FL
收藏

AutoQ 2.0:从量子电路验证到量子程序验证(技术报告)

AutoQ 2.0: From Verification of Quantum Circuits to Verification of Quantum Programs (Technical Report)

Institute of Information Science, Academia Sinica(中央研究院資訊科学研究所);Hon Hai Quantum Computing Research Center(富士康量子计算研究中心);Faculty of Information Technology, Brno University of Technology(布尔诺理工大学信息技术学院)

Yu-Fang Chen, Kai-Min Chung, Min-Hsiu Hsieh, Wei-Jia Huang, Ondřej Lengál, Jyun-Ao Lin, Wei-Lun Tsai

AI总结:

AutoQ 2.0通过引入经典控制流结构,解决了量子程序验证中的理论与工程挑战,成功验证了无法仅用量子电路表达的RUS算法和基于弱测量的Grover搜索算法。

摘要:

我们介绍了名为AutoQ 2.0的量子程序验证器。量子程序通过引入经典控制流结构扩展了量子电路(AutoQ 1.0的领域),使用户能够以形式化和精确的方式描述高级量子算法。扩展过程极具挑战性,因为需要解决理论问题(如测量处理、规范化问题以及将经典程序的循环验证技术提升到量子世界)和工程问题(如扩展输入格式以支持指定循环不变式)。我们已成功使用AutoQ 2.0验证了两种无法仅用量子电路表达的高级量子程序:重复直到成功(RUS)算法和基于弱测量的Grover搜索算法变体。AutoQ 2.0能高效验证所有基准:所有RUS算法均被即时验证,对于基于弱测量的Grover搜索变体,我们能够在约20分钟内处理100个量子比特的情况。

英文摘要:

We present a verifier of quantum programs called AutoQ 2.0. Quantum programs extend quantum circuits (the domain of AutoQ 1.0) by classical control flow constructs, which enable users to describe advanced quantum algorithms in a formal and precise manner. The extension is highly non-trivial, as we needed to tackle both theoretical challenges (such as the treatment of measurement, the normalization problem, and lifting techniques for verification of classical programs with loops to the quantum world), and engineering issues (such as extending the input format with a~support for specifying loop invariants). We have successfully used AutoQ 2.0 to verify two types of advanced quantum programs that cannot be expressed using only quantum circuits: the \emph{repeat-until-success} (RUS) algorithm and the weak-measurement-based version of Grover's search algorithm. AutoQ 2.0 can efficiently verify all our benchmarks: all RUS algorithms were verified instantly and, for the weak-measurement-based version of Grover's search, we were able to handle the case of 100 qubits in $\sim$20 minutes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑