arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2405.04860cs.SEquant-ph
收藏

量子 Concolic 测试

Quantum Concolic Testing

Shangzhou Xia, Jianjun Zhao, Fuyuan Zhang, Xiaoyu Guo

AI总结:

本文提出首个面向量子程序的 concolic 测试框架,通过量子约束生成与符号化方法生成路径约束并引导探索,有效提升分支覆盖率与 bug 检测能力。

摘要:

本文提出了首个明确为量子程序设计的 concolic 测试框架。该框架引入了针对量子控制语句的量子约束生成方法,用于量化量子状态,并为量子变量提供了符号化方法。基于此框架,我们为量子程序的每条具体执行路径生成路径约束。这些约束引导新路径的探索,通过量子约束求解器确定结果以创建新的输入样本,从而提高分支覆盖率。我们的框架已用 Python 实现,并与 Qiskit 集成以进行实际评估。实验结果表明,我们的 concolic 测试框架提高了分支覆盖率,生成了高质量的量子输入样本,并检测出 bug,证明了其在量子编程和 bug 检测中的有效性和效率。在分支覆盖率方面,对于少于 5 个量子比特的量子程序,我们的框架达到了 74.27% 以上。

英文摘要:

This paper presents the first concolic testing framework explicitly designed for quantum programs. The framework introduces quantum constraint generation methods for quantum control statements that quantify quantum states and offers a symbolization method for quantum variables. Based on this framework, we generate path constraints for each concrete execution path of a quantum program. These constraints guide the exploration of new paths, with a quantum constraint solver determining outcomes to create novel input samples, thereby enhancing branch coverage. Our framework has been implemented in Python and integrated with Qiskit for practical evaluation. Experimental results show that our concolic testing framework improves branch coverage, generates high-quality quantum input samples, and detects bugs, demonstrating its effectiveness and efficiency in quantum programming and bug detection. Regarding branch coverage, our framework achieves more than 74.27% on quantum programs with under 5 qubits.

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

↑