Compile-Time Simplification of Classically Controlled Operations in Dynamic Circuits
Abstract
Dynamic circuits use real-time outcomes of mid-circuit measurements, processed by a classical controller, to adapt subsequent operations during circuit execution. This additional flexibility over static circuits comes at a price. Mid-circuit measurements are typically slower and noisier than unitary gates. Furthermore, classical feedforward requires exchanging information between the quantum processor (QPU) and the classical controller, introducing latency that erodes the practical performance of dynamic circuits. We propose a compile-time optimization framework that reduces the use of classical controls in dynamic circuits while preserving their semantics. At its core, the framework uses a static analysis that symbolically executes the circuit by propagating classical information alongside the quantum state. By combining this classical-quantum information with the Probabilistic Circuit Model extended with probabilistic controls that emulate classical feedforward, we obtain an intermediate probabilistic representation of the dynamic circuit. In this representation, mid-circuit measurements and classically controlled operations can be removed or rewritten as purely unitary operations and probabilistic components. Compared to existing compile-time optimizations that target only mid-circuit measurements, our method applies to a broader class of dynamic circuits expressible in modern quantum programming languages. We evaluated our framework on randomly generated dynamic circuits, achieving about 50% classical feedforward reduction and even higher reductions in favorable settings.
Versions
Related
- The cost of simulating classically tractable quantum circuits and dynamics
- Controlled PROP: Theory and Applications to Quantum Circuits
- Controlled-Z Gates via Floquet Coupling to Two Auxiliary States in Transmon Circuits
- Compile-once operation graphs for reusable continuous unitary transformations
- Weakly interacting fermionic Gibbs states are Gaussian mixtures and classically simulable
BibTeX
@misc{fulginiti2026compiletime,
title = {{Compile-Time Simplification of Classically Controlled Operations in Dynamic Circuits}},
author = {Innocenzo Fulginiti and Yanbin Chen and Christian B. Mendl and Helmut Seidl},
howpublished = {arXiv},
year = {2026},
month = may,
doi = {10.48550/arxiv.2605.28439},
eprint = {2605.28439},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2605.28439},
}
RIS
TY - UNPB
TI - Compile-Time Simplification of Classically Controlled Operations in Dynamic Circuits
AU - Innocenzo Fulginiti
AU - Yanbin Chen
AU - Christian B. Mendl
AU - Helmut Seidl
PY - 2026
DA - 2026/05/27
PB - arXiv
DO - 10.48550/arxiv.2605.28439
UR - https://arxiv.org/abs/2605.28439
AB - Dynamic circuits use real-time outcomes of mid-circuit measurements, processed by a classical controller, to adapt subsequent operations during circuit execution. This additional flexibility over static circuits comes at a price. Mid-circuit measurements are typically slower and noisier than unitary gates. Furthermore, classical feedforward requires exchanging information between the quantum processor (QPU) and the classical controller, introducing latency that erodes the practical performance of dynamic circuits. We propose a compile-time optimization framework that reduces the use of classical controls in dynamic circuits while preserving their semantics. At its core, the framework uses a static analysis that symbolically executes the circuit by propagating classical information alongside the quantum state. By combining this classical-quantum information with the Probabilistic Circuit Model extended with probabilistic controls that emulate classical feedforward, we obtain an intermediate probabilistic representation of the dynamic circuit. In this representation, mid-circuit measurements and classically controlled operations can be removed or rewritten as purely unitary operations and probabilistic components. Compared to existing compile-time optimizations that target only mid-circuit measurements, our method applies to a broader class of dynamic circuits expressible in modern quantum programming languages. We evaluated our framework on randomly generated dynamic circuits, achieving about 50% classical feedforward reduction and even higher reductions in favorable settings.
ER -