Search-Based Quantum Program Testing via Commuting Pauli String
Asmar Muqeet, Shaukat Ali, Paolo Arcaini

TL;DR
This paper introduces SB-QOPS, a search-based quantum program testing method using commuting Pauli strings, which improves fault detection and reduces reliance on full program specifications across multiple quantum platforms.
Contribution
It extends previous QOPS approach by redefining test cases with Pauli strings and employing a measurement-centric oracle for more effective quantum program testing.
Findings
Achieves 100% fault detection for circuits up to 29 qubits.
Outperforms previous QOPS method in fault detection.
Demonstrates portability across IBM, IQM, and Quantinuum platforms.
Abstract
Quantum software testing is important for reliable quantum software engineering. Despite recent advances, existing quantum software testing approaches rely on simple test inputs and statistical oracles, costly program specifications, and limited validation on real quantum computers. To address these challenges, we propose SB-QOPS, a search-based quantum program testing approach via commuting Pauli strings. SB-QOPS, as a direct extension to a previously proposed QOPS approach, redefines test cases in terms of Pauli strings and introduces a measurement-centric oracle that exploits their commutation properties, enabling effective testing of quantum programs while reducing the need for full program specifications. By systematically exploring the search space through an expectation-value-based fitness function, SB-QOPS improves test budget utilization and increases the likelihood of…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Software Testing and Debugging Techniques · Formal Methods in Verification
