Branch-Aware Quantum Constant Propagation for Dynamic Quantum Circuits
Abstract
Compile-time optimization is important for improving the efficiency and reliability of quantum circuits on current noisy hardware. While many existing methods simplify circuits using structural patterns or quantum-state information, most of them target only unitary circuits and do not support dynamic circuits with mid-circuit measurements and classical feedforward. In this work, we present Branch-Aware Quantum Constant Propagation (BQCP), a compile-time analysis for dynamic circuits. BQCP extends Quantum Constant Propagation (QCP) by tracking the classical information produced by mid-circuit measurements together with the corresponding post-measurement quantum states across different execution branches. This enables path-sensitive reasoning inside conditional blocks and more precise information propagation than QCP. To keep the analysis scalable, we bound both the size of the quantum-state representation and the number of tracked branches. Using the information inferred by the analysis, we apply semantics-preserving simplifications to circuit operations. We prove the soundness of both the analysis and the simplifications. Experimental results on both application-driven and synthetic benchmarks show that, on dynamic circuits, our method consistently achieves larger reductions than other existing passes including QCP.
Versions
Related
- Classical Pre-Training of Large Shallow Parametrized Quantum Circuits through Pauli Propagation and deployment on Quantum Hardware
- All Unitaries Have Constant Depth Quantum Circuits
- The power of constant-depth quantum circuits of unbounded size
- Separability does not certify zero-noise extrapolation: Factorial diagnostics in dynamic quantum circuits
- Scattering zones in quantum speckle propagation
BibTeX
@misc{fulginiti2026branchaware,
title = {{Branch-Aware Quantum Constant Propagation for Dynamic Quantum Circuits}},
author = {Innocenzo Fulginiti and Yanbin Chen},
howpublished = {arXiv},
year = {2026},
month = jun,
doi = {10.48550/arxiv.2606.02018},
eprint = {2606.02018},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2606.02018},
}
RIS
TY - UNPB
TI - Branch-Aware Quantum Constant Propagation for Dynamic Quantum Circuits
AU - Innocenzo Fulginiti
AU - Yanbin Chen
PY - 2026
DA - 2026/06/01
PB - arXiv
DO - 10.48550/arxiv.2606.02018
UR - https://arxiv.org/abs/2606.02018
AB - Compile-time optimization is important for improving the efficiency and reliability of quantum circuits on current noisy hardware. While many existing methods simplify circuits using structural patterns or quantum-state information, most of them target only unitary circuits and do not support dynamic circuits with mid-circuit measurements and classical feedforward. In this work, we present Branch-Aware Quantum Constant Propagation (BQCP), a compile-time analysis for dynamic circuits. BQCP extends Quantum Constant Propagation (QCP) by tracking the classical information produced by mid-circuit measurements together with the corresponding post-measurement quantum states across different execution branches. This enables path-sensitive reasoning inside conditional blocks and more precise information propagation than QCP. To keep the analysis scalable, we bound both the size of the quantum-state representation and the number of tracked branches. Using the information inferred by the analysis, we apply semantics-preserving simplifications to circuit operations. We prove the soundness of both the analysis and the simplifications. Experimental results on both application-driven and synthetic benchmarks show that, on dynamic circuits, our method consistently achieves larger reductions than other existing passes including QCP.
ER -