QEMI: A Quantum Software Stacks Testing Framework via Equivalence Modulo Inputs

• URL: http://arxiv.org/abs/2602.09942v1
• Date: Tue, 10 Feb 2026 16:26:34 GMT
• Title: QEMI: A Quantum Software Stacks Testing Framework via Equivalence Modulo Inputs
• Abstract summary: We propose Quantum EMI, a new testing approach for quantum software stacks.<n>QEMI produces code with dead code based on quantum control-flow structures.<n>We successfully identified 11 crash bugs and 1 behavioral inconsistency.
• Score: 4.817488266327195
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As quantum algorithms and hardware continue to evolve, ensuring the correctness of the quantum software stack (QSS) has become increasingly important. However, testing QSSes remains challenging due to the oracle problem, i.e., the lack of a reliable ground truth for expected program behavior. Existing metamorphic testing approaches often rely on equivalent circuit transformations, backend modifications, or parameter tuning to address this issue. In this work, inspired by Equivalence Modulo Inputs (EMI), we propose Quantum EMI (QEMI), a new testing approach for QSSes. Our key contributions include: (1) a random quantum program generator that produces code with dead code based on quantum control-flow structures, and (2) an adaptation of the EMI technique from classical compiler testing to generate variants by removing dead code. By comparing the behavior of these variants, we can detect potential bugs in QSS implementations. We applied QEMI to Qiskit, Q#, and Cirq, and successfully identified 11 crash bugs and 1 behavioral inconsistency. QEMI expands the limited set of testing techniques available for quantum software stacks by going beyond structural transformations and incorporating semantics-preserving ones into quantum program analysis.

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)
• Noise-Resistant Feature-Aware Attack Detection Using Quantum Machine Learning [43.509065918669314]
  Continuous-variable quantum key distribution (CV-QKD) is a quantum communication technology that offers an unconditional security guarantee.<n>We propose a quantum machine learning (QML)-based attack detection framework (QML-ADF) that safeguards the security of high-rate CV-QKD systems.
  arXiv  Detail & Related papers  (2026-01-11T03:40:45Z)
• 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)
• QuanTest: Entanglement-Guided Testing of Quantum Neural Network Systems [45.18451374144537]
  Quantum Neural Network (QNN) combines the Deep Learning (DL) principle with the fundamental theory of quantum mechanics to achieve machine learning tasks with quantum acceleration. QNN systems differ significantly from traditional quantum software and classical DL systems, posing critical challenges for QNN testing. We propose QuanTest, a quantum entanglement-guided adversarial testing framework to uncover potential erroneous behaviors in QNN systems.
  arXiv  Detail & Related papers  (2024-02-20T12:11:28Z)
• 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)
• Symbolic Execution for Quantum Error Correction Programs [3.018910972030221]
  We define QSE, a symbolic execution framework for quantum programs. We introduce symbolic stabilizer states, which symbolize the phases of stabilizer generators, for the efficient analysis of quantum error correction (QEC) programs. We implement QSE with the support of symbolic stabilizer states in a prototype tool named QuantumSE.jl.
  arXiv  Detail & Related papers  (2023-11-19T12:31:11Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• Variational Quantum Eigensolver for Classification in Credit Sales Risk [0.5524804393257919]
  We take into consideration a quantum circuit which is based on the Variational Quantum Eigensolver (VQE) and so-called SWAP-Test. In the utilized data set, two classes may be observed -- cases with low and high credit risk. The solution is compact and requires only logarithmically increasing number of qubits.
  arXiv  Detail & Related papers  (2023-03-05T23:08:39Z)
• Quantum-Error-Mitigation Circuit Groups for Noisy Quantum Metrology [0.0]
  Quantum technologies work by utilizing properties inherent in quantum systems such as quantum coherence and quantum entanglement. Quantum technologies are fragile against an interaction with an environment (decoherence) and in order to utilize them with high accuracy we need to develop error mitigation techniques.
  arXiv  Detail & Related papers  (2023-03-03T10:01:42Z)
• Quantum Annealing Learning Search Implementations [0.0]
  This paper presents the details and testing of two implementations of the hybrid quantum-classical algorithm Quantum Annealing Learning Search (QALS) on a D-Wave quantum annealer.
  arXiv  Detail & Related papers  (2022-12-21T15:57:16Z)
• 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)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• 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.