TL;DR
This paper explores leveraging quantum computing to significantly accelerate dynamic testing of classical software by converting programs and applying quantum algorithms for counting and searching input errors.
Contribution
It introduces a novel approach combining quantum conversion, counting, and search algorithms to speed up dynamic testing processes for classical programs.
Findings
Quantum approach reduces testing complexity from O(N) to O(ε^{-1} √(N/K))
Toy example demonstrates feasibility on a quantum simulator and real QC
Potential for faster defect detection in software testing
Abstract
Software under test can be analyzed dynamically, while it is being executed, to find defects. However, as the number and possible values of input parameters increase, the cost of dynamic testing rises. This paper examines whether quantum computers (QCs) can help speed up the dynamic testing of programs written for classical computers (CCs). To accomplish this, an approach is devised involving the following three steps: (1) converting a classical program to a quantum program; (2) computing the number of inputs causing errors, denoted by , using a quantum counting algorithm; and (3) obtaining the actual values of these inputs using Grover's search algorithm. This approach can accelerate exhaustive and non-exhaustive dynamic testing techniques. On the CC, the computational complexity of these techniques is , where represents the count of combinations of input parameter…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
