Irene: Equivalence Checking of Hybrid Quantum Programs via Structure-Preserving Symbolic Reduction

2026-09-28

AI Summary

This study addresses the challenges of symbolic state explosion and equivalence determination in hybrid quantum compiler verification, caused by measurement-dependent control flow and classical-quantum coupling. We propose an equivalence checking framework based on structure-preserving symbolic reduction that simplifies verification obligations through three-level reasoning: gate-level, path-sum, and density-kernel. This work introduces a novel mechanism combining type-graph isomorphism with density-kernel analysis to effectively verify equivalence despite divergent internal measurement histories, integrating symbolic execution with SMT solving for multi-level formal verification. Evaluated on 1,982 benchmarks, our approach achieves a 79.92% solving rate with an average runtime of 3.93 seconds, uncovering 15 previously unknown bugs in mainstream compilers such as Qiskit.

Abstract

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.

Problem

• Equivalence Checking
• Hybrid Quantum Programs
• Compiler Validation
• Symbolic Reduction

Innovation

• Equivalence Checking
• Hybrid Quantum Programs
• Structure-Preserving Symbolic Reduction
• Hybrid Path-Sum
• Density Kernels