Using quantum annealing to generate test cases for cyber-physical systems

• URL: http://arxiv.org/abs/2504.21684v1
• Date: Wed, 30 Apr 2025 14:20:58 GMT
• Title: Using quantum annealing to generate test cases for cyber-physical systems
• Authors: Hugo Araujo, Xinyi Wang, Mohammad Mousavi, Shaukat Ali,
• Abstract summary: We propose a mutation-based approach to enhance test case generation for Cyber-Physical Systems.<n>We use quantum annealing to identify and target critical regions of the test cases for improvement.<n>Our approach mechanises this process into an algorithm that uses D-Wave's quantum annealer to find the solution.
• Score: 35.26972474219581
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Quantum computing has emerged as a powerful tool to efficiently solve computational challenges, particularly in simulation and optimisation. However, hardware limitations prevent quantum computers from achieving the full theoretical potential. Among the quantum algorithms, quantum annealing is a prime candidate to solve optimisation problems. This makes it a natural candidate for search-based software testing in the Cyber-Physical Systems (CPS) domain, which demands effective test cases due to their safety-critical nature. This work explores the use of quantum annealing to enhance test case generation for CPS through a mutation-based approach. We encode test case mutation as a binary optimisation problem, and use quantum annealing to identify and target critical regions of the test cases for improvement. Our approach mechanises this process into an algorithm that uses D-Wave's quantum annealer to find the solution. As a main contribution, we offer insights into how quantum annealing can advance software testing methodologies by empirically evaluating the correlation between problem size, hardware limitations, and the effectiveness of the results. Moreover, we compare the proposed method against state-of-the-art classical optimisation algorithms, targeting efficiency (time to generate test cases) and effectiveness (fault detection rates). Results indicate that quantum annealing enables faster test case generation while achieving comparable fault detection performance to state-of-the-art alternatives.

Related papers

• A Preliminary Investigation on the Usage of Quantum Approximate Optimization Algorithms for Test Case Selection [2.1929683225837078]
  This work envisions the usage of Quantum Approximate Optimization Algorithms (QAOAs) for test case selection.<n>QAOAs merge the potential of gate-based quantum machines with the optimization capabilities of the adiabatic evolution.<n>Our results show that QAOAs perform better than the baseline algorithms in effectiveness while being comparable to SelectQA in terms of efficiency.
  arXiv  Detail & Related papers  (2025-04-26T15:38:01Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Optimization Applications as Quantum Performance Benchmarks [0.0]
  Combinatorial optimization is anticipated to be one of the primary use cases for quantum computation in the coming years. Inspired by existing methods to characterize classical optimization algorithms, we analyze the solution quality obtained by solving Max-Cut problems. This is used to guide the development of an advanced benchmarking framework for quantum computers.
  arXiv  Detail & Related papers  (2023-02-05T01:56:06Z)
• Experimental Implementation of an Efficient Test of Quantumness [49.588006756321704]
  A test of quantumness is a protocol where a classical user issues challenges to a quantum device to determine if it exhibits non-classical behavior. Recent attempts to implement such tests on current quantum computers rely on either interactive challenges with efficient verification, or non-interactive challenges with inefficient (exponential time) verification.
  arXiv  Detail & Related papers  (2022-09-28T18:00:04Z)
• 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)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Quantum Annealing for Industry Applications: Introduction and Review [0.0]
  In recent years, advances in quantum technologies have enabled the development of small- and intermediate-scale quantum processors. We provide a literature review of the theoretical motivations for quantum annealing, the software and hardware that is required to use such quantum processors, and the state-of-the-art applications and proofs-of-concepts that have been demonstrated using them.
  arXiv  Detail & Related papers  (2021-12-14T15:58:30Z)
• 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)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)
• To quantum or not to quantum: towards algorithm selection in near-term quantum optimization [0.0]
  We study the problem of detecting problem instances of where QAOA is most likely to yield an advantage over a conventional algorithm. We achieve cross-validated accuracy well over 96%, which would yield a substantial practical advantage.
  arXiv  Detail & Related papers  (2020-01-22T20:42:02Z)

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.