Metraipolis › archive › dc_090b8437d136
Irene: Equivalence Checking of Hybrid Quantum Programs via Structure-Preserving Symbolic Reduction — arXiv:2609.36065
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.36065
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T17:59:06.890Z
- SHA-256 of the archived text
7abc451b30753036a8d7fa137b199983af1ee3908c8ff193fbb13344c4547334- Stable URL of this page
https://metraipolis.com/documento/dc_090b8437d136
How to cite
Irene: Equivalence Checking of Hybrid Quantum Programs via Structure-Preserving Symbolic Reduction — arXiv:2609.36065 — arXiv (en), https://arxiv.org/abs/2609.36065 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_090b8437d136 (Metraipolis archive dc_090b8437d136, sha256 7abc451b30753036a8d7fa137b199983af1ee3908c8ff193fbb13344c4547334)
BibTeX
@misc{dc090b8437d136,
title = {Irene: Equivalence Checking of Hybrid Quantum Programs via Structure-Preserving Symbolic Reduction — arXiv:2609.36065},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.36065},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_090b8437d136; sha256 7abc451b30753036a8d7fa137b199983af1ee3908c8ff193fbb13344c4547334},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.36065. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Equivalence checking is essential for validating compiler transformations of hybrid quantum programs, which combine quantum operations, measurements, and classical control. Measurement-dependent control limits unitary reasoning, while dependencies between classical outcomes and quantum operations can enlarge intermediate symbolic states. We present Irene, an equivalence-checking framework for bounded hybrid quantum programs based on structure-preserving symbolic reduction. The framework progressively simplifies equivalence obligations through three levels of reasoning. At the gate level, algebraic identities simplify unitary regions. At the hybrid path-sum (HPS) level, reduced symbolic execution states are represented as typed graphs, whose isomorphism certifies equivalence. Remaining obligations are handled by density kernels that characterize transformations of input density operators into observable outputs, allowing comparison even when internal measurement histories differ. Residual coefficient differences are encoded as SMT queries. A common set of symbolic reductions supports HPS and density-kernel reasoning by preserving factored Boolean and arithmetic expressions, eliminating reducible dependencies before expanding residual sums. We evaluate Irene against five equivalence checkers on 1,982 program pairs from seven benchmark suites. Irene solves 1,584 pairs (79.92%), compared with 57.52% for MQT QCEC, the baseline with the highest aggregate coverage, with a mean end-to-end time of 3.93 seconds per solved pair. Applied as an equivalence-checking oracle, Irene also identifies 15 previously unknown bugs in quantum compilers, including Qiskit, Cirq, and PennyLane. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-09-30 in cs.SE). Categorie arXiv: Programming Languages (cs.PL) ; Logic in Computer Science (cs.LO); Software Engineering (cs.SE). Pagina del lavoro: https://arxiv.org/abs/2609.36065 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-07T17:31:52.024Z dalla pagina https://arxiv.org/catchup/cs.SE/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).