Skip to content
Preprint

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

Sep 2026 · 0 citations · 82 references
Physics

TL;DR

This work 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, and introduces a reduced-depth, error-detected implementation of the Hadamard test.

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 $\Delta 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.

View source

Similar papers

Preprint Nov 2026

Scalable Unitary State-Encoding for Generic Large Data

Efficient encoding of data into quantum states remains a fundamental bottleneck in many quantum computing protocols, which would otherwise offer advantages over their classical counterparts. Here, we introduce deterministic and scalable amplitude-encoding methods with low two-qubit gate costs and tunable trade-offs bet...

Vittorio Pagni, P. K. Schuhmacher, Michael Felderer et al. · 0 citations
Preprint Sep 2026

Measurement and feedforward circuits from quantum error correcting codes

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 precedin...

Georgios Styliaris, Rahul Trivedi · 0 citations
Preprint Oct 2026

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

Mid-circuit measurements with feedforward reduce the optimal worst-case quantum depth for exact $n$-qubit unitary synthesis from $\Theta(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....

Chen-Feng Cao · 3 citations
Open access Sep 2026

Quantum Circuit Pruning: From NISQ Architectures to Fault-Tolerant Operations

Routing-aware pruning is established as a practical and unified compilation strategy across the quantum computing stack and a feasibility analysis on FT hardware indicates that pruning is expected to remain relevant across a range of code distances and physical error rates.

Pau Escofet, C. G. Almudéver, S. Abadal et al. · 0 citations
#machine learning Preprint Oct 2026

Lifting: Quantum State Discrimination Framework for Mid-Circuit Measurements

The theoretical analysis shows that retaining additional channels from a fixed joint distribution cannot increase Bayes risk and establishes sufficient conditions for contraction of an overlap-based upper bound, and experiments across three IBM processors evaluate the framework on repeated stabilizer measurement, parit...

Chi Zhang, N. Vora, Yi-Lun Xu et al. · 0 citations
Preprint Sep 2026

Towards verifiable quantum advantage with random circuits: Observables that survive concentration

Demonstrating quantum advantage on current quantum hardware is a central goal of quantum computing, and random quantum circuits underpin many leading proposals. Yet sampling-based demonstrations are often difficult to verify, while observable-based approaches face a different challenge: concentration can suppress diffe...

A. A. Mele, Francesco Anna Mele, J. McClean et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.