Skip to content
DraconiticResearch
Search Sources API
197,788 studies31 sourcesUpdated 34 min ago
PreprintCC BY 4.0arXiv

What Output-Equivalence Oracles Miss: An Empirical Study of Equivalence-Invisible Bug Fixes in Quantum Transpilers

Abstract

Quantum compilers face the test oracle problem, judged by an output-equivalence oracle: the compiled circuit must compute the same unitary as the original, modulo global phase and a qubit-layout permutation. This oracle, by construction, checks only that semantic map, not the circuit's own layout, permutation, or phase records: a defect there, or in a fixed-seed run's determinism, can pass unseen though the record is public. This empirical software engineering study of quantum transpiler correctness uses repository mining to measure how often this happens in real merged compiler fixes: a systematically identified corpus of Qiskit transpiler bug-fixes, classified by an independently dual-coded, source-validated fault-manifestation taxonomy. Nineteen of 68 fixes (28%, 95% Wilson CI 19-40%) repair faults invisible to this equivalence screen, even one augmented with compilation-validity, circuit-quality, and performance checks, and an extended 104-fix corpus over a wider window holds at the same rate with a tighter interval (29/104, 27.9%, CI 20-37%). A conservative floor remains even restricted to the one unconditionally equivalence-invisible channel (a corrupted layout or permutation record): 10 of 68 fixes (15%, CI 8-25%) beneath the 28% headline. The gap is not Qiskit-specific: it replicates in tket (7/21, 33%), with Cirq smaller but consistent. We detected no systematic differences on five inexpensive PR-level characteristics (19 vs 49, underpowered alone; the extended 29-vs-75 corpus tightens every interval toward zero). This class dominates the invisible set, concentrating at representation-boundary crossings. We release the corpus, codebook, and coding artifacts for quantum software testing research. Here we only measure it.

Related

  1. Fault-Class-Matched Test Oracles for Output-Invisible Quantum Transpiler Regressions
    Furqan Nasir, Arif Shah, Iftikhar Alam
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  2. How to make quantum cheese: efficient geometry oracles for exponentially many pseudorandom microstructures
    Alice Barthe
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  3. Spectral theory of energy-selective quantum search with Ising Hamiltonian phase oracles
    A. S. Plyashechnik, A. A. Zhukov, A. V. Lebedev +1
    arXivPreprintarXiv licenceFull textCondensed matterQuantum physics & quantum informationarXiv
  4. Modeling and Resource Optimization for Quantum Oracles
    Zhihang Li, Bo Zhao, Chuanbing Han +6
    arXivPreprintCC0Full textQuantum physics & quantum informationarXiv
  5. QEncodeBench: Can Large Language Models Encode Classical Problems into Verified Quantum Oracles?
    Xujun Che, Hanhan Wu, Yuchen Yuan +1
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
BibTeX
@misc{nasir2026what,
  title = {{What Output-Equivalence Oracles Miss: An Empirical Study of Equivalence-Invisible Bug Fixes in Quantum Transpilers}},
  author = {Furqan Nasir and Arif Shah and Iftikhar Alam},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.13839},
  eprint = {2609.13839},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.13839},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - What Output-Equivalence Oracles Miss: An Empirical Study of Equivalence-Invisible Bug Fixes in Quantum Transpilers
AU  - Furqan Nasir
AU  - Arif Shah
AU  - Iftikhar Alam
PY  - 2026
DA  - 2026/09/22
PB  - arXiv
DO  - 10.48550/arxiv.2609.13839
UR  - https://arxiv.org/abs/2609.13839
AB  - Quantum compilers face the test oracle problem, judged by an output-equivalence oracle: the compiled circuit must compute the same unitary as the original, modulo global phase and a qubit-layout permutation. This oracle, by construction, checks only that semantic map, not the circuit's own layout, permutation, or phase records: a defect there, or in a fixed-seed run's determinism, can pass unseen though the record is public. This empirical software engineering study of quantum transpiler correctness uses repository mining to measure how often this happens in real merged compiler fixes: a systematically identified corpus of Qiskit transpiler bug-fixes, classified by an independently dual-coded, source-validated fault-manifestation taxonomy. Nineteen of 68 fixes (28%, 95% Wilson CI 19-40%) repair faults invisible to this equivalence screen, even one augmented with compilation-validity, circuit-quality, and performance checks, and an extended 104-fix corpus over a wider window holds at the same rate with a tighter interval (29/104, 27.9%, CI 20-37%). A conservative floor remains even restricted to the one unconditionally equivalence-invisible channel (a corrupted layout or permutation record): 10 of 68 fixes (15%, CI 8-25%) beneath the 28% headline. The gap is not Qiskit-specific: it replicates in tket (7/21, 33%), with Cirq smaller but consistent. We detected no systematic differences on five inexpensive PR-level characteristics (19 vs 49, underpowered alone; the extended 29-vs-75 corpus tightens every interval toward zero). This class dominates the invisible set, concentrating at representation-boundary crossings. We release the corpus, codebook, and coding artifacts for quantum software testing research. Here we only measure it.
ER  -