Quantum Concolic Testing

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Xia, Shangzhou, Zhao, Jianjun, Zhang, Fuyuan, Guo, Xiaoyu
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866915316240482304
author Xia, Shangzhou
Zhao, Jianjun
Zhang, Fuyuan
Guo, Xiaoyu
author_facet Xia, Shangzhou
Zhao, Jianjun
Zhang, Fuyuan
Guo, Xiaoyu
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2405_04860
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Quantum Concolic Testing
Xia, Shangzhou
Zhao, Jianjun
Zhang, Fuyuan
Guo, Xiaoyu
Software Engineering
Quantum Physics
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.
title Quantum Concolic Testing
topic Software Engineering
Quantum Physics
url https://arxiv.org/abs/2405.04860