Quantum Mutant Equivalence via Transpilation

• URL: http://arxiv.org/abs/2606.26604v1
• Date: Thu, 25 Jun 2026 05:06:50 GMT
• Title: Quantum Mutant Equivalence via Transpilation
• Abstract summary: 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.
• Score: 3.414738359803266
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Mutation testing evaluates test suite quality by introducing artificial faults (mutants) and checking whether tests detect (kill) them. A central challenge is the equivalent mutant problem: some mutants are syntactically different from the original program but semantically identical to it and therefore cannot be killed by any test. If left unidentified, such mutants waste testing effort and distort mutation scores. In quantum software, mutation testing is increasingly used, but the equivalent mutant problem remains unsolved. A recent study generated more than 700,000 quantum circuit mutants and found that roughly half survived the available tests, making it unclear whether these survivors reflect weak tests or semantic equivalence. We propose Transpiler-Based Equivalence (TBE), a lightweight approach that identifies equivalent quantum mutants by transpiling original and mutated circuits under the same configuration and comparing their resulting OpenQASM code. We evaluate TBE on 348,299 surviving mutants, 92,011 of which are equivalent; TBE identifies 29,536 of them (32.1%) as equivalent while achieving 100% precision and 82% accuracy.

Related papers

• Search-Based Generation of Undetected Quantum Circuit Mutants [6.401021954274483]
  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.
  arXiv  Detail & Related papers  (2026-08-10T08:58:39Z)
• Post-Operative Glioma Segmentation via Loss Stabilization, Normalization and Subspace Attention [46.03321798937855]
  We show that the standard Generalized Dice Loss (GDL) is unstable under domain shift.<n>We propose a Subspace-Aware Class Attention (SACA) module that re-calibrates the bottleneck features and raises Enhancing Tumor (ET) sensitivity by 8%.
  arXiv  Detail & Related papers  (2026-07-23T09:59:30Z)
• Converted, Not Equivalent: Benchmarking Codebase Conversion via Observational Equivalence [56.25095230687242]
  Coding agents often over-trust their own local validation routines and declare success on artifacts that satisfy surface checks.<n>This problem is especially acute in conversion, where prior evaluation is outcome-driven.<n>Across blind conversion attempts, the best system reaches 26.7--28.9% overall pass rate despite Spec pass rates up to 91.1%.<n>This suggests that failures stem more from contract-misaligned self-validation than from limited budget or backbone strength.
  arXiv  Detail & Related papers  (2026-05-27T19:57:15Z)
• Are Benchmark Tests Strong Enough? Mutation-Guided Diagnosis and Augmentation of Regression Suites [49.16055123488827]
  Insufficiently strong test suites can admit plausible yet semantically incorrect patches, inflating reported success rates.<n>We introduce STING, a framework for targeted test augmentation that uses semantically altered program variants as diagnostic stressors.<n>STING produces 1,014 validated tests spanning 211 instances and increases patch-region line and branch coverage by 10.8% and 9.5%.
  arXiv  Detail & Related papers  (2026-04-02T01:13:40Z)
• Using Fourier Analysis and Mutant Clustering to Accelerate DNN Mutation Testing [0.9617606953987995]
  Deep neural network (DNN) mutation analysis is a promising approach to evaluating test set adequacy.<n>We present a technique, named DM#, for accelerating mutation testing using Fourier analysis.<n>Our results provide empirical evidence on the effectiveness of DM# in accelerating mutation testing by 28.38%, on average, at the average cost of only 0.72% error in mutation score.
  arXiv  Detail & Related papers  (2025-10-03T04:36:42Z)
• Latent Space Class Dispersion: Effective Test Data Quality Assessment for DNNs [45.129846925131055]
  Latent Space Class Dispersion (LSCD) is a novel metric to quantify the quality of test datasets for Deep Neural Networks (DNNs)<n>Our empirical study shows that LSCD reveals and quantifies deficiencies in the test dataset of three popular benchmarks pertaining to image classification tasks.
  arXiv  Detail & Related papers  (2025-03-24T15:45:50Z)
• 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)
• Latent Mutants: A large-scale study on the Interplay between mutation testing and software evolution [2.1984302611206537]
  We study the characteristics of what we call latent mutants, i.e., the mutants that are live in one version and killed in later revisions.<n>We examine 131,308 mutants generated by Pitest on 13 open-source projects.
  arXiv  Detail & Related papers  (2025-01-03T15:44:38Z)
• 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)
• Statistical and Computational Phase Transitions in Group Testing [73.55361918807883]
  We study the group testing problem where the goal is to identify a set of k infected individuals carrying a rare disease. We consider two different simple random procedures for assigning individuals tests.
  arXiv  Detail & Related papers  (2022-06-15T16:38: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.