Search-Based Quantum Program Testing via Commuting Pauli String

• URL: http://arxiv.org/abs/2602.11487v1
• Date: Thu, 12 Feb 2026 02:13:12 GMT
• Title: Search-Based Quantum Program Testing via Commuting Pauli String
• Authors: Asmar Muqeet, Shaukat Ali, Paolo Arcaini,
• Abstract summary: SB-QOPS is a search-based quantum program testing approach via commuting Pauli strings.<n>We conduct a large-scale empirical evaluation on quantum circuits of up to 29 qubits on real quantum computers and emulators.<n>Results show that SB-QOPS significantly outperforms QOPS, achieving a fault-detection score of 100% for circuits up to 29 qubits.
• Score: 6.124926843021984
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• 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 uncovering subtle faults. We conduct a large-scale empirical evaluation on quantum circuits of up to 29 qubits on real quantum computers and emulators. We assess three search strategies: Genetic Algorithm, Hill Climbing, and the (1+1) Evolutionary Algorithm, and evaluate SB-QOPS under both simulated and real noisy conditions. Experiments span three quantum computing platforms: IBM, IQM, and Quantinuum. Results show that SB-QOPS significantly outperforms QOPS, achieving a fault-detection score of 100% for circuits up to 29 qubits, and demonstrating portability across quantum platforms.

Related papers

• QSPE: Enumerating Skeletal Quantum Programs for Quantum Library Testing [11.99653900003681]
  We propose QSPE, a practical approach that follows the differential testing principle and extends the existing approach, SPE, for quantum libraries.<n> QSPE is fully automated, requiring no pre-set configurations or domain expertise, and can effectively generate a large set of diverse program variants.<n>In our experiments, the QSPE approach demonstrates remarkable effectiveness in generating 22,770 program variants across multiple quantum computing platforms.
  arXiv  Detail & Related papers  (2026-01-17T08:10:40Z)
• Quantum Approximate Optimization Algorithm: Performance on Simulators and Quantum Hardware [0.0]
  Running quantum circuits on quantum computers does not always generate "clean" results, unlike on a simulator.<n>This paper explores different optimization methods, techniques, and error mitigation methods to observe how they react to quantum noise differently.<n>It is helpful for other researchers to understand the complexities of running QAOA on real quantum hardware and the challenges faced in dealing with noise.
  arXiv  Detail & Related papers  (2025-09-29T02:51:37Z)
• Digital quantum simulation of many-body systems: Making the most of intermediate-scale, noisy quantum computers [51.56484100374058]
  This thesis is centered around simulating quantum dynamics on quantum devices.<n>We present an overview of the most relevant quantum algorithms for quantum dynamics.<n>We identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future.
  arXiv  Detail & Related papers  (2025-08-29T10:37:19Z)
• On the Feasibility of Quantum Unit Testing [7.96685560797073]
  This work presents a study on quantum-centric unit tests, comparing traditional statistical approaches with tests specifically designed for quantum circuits.<n>We investigate (a) each test's ability to detect subtle discrepancies between the expected and actual states of a quantum circuit, and (b) the number of measurements required to achieve high reliability.<n>The results demonstrate that quantum-centric tests provide clear advantages in terms of precision and efficiency, reducing both false positives and false negatives compared to statistical tests.
  arXiv  Detail & Related papers  (2025-07-23T06:05:24Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design [63.02824918725805]
  Quantum computing is recognized for the significant speedup it offers over classical computing through quantum algorithms.<n>QCircuitBench is the first benchmark dataset designed to evaluate AI's capability in designing and implementing quantum algorithms.
  arXiv  Detail & Related papers  (2024-10-10T14:24:30Z)
• Quantum Program Testing Through Commuting Pauli Strings on IBM's Quantum Computers [6.925738064847176]
  We present QOPS, a novel quantum software testing approach. QOPS introduces a new definition of test cases based on Pauli strings to improve compatibility with different quantum programs. We empirically evaluate QOPS on 194,982 real quantum programs, demonstrating effective performance in test assessment compared to the state-of-the-art with a perfect F1-score, precision, and recall.
  arXiv  Detail & Related papers  (2024-08-01T12:10:10Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Iterative Qubits Management for Quantum Index Searching in a Hybrid System [56.39703478198019]
  IQuCS aims at index searching and counting in a quantum-classical hybrid system. We implement IQuCS with Qiskit and conduct intensive experiments. Results demonstrate that it reduces qubits consumption by up to 66.2%.
  arXiv  Detail & Related papers  (2022-09-22T21:54:28Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• Automatic Test Pattern Generation for Robust Quantum Circuit Testing [8.860149267706221]
  We introduce the stabilizer projector decomposition (SPD) for representing the quantum test pattern. We construct the test application (i.e., state preparation and measurement) using Clifford-only circuits. We develop an SPD generation algorithm, as well as several acceleration techniques which can exploit both locality and sparsity in generating SPDs.
  arXiv  Detail & Related papers  (2022-02-22T07:06:10Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.