arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2501.05616quant-phcs.PL
收藏

验证量子态准备程序(扩展版)

Validating Quantum State Preparation Programs (Extended Version)

Iowa State University(爱荷华州立大学);The College of William and Mary(威廉玛丽学院);Australian National University(澳大利亚国立大学)

Liyi Li, Anshu Sharma, Zoukarneini Difaizi Tagba, Sean Frett, Alex Potanin

AI总结:

本文提出Pqasm框架,利用Coq证明助手验证量子态准备程序的正确性,通过属性测试框架测试复杂量子态准备算法的实现有效性。

摘要:

量子算法中的一个关键步骤是用不同特征准备初始量子叠加态。这些所谓的态准备算法对量子算法的行为至关重要,复杂的态准备算法难以正确有效地开发。本文提出了Pqasm:一个使用Coq证明助手实现的高保证框架,使我们能够证明Pqasm工具能正确反映量子程序的行为。该框架的关键在于将包含量子叠加态的程序的正确性保证减少到不包含叠加态的程序的正确性保证。这种减少使得能够在经典计算机上开发有效的测试框架来测试量子态准备算法的实现——这被认为是直到现在为止没有明确解决方案的难题。我们利用QuickChick属性测试框架来测试态准备程序。我们对使用Pqasm实现的5个案例进行了有效性评估;这些案例目前甚至无法在量子模拟器中模拟。

英文摘要:

One of the key steps in quantum algorithms is to prepare an initial quantum superposition state with different kinds of features. These so-called state preparation algorithms are essential to the behavior of quantum algorithms, and complicated state preparation algorithms are difficult to develop correctly and effectively. This paper presents Pqasm: a high-assurance framework implemented with the Coq proof assistant, allowing us to certify our Pqasm tool to correctly reflect quantum program behaviors. The key in the framework is to reduce the program correctness assurance of a program containing a quantum superposition state to the program correctness assurance for the program state without superposition. The reduction allows the development of an effective testing framework for testing quantum state preparation algorithm implementations on a classical computer - considered to be a hard problem with no clear solution until this point. We utilize the QuickChick property-based testing framework to test state preparation programs. We evaluated the effectiveness of our approach over 5 case studies implemented using Pqasm; such cases are not even simulatable in the current quantum simulators.

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

↑