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

arXiv:2609.08925

Resilience Beyond the Light Cone: Error-Detected Primitives for Practical Dynamic Circuits

Kevin C. Smith, Bibek Pokharel, Satvik Maurya, Maika Takita

quant-phSubmitted Sep 8, 2026• Announced Sep 9, 2026• 0 citations
arXivHTMLPDF

Abstract

Dynamic circuits, which augment unitary operations with mid-circuit measurements and classical feedforward, can generate long-range entanglement in constant depth, enabling low-depth primitives ranging from nontrivial state preparation to many-qubit entangling gates. Escaping the light-cone constraints of unitary circuits, however, comes at a cost: these primitives typically require a number of mid-circuit measurements that scales with system size and that, together with feedforward latency, can introduce errors that degrade the long-range entanglement they rely on. Here, we alleviate this tension by showing that many such primitives, when cast into a common framework, admit an error-detection scheme that trades infidelity for postselection overhead with no additional ancillas. Our framework thus unifies and upgrades a broad class of primitives including fan-out gates, multi-qubit Pauli rotations, the preparation of W and higher-weight Dicke states, and certain non-normal matrix product states. We also introduce a reduced-depth, error-detected implementation of the Hadamard test, extending the use cases of dynamic circuits to a key algorithmic primitive. Finally, we establish the practical utility of our scheme through experiments on a superconducting quantum processor. We demonstrate the error-detected preparation of a long-range entangled Bell pair spanning a 100-qubit chain with fidelity $F=0.59\pm0.02$, surpassing the entanglement-certification threshold $F>0.5$ that the baseline dynamic-circuit implementation fails to reach ($0.39\pm0.01$). Separately, we demonstrate constant-depth preparation of W states of up to 20 qubits by consuming GHZ states of up to 40 qubits, finding absolute fidelity improvements of $ΔF\approx 0.2$ across the largest sizes studied. Altogether, these results bring low-depth dynamic-circuit primitives within practical reach on present-day hardware.

Related papers

Mid-circuit measurements and feedforward implement every unitary exactly in constant depth

Chenfeng Cao

Mid-circuit measurements with feedforward reduce the optimal worst-case quantum depth for exact $n$-qubit unitary synthesis from $Θ(n)$ to $O(1)$, using arbitrary one- and two-qubit gates and unrestricted ancillary space. Measurements and resets without feedforward remain subject to the circuit causal-cone bound. Our deterministic construction uses single-qubit measurements, $O(1)$ rounds of parity feedforward, and $O(n4^n\log(n+2))$ total qubits, with all ancillas starting and ending in $|0\rangle$. Classical processing is not counted in quantum depth. We teleport only the matrix error of an approximation by Nehoran and Yuen. An exactly prepared ancillary state encodes this error, whose action is added back by coherent interference. At operator-norm error $2^{-n}$, one step of amplitude amplification suffices. Coherent fanout circuits achieve the same constant-depth bound, while circuits using only one- and two-qubit gates attain depth $Θ(n)$ with $O(4^n\log^2(n+2))$ gates. Generic targets require $Ω(4^n/(h+1))$ qubits at depth $h$, even under unrestricted classical control. Our depth-width trade-offs meet this bound within a factor $O(n^2)$ for $1\le h\le2^n$.

quant-pharXiv:2610.06551•Oct 6, 2026•1 citation

Achieving Computational Gains with Quantum Error-Correction Primitives: Generation of Long-Range Entanglement Enhanced by Error Detection

Haoran Liao, Gavin S. Hartnett, Ashish Kakkar +5 more

The resource overhead required to achieve net computational benefits from quantum error correction (QEC) limits its utility while current systems remain constrained in size, despite exceptional progress in experimental demonstrations. In this paper, we demonstrate that the strategic application of QEC primitives without logical encoding can yield significant advantages on superconducting processors—relative to any alternative error-reduction strategy—while only requiring a modest overhead. We first present a novel protocol for implementing long-range gates that relies on a unitarily prepared Greenberger-Horne-Zeilinger (GHZ) state as well as a unitary disentangling step; the protocol natively introduces an error-detection process using the disentangled qubits as flags. We demonstrate that it achieves state-of-the-art gate fidelities of over 85% across up to 40 lattice sites, significantly and consistently outperforming the best alternative measurement-based protocol without introducing any additional ancilla qubits. We then apply sparse stabilizer measurements to generate large GHZ states by detecting bit-flip and amplitude-damping errors. Employing this technique in combination with deterministic error suppression, we generate a 75-qubit GHZ state exhibiting genuine multipartite entanglement, the largest reported to date. The generation requires no more than 9 ancilla qubits and the fraction of samples discarded due to errors grows no higher than 78%, far lower than previous discard fractions required for tests using comparable numbers of fully encoded qubits. This work in total represents compelling evidence that adopting QEC primitives on current-generation devices can deliver substantial net benefits.

arXiv:2411.14638•PRX Quantum•May 16, 2025•6 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

From Static to Dynamic: Implementation of Long-Range Entanglement GHZ States for Dynamic Circuit-Based Quantum Teleportation

Shisheer S Kaushik, Thirumalai M, Harsh Mehta

In many domains, quantum computing has demonstrated its superiority over classical computing, and it continues to expand. It has demonstrated exponential speedups compared to the classic approach in certain problems. Nevertheless, scalability and noisy environments remain challenges for quantum hardware. In contrast to the unitary dynamics that characterise quantum circuits, recent research has introduced dynamic circuits with non-unitary dynamics. Dynamic circuits include mid-circuit measurement and conditional feed-forward operations. Our proposal involves using dynamic circuits to achieve reduced circuit depth, which in turn significantly decreases error rates by integrating error-correcting feed-forward operations within the circuit. Long-Range Teleportation enables the expansion of teleportation protocols to accommodate intricate quantum states spanning multiple qubits. We have employed Dynamic circuits to ensure an optimal circuit depth and showcase the efficacy of dynamic circuits in facilitating reliable teleportation with an increasing number of qubits. Our findings highlight the benefits of using dynamic circuits to optimize the compilation time of the multi qubit quantum teleportation protocol.

IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)•Jul 12, 2024•1 citation

Measurement and feedforward circuits from quantum error correcting codes

Georgios Styliaris, Rahul Trivedi

Measurements and feedforward enhance the power of shallow quantum circuits, enabling the deterministic implementation of global unitary operations and the preparation of long-range entangled states. We establish a general correspondence between all such protocols and quantum error-correcting codes: the circuit preceding the measurements acts as an encoder, and unitary feedforward can eliminate post-selection if and only if the measurement projectors are detectable errors on the codespace. This correspondence provides a common framework for state preparation and implementation of global unitaries with measurements and feedforward, turning both into a code-design problem. For stabilizer codes with Pauli measurements, although the resulting operation can be non-Clifford, we show that its nonstabilizerness originates entirely from the encoder. We overcome this restriction using non-Pauli measurements or non-additive codes, constructing protocols that generate long-range nonstabilizerness while requiring only single-qubit unitary corrections.

quant-pharXiv:2609.39764•Oct 1, 2026•0 citations

Readout Error Mitigation for Mid-Circuit Measurements and Feedforward

Jin Ming Koh, Dax Enshan Koh, Jayne Thompson

Current quantum computing platforms suffer from readout errors, where faulty measurement outcomes are reported by the device. These errors are particularly harmful in quantum programs that rely on branch statements, where operations in later parts of the program are dynamically determined by mid-circuit measurements. We propose a general protocol for mitigating mid-circuit measurement errors. Our solution works for any number of mid-circuit measurement and feedforward layers without increasing circuit depth or two-qubit gate counts, is efficient under structural assumptions on error channels, and is suitable for immediate application on noisy intermediate-scale quantum devices. We experimentally demonstrate up to a ∼ 60 % reduction in error on superconducting quantum processors across several practically relevant feedforward circuits, including dynamic qubit resets, shallow-depth Greenberger–Horne–Zeilinger state preparation, and multistage quantum teleportation. This work paves the way for more error-resilient adaptive quantum circuits, crucial for current and future quantum computing applications.

arXiv:2406.07611•PRX Quantum•Dec 10, 2025•26 citations
Dynamic circuits, which augment unitary operations with mid-circuit measurements and classical feedforward, can generate long-range entanglement in constant depth, enabling low-depth primitives ranging from nontrivial state preparation to many-qubit entangling gates. Escaping the light-cone constraints of unitary circuits, however, comes at a cost: these primitives typically require a number of mid-circuit measurements that scales with system size and that, together with feedforward latency, can introduce errors that degrade the long-range entanglement they rely on. Here, we alleviate this tension by showing that many such primitives, when cast into a common framework, admit an error-detection scheme that trades infidelity for postselection overhead with no additional ancillas. Our framework thus unifies and upgrades a broad class of primitives including fan-out gates, multi-qubit Pauli rotations, the preparation of W and higher-weight Dicke states, and certain non-normal matrix product states. We also introduce a reduced-depth, error-detected implementation of the Hadamard test, extending the use cases of dynamic circuits to a key algorithmic primitive. Finally, we establish the practical utility of our scheme through experiments on a superconducting quantum processor. We demonstrate the error-detected preparation of a long-range entangled Bell pair spanning a 100-qubit chain with fidelity F=0.59±0.02F=0.59\pm0.02F=0.59±0.02, surpassing the entanglement-certification threshold F>0.5F>0.5F>0.5 that the baseline dynamic-circuit implementation fails to reach (0.39±0.010.39\pm0.010.39±0.01). Separately, we demonstrate constant-depth preparation of W states of up to 20 qubits by consuming GHZ states of up to 40 qubits, finding absolute fidelity improvements of ΔF≈0.2ΔF\approx 0.2ΔF≈0.2 across the largest sizes studied. Altogether, these results bring low-depth dynamic-circuit primitives within practical reach on present-day hardware.
Mid-circuit measurements with feedforward reduce the optimal worst-case quantum depth for exact nnn-qubit unitary synthesis from Θ(n)Θ(n)Θ(n) to O(1)O(1)O(1), using arbitrary one- and two-qubit gates and unrestricted ancillary space. Measurements and resets without feedforward remain subject to the circuit causal-cone bound. Our deterministic construction uses single-qubit measurements, O(1)O(1)O(1) rounds of parity feedforward, and O(n4nlog⁡(n+2))O(n4^n\log(n+2))O(n4nlog(n+2)) total qubits, with all ancillas starting and ending in ∣0⟩|0\rangle∣0⟩. Classical processing is not counted in quantum depth. We teleport only the matrix error of an approximation by Nehoran and Yuen. An exactly prepared ancillary state encodes this error, whose action is added back by coherent interference. At operator-norm error 2−n2^{-n}2−n, one step of amplitude amplification suffices. Coherent fanout circuits achieve the same constant-depth bound, while circuits using only one- and two-qubit gates attain depth Θ(n)Θ(n)Θ(n) with O(4nlog⁡2(n+2))O(4^n\log^2(n+2))O(4nlog2(n+2)) gates. Generic targets require Ω(4n/(h+1))Ω(4^n/(h+1))Ω(4n/(h+1)) qubits at depth hhh, even under unrestricted classical control. Our depth-width trade-offs meet this bound within a factor O(n2)O(n^2)O(n2) for 1≤h≤2n1\le h\le2^n1≤h≤2n.
The resource overhead required to achieve net computational benefits from quantum error correction (QEC) limits its utility while current systems remain constrained in size, despite exceptional progress in experimental demonstrations. In this paper, we demonstrate that the strategic application of QEC primitives without logical encoding can yield significant advantages on superconducting processors—relative to any alternative error-reduction strategy—while only requiring a modest overhead. We first present a novel protocol for implementing long-range gates that relies on a unitarily prepared Greenberger-Horne-Zeilinger (GHZ) state as well as a unitary disentangling step; the protocol natively introduces an error-detection process using the disentangled qubits as flags. We demonstrate that it achieves state-of-the-art gate fidelities of over 85% across up to 40 lattice sites, significantly and consistently outperforming the best alternative measurement-based protocol without introducing any additional ancilla qubits. We then apply sparse stabilizer measurements to generate large GHZ states by detecting bit-flip and amplitude-damping errors. Employing this technique in combination with deterministic error suppression, we generate a 75-qubit GHZ state exhibiting genuine multipartite entanglement, the largest reported to date. The generation requires no more than 9 ancilla qubits and the fraction of samples discarded due to errors grows no higher than 78%, far lower than previous discard fractions required for tests using comparable numbers of fully encoded qubits. This work in total represents compelling evidence that adopting QEC primitives on current-generation devices can deliver substantial net benefits.
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.
In many domains, quantum computing has demonstrated its superiority over classical computing, and it continues to expand. It has demonstrated exponential speedups compared to the classic approach in certain problems. Nevertheless, scalability and noisy environments remain challenges for quantum hardware. In contrast to the unitary dynamics that characterise quantum circuits, recent research has introduced dynamic circuits with non-unitary dynamics. Dynamic circuits include mid-circuit measurement and conditional feed-forward operations. Our proposal involves using dynamic circuits to achieve reduced circuit depth, which in turn significantly decreases error rates by integrating error-correcting feed-forward operations within the circuit. Long-Range Teleportation enables the expansion of teleportation protocols to accommodate intricate quantum states spanning multiple qubits. We have employed Dynamic circuits to ensure an optimal circuit depth and showcase the efficacy of dynamic circuits in facilitating reliable teleportation with an increasing number of qubits. Our findings highlight the benefits of using dynamic circuits to optimize the compilation time of the multi qubit quantum teleportation protocol.
Measurements and feedforward enhance the power of shallow quantum circuits, enabling the deterministic implementation of global unitary operations and the preparation of long-range entangled states. We establish a general correspondence between all such protocols and quantum error-correcting codes: the circuit preceding the measurements acts as an encoder, and unitary feedforward can eliminate post-selection if and only if the measurement projectors are detectable errors on the codespace. This correspondence provides a common framework for state preparation and implementation of global unitaries with measurements and feedforward, turning both into a code-design problem. For stabilizer codes with Pauli measurements, although the resulting operation can be non-Clifford, we show that its nonstabilizerness originates entirely from the encoder. We overcome this restriction using non-Pauli measurements or non-additive codes, constructing protocols that generate long-range nonstabilizerness while requiring only single-qubit unitary corrections.
Current quantum computing platforms suffer from readout errors, where faulty measurement outcomes are reported by the device. These errors are particularly harmful in quantum programs that rely on branch statements, where operations in later parts of the program are dynamically determined by mid-circuit measurements. We propose a general protocol for mitigating mid-circuit measurement errors. Our solution works for any number of mid-circuit measurement and feedforward layers without increasing circuit depth or two-qubit gate counts, is efficient under structural assumptions on error channels, and is suitable for immediate application on noisy intermediate-scale quantum devices. We experimentally demonstrate up to a ∼ 60 % reduction in error on superconducting quantum processors across several practically relevant feedforward circuits, including dynamic qubit resets, shallow-depth Greenberger–Horne–Zeilinger state preparation, and multistage quantum teleportation. This work paves the way for more error-resilient adaptive quantum circuits, crucial for current and future quantum computing applications.