Search-Based Generation of Undetected Quantum Circuit Mutants

• URL: http://arxiv.org/abs/2608.09318v1
• Date: Mon, 10 Aug 2026 08:58:39 GMT
• Title: Search-Based Generation of Undetected Quantum Circuit Mutants
• Abstract summary: We propose a search-based approach for generating challenging mutants by utilising parameterisable quantum gates.<n>QUMUG employs search algorithms to optimise mutation parameters and find non-equivalent mutants passing a given test suite.
• Score: 6.401021954274483
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum mutation analysis is emerging as an essential technique for evaluating test suites due to the limited availability of real faulty quantum programs. However, existing quantum mutation analysis tools use fixed gate-based mutations, resulting in easy-to-detect mutants, which reduces their effectiveness in assessing the quality of test suites. We propose QUMUG, a search-based approach for generating challenging mutants by utilising parameterisable quantum gates. QUMUG employs search algorithms to optimise mutation parameters and find non-equivalent mutants passing a given test suite. In our evaluation over 30 quantum programs, QUMUG produced mutants that are three times more challenging than the mutants generated by existing tools. Among the four evaluated search algorithms, the genetic algorithm was the most effective, generating an average of 494 undetected mutants per program with a 99.67% success rate and 94.3% non-equivalent ratio. The generated mutants demonstrated their effectiveness by requiring the addition of five times more test cases to the test suite than the mutants generated by existing tools. We also analysed the behaviour of higher order mutants in quantum circuits, and showed that while first order mutations are more effective for enhancing the test suite, higher order mutants highlight the need for new unique test cases.

Related papers

• Quantum Mutant Equivalence via Transpilation [3.414738359803266]
  In quantum software, mutation testing is increasingly used, but the equivalent mutant problem remains unsolved.<n>We propose Transpiler-Based Equivalence (TBE), a lightweight approach that identifies equivalent quantum mutants by transpiling original and mutated circuits.
  arXiv  Detail & Related papers  (2026-06-25T05:06:50Z)
• QMutBench: A Dataset of Quantum Circuit Mutants [6.401021954274483]
  QMutBench is a dataset that contains over 700,000 quantum circuit mutants representing different faults.<n>The dataset is accessible via an online interface with selection criteria.<n>It enables the development of new mutation-guided quantum software testing techniques.
  arXiv  Detail & Related papers  (2026-04-17T09:20:55Z)
• Accurate de novo sequencing of the modified proteome with OmniNovo [39.43336836259004]
  We introduce OmniNovo, a unified deep learning framework for reference-free sequencing of peptides directly from tandem mass spectra.<n>By integrating a mass-constrained decoding algorithm with rigorous false discovery rate estimation, OmniNovo achieves state-of-the-art accuracy, identifying 51% more peptides than standard approaches at a 1% false discovery rate.<n> Crucially, the model generalizes to biological sites unseen during training, illuminating the dark matter of the proteome and enabling unbiased comprehensive analysis of cellular regulation.
  arXiv  Detail & Related papers  (2025-12-13T10:27:14Z)
• Don't Throw Away Your Beams: Improving Consistency-based Uncertainties in LLMs via Beam Search [111.6996614063716]
  We introduce a new family of methods that employ beam search to generate candidates for consistency-based uncertainty estimates.<n>We empirically evaluate our approach on six QA datasets and find that its consistent improvements over multinomial sampling lead to state-of-the-art UQ performance.
  arXiv  Detail & Related papers  (2025-12-10T11:24:29Z)
• MutDafny: A Mutation-Based Approach to Assess Dafny Specifications [46.0054630008219]
  We present MutDafny, a tool that increases the reliability of Dafny specifications by automatically signaling potential weaknesses.<n>We analyze mutation operators from popular tools, identifying the ones applicable to Dafny.<n>We evaluate MutDafny's effectiveness and efficiency in a dataset of 794 real-world Dafny programs.
  arXiv  Detail & Related papers  (2025-11-19T12:58:06Z)
• Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
  We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
  arXiv  Detail & Related papers  (2025-07-09T15:22:17Z)
• A Simple yet Effective DDG Predictor is An Unsupervised Antibody Optimizer and Explainer [53.85265022754878]
  We propose a lightweight DDG predictor (Light-DDG) for fast mutation screening.<n>We also release a large-scale dataset containing millions of mutation data for pre-training Light-DDG.<n>For the target antibody, we propose a novel Mutation Explainer to learn mutation preferences.
  arXiv  Detail & Related papers  (2025-02-10T09:26:57Z)
• METFORD -- Mutation tEsTing Framework fOR anDroid [0.0]
  This research aims to contribute to reducing Android mutation testing costs.<n>It implements mutation testing operators according to mutant schemata.<n>Additional mutation operators can be implemented in JavaScript and easily integrated into the framework.
  arXiv  Detail & Related papers  (2025-01-06T09:36:57Z)
• A Comprehensive Study on Large Language Models for Mutation Testing [36.00296047226433]
  Large Language Models (LLMs) have recently been used to generate mutants in both research work and in industrial practice.<n>We evaluate BugFarm and LLMorpheus (the two state-of-the-art LLM-based approaches) on 851 real bugs from two Java real-world bug benchmarks.<n>Our results reveal that, compared to existing rule-based approaches, LLMs generate more diverse mutants, that are behaviorally closer to real bugs and, most importantly, with 111.29% higher fault detection.
  arXiv  Detail & Related papers  (2024-06-14T08:49:41Z)
• An Empirical Evaluation of Manually Created Equivalent Mutants [54.02049952279685]
  Less than 10 % of manually created mutants are equivalent. Surprisingly, our findings indicate that a significant portion of developers struggle to accurately identify equivalent mutants.
  arXiv  Detail & Related papers  (2024-04-14T13:04:10Z)
• Towards a tailored mixed-precision sub-8-bit quantization scheme for Gated Recurrent Units using Genetic Algorithms [39.979007027634196]
  Gated Recurrent Units (GRU) are difficult to tune due to their dependence on an internal state. We propose a modular integer quantization scheme for GRUs where the bit width of each operator can be selected independently.
  arXiv  Detail & Related papers  (2024-02-19T16:24:20Z)
• Tree Search-Based Evolutionary Bandits for Protein Sequence Optimization [44.356888079704156]
  Protein engineering is a daunting task due to the vast sequence space of any given protein. Protein engineering is typically conducted through an iterative process of adding mutations to the wild-type or lead sequences. We propose a tree search-based bandit learning method, which expands a tree starting from the initial sequence with the guidance of a bandit machine learning model.
  arXiv  Detail & Related papers  (2024-01-08T06:33:27Z)
• Quantum Circuit Mutants: Empirical Analysis and Recommendations [7.582630148228262]
  We present a large-scale empirical evaluation with more than 700K faulty benchmarks (quantum circuits) generated by mutating 382 real-world quantum circuits.<n>Based on the results, we provide valuable insights for researchers to define systematic quantum mutation analysis techniques.
  arXiv  Detail & Related papers  (2023-11-28T16:15:50Z)

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.