QSPE: Enumerating Skeletal Quantum Programs for Quantum Library Testing

• URL: http://arxiv.org/abs/2602.00024v1
• Date: Sat, 17 Jan 2026 08:10:40 GMT
• Title: QSPE: Enumerating Skeletal Quantum Programs for Quantum Library Testing
• Authors: Jiaming Ye, Fuyuan Zhang, Shangzhou Xia, Xiaoyu Guo, Xiongfei Wu, Jianjun Zhao, Yinxing Xue,
• Abstract summary: 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.
• Score: 11.99653900003681
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The rapid advancement of quantum computing has led to the development of various quantum libraries, empowering compilation, simulation, and hardware backend interfaces. However, ensuring the correctness of these libraries remains a fundamental challenge due to the lack of mature testing methodologies. The state-of-the-art tools often rely on domain-specific configurations and expert knowledge, which limits their accessibility and scalability in practice. Furthermore, although these tools demonstrate strong performance, they adopt measurement-based for output validation in testing, which makes them produce false positive reports. To alleviate these limitations, we propose QSPE, a practical approach that follows the differential testing principle and extends the existing approach, SPE, for quantum libraries. QSPE is fully automated, requiring no pre-set configurations or domain expertise, and can effectively generate a large set of diverse program variants that comprehensively explore the quantum compilation space. To mitigate the possible false positive reports, we propose statevector-based validation as an alternative to measurement-based validation. In our experiments, the QSPE approach demonstrates remarkable effectiveness in generating 22,770 program variants across multiple quantum computing platforms. By avoiding $α$-equivalence at the quantum and classical program wise, QSPE can reduce redundant generation and save more than 90\% of execution cost. Finally, the statevector-based validation method assists QSPE to reduce false alarms and effectively detects 708 miscompilations across multiple quantum libraries. Notably, 81 of the discovered bugs have been officially approved and acknowledged by the Qiskit development team, demonstrating the practical impact of our approach.

Related papers

• Search-Based Quantum Program Testing via Commuting Pauli String [6.124926843021984]
  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.
  arXiv  Detail & Related papers  (2026-02-12T02:13:12Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Reliable high-accuracy error mitigation for utility-scale quantum circuits [2.3311230422577696]
  We introduce QESEM, a reliable, high-accuracy, characterization-based software implementing efficient, unbiased quasi-probabilistic error mitigation.<n>We demonstrate its capabilities in the largest utility-scale error mitigation experiment based on an unbiased method.<n>Results mark a significant step forward in accuracy and reliability for running quantum circuits on devices available today.
  arXiv  Detail & Related papers  (2025-08-14T18:02:44Z)
• 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)
• Quantum Executor: A Unified Interface for Quantum Computing [46.36953285198747]
  Quantum Executor is a backend-agnostic execution engine designed to orchestrate quantum experiments across heterogeneous platforms.<n>Key features include support for asynchronous and distributed execution, customizable execution strategies and a unified API for managing quantum experiments.
  arXiv  Detail & Related papers  (2025-07-10T09:55:32Z)
• A Framework for the Efficient Evaluation of Runtime Assertions on Quantum Computers [4.704614749567071]
  This work proposes a framework that assists developers in the evaluation of runtime assertions on real quantum computers.<n>It translates a variety of assertions into sets of measurements, reduces execution overhead where possible and evaluates the results after the execution even in the presence of noise.
  arXiv  Detail & Related papers  (2025-05-06T18:00:07Z)
• Leveraging Pre-Trained Neural Networks to Enhance Machine Learning with Variational Quantum Circuits [48.33631905972908]
  We introduce an innovative approach that utilizes pre-trained neural networks to enhance Variational Quantum Circuits (VQC) This technique effectively separates approximation error from qubit count and removes the need for restrictive conditions. Our results extend to applications such as human genome analysis, demonstrating the broad applicability of our approach.
  arXiv  Detail & Related papers  (2024-11-13T12:03:39Z)
• Sound certification of memory-bounded quantum computers [0.1874930567916036]
  We introduce an approach, which we call quantum system quizzing, for the certification of quantum gates in a practical server-user scenario.<n> Importantly, this approach does not require trusted state preparation and measurement and is thus inherently free from the associated systematic errors.<n>A major technical challenge that we are first to resolve in the memory-bounded single-device setup is recovering the tensor product structure of a multi-qubit system.
  arXiv  Detail & Related papers  (2024-11-06T19:23:45Z)
• 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)
• Potential and limitations of quantum extreme learning machines [55.41644538483948]
  We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements. Our analysis paves the way to a more thorough understanding of the capabilities and limitations of both QELMs and QRCs.
  arXiv  Detail & Related papers  (2022-10-03T09:32:28Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• 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.