QITE: Assembly-Level, Cross-Platform Testing of Quantum Computing Platforms

• URL: http://arxiv.org/abs/2503.17322v1
• Date: Fri, 21 Mar 2025 17:17:51 GMT
• Title: QITE: Assembly-Level, Cross-Platform Testing of Quantum Computing Platforms
• Abstract summary: Quantum computing platforms are susceptible to quantum-specific bugs.<n>QITE is the first cross-platform testing framework for quantum computing platforms.<n>We evaluate QITE on four widely-used quantum computing platforms.
• Score: 21.351834312054844
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing platforms are susceptible to quantum-specific bugs (e.g., incorrect ordering of qubits or incorrect implementation of quantum abstractions), which are difficult to detect and require specialized expertise. The field faces challenges due to a fragmented landscape of platforms and rapid development cycles that often prioritize features over the development of robust platform testing frameworks, severely hindering the reliability of quantum software. To address these challenges, we present QITE, the first cross-platform testing framework for quantum computing platforms, which leverages QASM, an assembly-level representation, to ensure consistency across different platforms. QITE introduces the novel ITE process to generate equivalent quantum programs by iteratively (I)mporting assembly into platform representations, (T)ransforming via platform optimization and gate conversion, and (E)xporting back to assembly. It uses a crash oracle to detect failures during cross-platform transformations and an equivalence oracle to validate the semantic consistency of the final sets of assembly programs, which are expected to be equivalent by construction. We evaluate QITE on four widely-used quantum computing platforms: Qiskit, PennyLane, Pytket, and BQSKit, revealing 17 bugs, 14 of which are already confirmed or even fixed. Our results demonstrate QITE's effectiveness, its complementarity to existing quantum fuzzers in terms of code coverage, and its ability to expose bugs that have been out of reach for existing testing techniques.

Related papers

• QEMI: A Quantum Software Stacks Testing Framework via Equivalence Modulo Inputs [4.817488266327195]
  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.
  arXiv  Detail & Related papers  (2026-02-10T16:26:34Z)
• Investigating Retargetability Claims for Quantum Compilers [1.1570042851431976]
  We develop and run a study to analyze key aspects regarding the retargetability of the compilers Tket, Qiskit, and ProjectQ.<n>Our findings indicate that Tket demonstrates the highest level of retargetability, closely followed by Qiskit, while ProjectQ lags behind.
  arXiv  Detail & Related papers  (2026-01-23T14:26:15Z)
• QuSquare: Scalable Quality-Oriented Benchmark Suite for Pre-Fault-Tolerant Quantum Devices [0.19116784879310025]
  QuSquare consists of four benchmark tests that evaluate quantum hardware performance at both the system and application levels.<n>These benchmarks offer an integral, hardware-agnostic, and impartial methodology to quantify the quality and capabilities of current quantum computers.
  arXiv  Detail & Related papers  (2025-12-22T18:44:01Z)
• The EU Quantum Flagship's Key Performance Indicators for Quantum Computing [0.12099984425168675]
  We present a suite of scalable quantum computing benchmarks developed as key performance indicators (KPIs) within the EU Quantum Flagship.<n>These benchmarks are designed to assess holistic system performance rather than isolated components.
  arXiv  Detail & Related papers  (2025-12-22T18:30:06Z)
• Towards Heterogeneous Quantum Federated Learning: Challenges and Solutions [47.08625631041616]
  Quantum federated learning (QFL) combines quantum computing and federated learning to enable decentralized model training while maintaining data privacy.<n>Existing QFL frameworks largely focus on homogeneity among quantum textcolorblackclients, and they do not account for real-world variances in quantum data distributions, encoding techniques, hardware noise levels, and computational capacity.<n>These differences can create instability during training, slow convergence, and reduce overall model performance.
  arXiv  Detail & Related papers  (2025-11-27T06:35:45Z)
• Benchmarking fault-tolerant quantum computing hardware via QLOPS [2.0464713282534848]
  To run quantum algorithms, it is essential to develop scalable quantum hardware with low noise levels.<n>Various fault-tolerant quantum computing schemes have been developed for different hardware platforms.<n>We propose Quantum Logical Operations Per Second (QLOPS) as a metric for assessing the performance of FTQC schemes.
  arXiv  Detail & Related papers  (2025-07-16T08:31:51Z)
• Quantum Computer Fingerprinting using Error Syndromes [2.680132607018545]
  We propose a strategy to leverage the byproducts of quantum error correction (QEC) to verify hardware identity and authenticate quantum computations for free''<n>By treating syndrome measurements as a source of metadata, we embed verification seamlessly into standard QEC protocols.<n>We validate our approach using multiple error-correcting codes, quantum states, and circuit compilation strategies on several generations of IBM quantum computers.
  arXiv  Detail & Related papers  (2025-06-19T21:23:08Z)
• Post-Variational Ground State Estimation via QPE-Based Quantum Imaginary Time Evolution [0.0]
  We present the QPE-based quantum imaginary time evolution (QPE-QITE) algorithm, designed for post-variational ground state estimation. Unlike variational methods, QPE-QITE employs additional ancillae to project the quantum register into low-energy eigenstates. We demonstrate the capabilities of QPE-QITE by applying it to the low-autocorrelation binary sequences (LABS) problem.
  arXiv  Detail & Related papers  (2025-04-15T18:44:14Z)
• Entanglement detection with quantum support vector machine(QSVM) on near-term quantum devices [0.0]
  This study presents the implementation of quantum support vector machines (QSVMs) on IBM quantum devices to identify and classify entangled states. Our results demonstrate that the QSVM framework achieves over 90% accuracy in distinguishing entangled states, despite hardware noise. This work marks a significant advancement in quantum machine learning for entanglement detection.
  arXiv  Detail & Related papers  (2025-03-30T13:48:05Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• 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)
• Analyzing Quantum Programs with LintQ: A Static Analysis Framework for Qiskit [21.351834312054844]
  This paper presents LintQ, a comprehensive static analysis framework for detecting bugs in quantum programs. Our approach is enabled by a set of abstractions designed to reason about common concepts in quantum computing without referring to the underlying quantum computing platform. We apply the approach to a newly collected dataset of 7,568 real-world Qiskit-based quantum programs, showing that LintQ effectively identifies various programming problems.
  arXiv  Detail & Related papers  (2023-10-01T16:36:09Z)
• Benchmarking a trapped-ion quantum computer with 30 qubits [0.2276773223605655]
  We benchmark a single-chain 30-qubit trapped-ion quantum computer with all-to-all operations. We build a system-level model to predict the application benchmarking data through direct simulation. This highlights that as quantum computers move toward larger and higher-quality devices, characterization becomes more challenging.
  arXiv  Detail & Related papers  (2023-08-09T17:02:55Z)
• Delegated variational quantum algorithms based on quantum homomorphic encryption [69.50567607858659]
  Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices. The private data of clients may be leaked to quantum servers in such a quantum cloud model. A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
  arXiv  Detail & Related papers  (2023-01-25T07:00:13Z)
• Quantum Similarity Testing with Convolutional Neural Networks [4.540894342435848]
  We develop a machine learning algorithm for comparing unknown continuous variable states using limited and noisy data. Our approach is based on a convolutional neural network that assesses the similarity of quantum states based on a lower-dimensional state representation.
  arXiv  Detail & Related papers  (2022-11-03T09:24:23Z)
• Swap Test-based Characterization of Quantum Processes in Universal Quantum Computers [0.0]
  Unreliable quantum processes in universal quantum computers still represent one of the the greatest challenges to be overcome. In this article we verify whether a tool called Swap Test is able to identify decoherence to a quantum system.
  arXiv  Detail & Related papers  (2022-08-04T21:31:49Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• EQUAL: Improving the Fidelity of Quantum Annealers by Injecting Controlled Perturbations [3.594638299627403]
  Existing gate-based quantum computers consist of only a few dozen qubits and are not large enough for most applications. Noise and imperfections in hardware result in sub-optimal solutions on QAs even if the QMI is run for thousands of trials. EQUAL generates an ensemble of QMIs by adding controlled perturbations to the program QMI.
  arXiv  Detail & Related papers  (2021-08-24T21:29:59Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)
• 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)
• Extending C++ for Heterogeneous Quantum-Classical Computing [56.782064931823015]
  qcor is a language extension to C++ and compiler implementation that enables heterogeneous quantum-classical programming, compilation, and execution in a single-source context. Our work provides a first-of-its-kind C++ compiler enabling high-level quantum kernel (function) expression in a quantum-language manner.
  arXiv  Detail & Related papers  (2020-10-08T12:49:07Z)

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.