Toward Circuit-Aware Mutation Testing for Quantum Programs: Exact Visibility and Execution Planning
Abstract
Mutation testing assesses test suites by introducing program changes and checking whether tests detect them. In quantum programs, a surviving mutant may leave program behavior unchanged, produce a change hidden by the chosen input or measurement, or remain undetected because statistical evidence is insufficient. We develop a circuit-aware framework to distinguish these causes and guide execution planning and test changes. The framework covers ideal, noiseless programs and mutations that replace one gate or subcircuit. The method traces how a mutation can affect measured outputs and combines established mathematical checks with statistical estimates. For supported cases, we establish conditions under which a test cannot reveal a mutation and exact formulas for its effect when the required state information is available. Under stated assumptions, we bound the mutation score while retaining surviving and unresolved mutants, and identify a restricted circuit family whose mutation effects admit efficient classical classification. The deliverables include a decision procedure, mathematical guarantees, worked examples of test changes and their implementation requirements, and a small-circuit reference implementation for differential expectation tests. These results help testers decide what to execute, what to change, and what remains unknown. The evidence is limited to proofs and executable examples under the ideal model.
Related
- An Efficient Quantum Circuit for Flow Model Execution Using Quantum Neural Networks
- Parallel Circuit Execution for Scalable Quantum Computation
- ArcTN: Efficient Tensor-Network Contraction Planning for Quantum Circuit Simulation
- High-Visibility Energy-Time Franson Interference with Cascaded PPLN and PIC Analyzers
- Fault-tolerant execution of error-corrected quantum algorithms
BibTeX
@misc{miranskyy2026toward,
title = {{Toward Circuit-Aware Mutation Testing for Quantum Programs: Exact Visibility and Execution Planning}},
author = {Andriy Miranskyy and Jose Campos},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.36976},
eprint = {2610.36976},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.36976},
}
RIS
TY - UNPB
TI - Toward Circuit-Aware Mutation Testing for Quantum Programs: Exact Visibility and Execution Planning
AU - Andriy Miranskyy
AU - Jose Campos
PY - 2026
DA - 2026/10/27
PB - arXiv
DO - 10.48550/arxiv.2610.36976
UR - https://arxiv.org/abs/2610.36976
AB - Mutation testing assesses test suites by introducing program changes and checking whether tests detect them. In quantum programs, a surviving mutant may leave program behavior unchanged, produce a change hidden by the chosen input or measurement, or remain undetected because statistical evidence is insufficient. We develop a circuit-aware framework to distinguish these causes and guide execution planning and test changes. The framework covers ideal, noiseless programs and mutations that replace one gate or subcircuit. The method traces how a mutation can affect measured outputs and combines established mathematical checks with statistical estimates. For supported cases, we establish conditions under which a test cannot reveal a mutation and exact formulas for its effect when the required state information is available. Under stated assumptions, we bound the mutation score while retaining surviving and unresolved mutants, and identify a restricted circuit family whose mutation effects admit efficient classical classification. The deliverables include a decision procedure, mathematical guarantees, worked examples of test changes and their implementation requirements, and a small-circuit reference implementation for differential expectation tests. These results help testers decide what to execute, what to change, and what remains unknown. The evidence is limited to proofs and executable examples under the ideal model.
ER -