Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A physical decision boundary for dynamic versus unitary quantum circuits

LapYuen LEE

Published Sep 4, 2026• 0 citations
Publisher

Abstract

Classical control flow via mid-circuit measurement is mathematically permitted in quantum computation and is the standard execution model for current hardware. We show that it is not, however,the physically optimal implementation strategy for deep quantum circuits. The cost of each mid-circuitmeasurement decomposes into a physics-bounded component (projection destroys coherence) and anengineering-bounded component (feedback latency introduces decoherence); the former is irreducible,while the latter tracks hardware progress but retains a physical floor set by dispersive readout. Gatefidelity, by contrast, improves with materials engineering and carries no measurement penalty. We formalize this asymmetry as a strategy bifurcation criterion: for any hardware generation, there exists acircuit depth N∗ above which pure unitary execution achieves strictly higher fidelity than dynamic execution. We measure N∗ ≈ 4 on IBM’s 156-qubit Heron processor and verify the predicted monotonicdivergence to N = 31, where the dynamic approach yields zero counts while the pure unitary approachretains 0.9% fidelity. The per-step fidelity ratio is ∼1.20, independent of the controlled operation’s depth.Projecting across hardware generations, the absolute executable depth advantage remains ∼30×, but N∗trends toward zero: by 2036, pure unitary execution is the optimal strategy at all depths. We provide acompilation framework that translates all four algorithmic control structures (for, if, switch, while) intopure unitary circuits, validated on four quantum platforms spanning three hardware modalities. The result is a hardware-aware control strategy selection: for algorithms with conditional depth exceeding N∗,compilers should default to static unitary expansion rather than dynamic measurement-feedback.

DOI
10.5281/zenodo.22311212

Related papers

Observation of feedback-directed quantum dynamics in large-scale quantum processors

Ruizhe Shen, Ching Hua Lee

Programmable quantum hardware provides an emerging platform for exploring and controlling non-unitary quantum dynamics through measurement-based operations. In this work, we introduce feedback-directed circuit architectures that integrate spatially structured mid-circuit measurements with real-time conditional operations to steer the evolution of random dynamics, and perform their large-scale simulations (up to 100 qubits) on programmable digital quantum processors. By promoting measurement from a passive readout to an active control signal, these adaptive monitored circuits enable directional information flow and generate intrinsic asymmetry in random circuit simulations. We implement this framework on IBM superconducting quantum processors and observe robust, noise-resilient signatures of feedback-induced asymmetry distinct from the more well-known non-Hermitian skin effect. Our results establish feedback as a programmable resource for non-unitary control, opening new avenues for engineering measurement-based dynamics, non-equilibrium phenomena, and tunable open-system behavior on large-scale quantum hardware.

quant-pharXiv:2604.11900•Apr 15, 2026•10 citations

Constant-Depth Quantum Imaginary Time Evolution Using Dynamic Fan-out Circuits

Albert Lund, Erika Magnusson, Werner Dobrautz +1 more

Dynamic quantum circuits combine mid-circuit measurement with classical feed-forward, enabling circuit constructions with reduced entangling-gate depth. Here, we investigate their use in Quantum Imaginary Time Evolution (QITE), where circuit depth and parameter growth limit practical implementations of ground-state preparation. For dense classical optimization Hamiltonians, we introduce a reduced-parameter QITE ansatz that restricts entanglement generation via a small set of control qubits, enabling each QITE layer to be implemented with constant two-qubit gate depth using fan-out-based dynamic circuits. In noiseless simulations of exact cover and set partitioning instances, the reduced ansatz yields a higher success probability than standard QITE approaches. We implement unitary, dynamic fan-out, and semi-classical adaptive variants on IBM superconducting hardware. The semi-classical variant performs favorably to the unitary implementation, while the fully dynamic construction exposes the trade-offs between entangling-depth reduction and measurement and feed-forward overhead associated to dynamic circuit implementations. Using a fidelity threshold of 0.5 relative to the noiseless QITE ansatz, we show that dynamic fan-out based QITE would outperform unitary implementations on current devices when the measurement and two-qubit gate errors are reduced by 65% and the feedback latency is halved.

quant-pharXiv:2603.05156•Mar 6, 2026•3 citations

Scalable Benchmarking Framework for Dynamic Quantum Circuits

Sumeet Shirgure, Efekan Kökcü, Anupam Mitra +3 more

Dynamic quantum circuits with mid-circuit measurements (MCMs) and feed-forward operations play a crucial role in various applications, such as quantum error correction and quantum algorithms. With advancements in quantum hardware enabling the implementation of MCM and feed-forward loops, the use of dynamic circuits has become increasingly prevalent. There is a significant need for a benchmarking framework specially designed for dynamic circuits to capture their unique properties, as current benchmarking tools are designed primarily for unitary circuits and cannot be trivially extended to dynamic circuits. We propose dynamarq, a scalable and hardware-agnostic benchmarking framework for dynamic circuits. We collect a set of dynamic circuit benchmarks spanning various applications and propose a broad set of circuit features to characterize the structure of these dynamic circuits. We run them on two IBM quantum processors and the Quantinuum Helios-1E emulator, and propose scalable, application-dependent fidelity scores for each benchmark based on hardware execution results. We perform statistical modeling to identify correlations between circuit features and fidelity scores, and demonstrate highly accurate fidelity prediction using our model. Our model parameters are also transferable across hardware backends and calibration cycles. Our framework facilitates the understanding of dynamic circuit structures and provides insights for designing and optimizing dynamic circuits to achieve high execution fidelity on quantum hardware.

quant-pharXiv:2604.03360•Apr 6, 2026•5 citations

Compile-Time Simplification of Classically Controlled Operations in Dynamic Circuits

Innocenzo Fulginiti, Yanbin Chen, Christian B. Mendl +1 more

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.

quant-pharXiv:2605.28439•ISC High Performance (ISC)•May 28, 2026•1 citation

Error Mitigation in Dynamic Circuits for Hamiltonian Simulation

Sumeet Shirgure, Siyuan Niu

Dynamic quantum circuits integrate mid-circuit measurements and feed-forward operations to enable real-time classical processing and conditional quantum logic. These capabilities are central to key quantum protocols such as quantum error correction, and have recently demonstrated significant potential for reducing quantum resources, including circuit depth and gate count, across a range of applications. However, executing dynamic circuits on real quantum hardware introduces a critical trade-off: while resource requirements decrease, circuit fidelity degrades due to high error rates of mid-circuit measurements, as well as the decoherence errors accumulated during the extended idle periods introduced by both mid-circuit measurements and feed-forward operations. In this paper, we systematically investigate the impact of standard error mitigation techniques on dynamic circuit applications pertaining to Hamiltonian simulation and ground state estimation of physically relevant systems like the Heisenberg model. We explore dynamical decoupling (DD) as a strategy to suppress decoherence and crosstalk errors during idle windows introduced by mid-circuit measurements and feed-forward delays, and also examine error mitigation via zero-noise extrapolation (ZNE). Through experiments conducted on IBM quantum hardware, we benchmark effective combinations of these strategies that maximize the practical benefits of dynamic quantum circuits in these applications. We demonstrate that a combination of DD and ZNE is effective in mitigating the errors introduced during mid-circuit measurements and feed-forward operations, as well as the errors arising from faulty measurements. This approach yields a energy gap improvement of at least 60% in ground state estimation and reduces observed error of time-evolved states by up to 99% for the Ising model and up to 20% for the Heisenberg model.

quant-pharXiv:2605.05256•ACM Great Lakes Symposium on VLSI (GLSVLSI)•May 7, 2026•3 citations

End-to-End Fidelity Analysis of Quantum Circuit Optimization: From Gate-Level Transformations to Pulse-Level Control

Rylan Malarchick

We present an analysis of quantum circuit fidelity across the full compilation stack, from high-level gate optimization through pulse-level control. We connect a C++ circuit optimizer to a per-gate Lindblad master-equation fidelity model whose decoherence channels are cross-validated against qiskit-dynamics and whose absolute predictions are benchmarked against execution on real hardware. Across a campaign of 4,452 experiment runs over 371 benchmark circuits, gate cancellation provides the dominant improvement ($d = 1.66$, 72% of circuits improved), while circuit size and pulse duration are the strongest negative predictors of process fidelity (input gates $r = -0.78$; pulse duration $r = -0.73$, $R^2 = 0.53$). A formal ablation study shows that pass ordering has no significant effect on two-qubit gate reduction (Kruskal--Wallis $p = 0.302$). Comparing against Qiskit transpilation levels, we show that two-qubit gate count, not total gate count, is the hardware-relevant metric: our optimizer attains superior two-qubit reduction on structured circuits (87.8% on QFT, 100% on QAOA) whereas Qiskit's larger total-gate reduction is dominated by single-qubit ($u_3$) consolidation. Finally, executing eight circuits on the IQM Resonance Garnet processor (8/8 jobs completed, job identifiers released) reveals that the model is a consistent upper bound: it preserves the relative difficulty ordering of circuits but overestimates absolute fidelity by a mean of 0.49, quantifying the error budget (crosstalk, leakage, readout) outside a $T_1$/$T_2$/depolarizing model. We release the framework, data, and scripts as open source.

quant-pharXiv:2601.20871•Jan 20, 2026•0 citations
Classical control flow via mid-circuit measurement is mathematically permitted in quantum computation and is the standard execution model for current hardware. We show that it is not, however,the physically optimal implementation strategy for deep quantum circuits. The cost of each mid-circuitmeasurement decomposes into a physics-bounded component (projection destroys coherence) and anengineering-bounded component (feedback latency introduces decoherence); the former is irreducible,while the latter tracks hardware progress but retains a physical floor set by dispersive readout. Gatefidelity, by contrast, improves with materials engineering and carries no measurement penalty. We formalize this asymmetry as a strategy bifurcation criterion: for any hardware generation, there exists acircuit depth N∗ above which pure unitary execution achieves strictly higher fidelity than dynamic execution. We measure N∗ ≈ 4 on IBM’s 156-qubit Heron processor and verify the predicted monotonicdivergence to N = 31, where the dynamic approach yields zero counts while the pure unitary approachretains 0.9% fidelity. The per-step fidelity ratio is ∼1.20, independent of the controlled operation’s depth.Projecting across hardware generations, the absolute executable depth advantage remains ∼30×, but N∗trends toward zero: by 2036, pure unitary execution is the optimal strategy at all depths. We provide acompilation framework that translates all four algorithmic control structures (for, if, switch, while) intopure unitary circuits, validated on four quantum platforms spanning three hardware modalities. The result is a hardware-aware control strategy selection: for algorithms with conditional depth exceeding N∗,compilers should default to static unitary expansion rather than dynamic measurement-feedback.
Programmable quantum hardware provides an emerging platform for exploring and controlling non-unitary quantum dynamics through measurement-based operations. In this work, we introduce feedback-directed circuit architectures that integrate spatially structured mid-circuit measurements with real-time conditional operations to steer the evolution of random dynamics, and perform their large-scale simulations (up to 100 qubits) on programmable digital quantum processors. By promoting measurement from a passive readout to an active control signal, these adaptive monitored circuits enable directional information flow and generate intrinsic asymmetry in random circuit simulations. We implement this framework on IBM superconducting quantum processors and observe robust, noise-resilient signatures of feedback-induced asymmetry distinct from the more well-known non-Hermitian skin effect. Our results establish feedback as a programmable resource for non-unitary control, opening new avenues for engineering measurement-based dynamics, non-equilibrium phenomena, and tunable open-system behavior on large-scale quantum hardware.
Dynamic quantum circuits combine mid-circuit measurement with classical feed-forward, enabling circuit constructions with reduced entangling-gate depth. Here, we investigate their use in Quantum Imaginary Time Evolution (QITE), where circuit depth and parameter growth limit practical implementations of ground-state preparation. For dense classical optimization Hamiltonians, we introduce a reduced-parameter QITE ansatz that restricts entanglement generation via a small set of control qubits, enabling each QITE layer to be implemented with constant two-qubit gate depth using fan-out-based dynamic circuits. In noiseless simulations of exact cover and set partitioning instances, the reduced ansatz yields a higher success probability than standard QITE approaches. We implement unitary, dynamic fan-out, and semi-classical adaptive variants on IBM superconducting hardware. The semi-classical variant performs favorably to the unitary implementation, while the fully dynamic construction exposes the trade-offs between entangling-depth reduction and measurement and feed-forward overhead associated to dynamic circuit implementations. Using a fidelity threshold of 0.5 relative to the noiseless QITE ansatz, we show that dynamic fan-out based QITE would outperform unitary implementations on current devices when the measurement and two-qubit gate errors are reduced by 65% and the feedback latency is halved.
Dynamic quantum circuits with mid-circuit measurements (MCMs) and feed-forward operations play a crucial role in various applications, such as quantum error correction and quantum algorithms. With advancements in quantum hardware enabling the implementation of MCM and feed-forward loops, the use of dynamic circuits has become increasingly prevalent. There is a significant need for a benchmarking framework specially designed for dynamic circuits to capture their unique properties, as current benchmarking tools are designed primarily for unitary circuits and cannot be trivially extended to dynamic circuits. We propose dynamarq, a scalable and hardware-agnostic benchmarking framework for dynamic circuits. We collect a set of dynamic circuit benchmarks spanning various applications and propose a broad set of circuit features to characterize the structure of these dynamic circuits. We run them on two IBM quantum processors and the Quantinuum Helios-1E emulator, and propose scalable, application-dependent fidelity scores for each benchmark based on hardware execution results. We perform statistical modeling to identify correlations between circuit features and fidelity scores, and demonstrate highly accurate fidelity prediction using our model. Our model parameters are also transferable across hardware backends and calibration cycles. Our framework facilitates the understanding of dynamic circuit structures and provides insights for designing and optimizing dynamic circuits to achieve high execution fidelity on quantum hardware.
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.
Dynamic quantum circuits integrate mid-circuit measurements and feed-forward operations to enable real-time classical processing and conditional quantum logic. These capabilities are central to key quantum protocols such as quantum error correction, and have recently demonstrated significant potential for reducing quantum resources, including circuit depth and gate count, across a range of applications. However, executing dynamic circuits on real quantum hardware introduces a critical trade-off: while resource requirements decrease, circuit fidelity degrades due to high error rates of mid-circuit measurements, as well as the decoherence errors accumulated during the extended idle periods introduced by both mid-circuit measurements and feed-forward operations. In this paper, we systematically investigate the impact of standard error mitigation techniques on dynamic circuit applications pertaining to Hamiltonian simulation and ground state estimation of physically relevant systems like the Heisenberg model. We explore dynamical decoupling (DD) as a strategy to suppress decoherence and crosstalk errors during idle windows introduced by mid-circuit measurements and feed-forward delays, and also examine error mitigation via zero-noise extrapolation (ZNE). Through experiments conducted on IBM quantum hardware, we benchmark effective combinations of these strategies that maximize the practical benefits of dynamic quantum circuits in these applications. We demonstrate that a combination of DD and ZNE is effective in mitigating the errors introduced during mid-circuit measurements and feed-forward operations, as well as the errors arising from faulty measurements. This approach yields a energy gap improvement of at least 60% in ground state estimation and reduces observed error of time-evolved states by up to 99% for the Ising model and up to 20% for the Heisenberg model.
We present an analysis of quantum circuit fidelity across the full compilation stack, from high-level gate optimization through pulse-level control. We connect a C++ circuit optimizer to a per-gate Lindblad master-equation fidelity model whose decoherence channels are cross-validated against qiskit-dynamics and whose absolute predictions are benchmarked against execution on real hardware. Across a campaign of 4,452 experiment runs over 371 benchmark circuits, gate cancellation provides the dominant improvement (d=1.66d = 1.66d=1.66, 72% of circuits improved), while circuit size and pulse duration are the strongest negative predictors of process fidelity (input gates r=−0.78r = -0.78r=−0.78; pulse duration r=−0.73r = -0.73r=−0.73, R2=0.53R^2 = 0.53R2=0.53). A formal ablation study shows that pass ordering has no significant effect on two-qubit gate reduction (Kruskal--Wallis p=0.302p = 0.302p=0.302). Comparing against Qiskit transpilation levels, we show that two-qubit gate count, not total gate count, is the hardware-relevant metric: our optimizer attains superior two-qubit reduction on structured circuits (87.8% on QFT, 100% on QAOA) whereas Qiskit's larger total-gate reduction is dominated by single-qubit (u3u_3u3​) consolidation. Finally, executing eight circuits on the IQM Resonance Garnet processor (8/8 jobs completed, job identifiers released) reveals that the model is a consistent upper bound: it preserves the relative difficulty ordering of circuits but overestimates absolute fidelity by a mean of 0.49, quantifying the error budget (crosstalk, leakage, readout) outside a T1T_1T1​/T2T_2T2​/depolarizing model. We release the framework, data, and scripts as open source.