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

Measurement and feedforward circuits from quantum error correcting codes

Georgios Styliaris, Rahul Trivedi

quant-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

AI Summary

The paper asks when measurements following an encoding circuit can be made deterministic by outcome-dependent unitary feedforward, treating state preparation and transformations of arbitrary inputs as isometries. Its central result is an exact correspondence with quantum error-correcting codes. Taking the premeasurement circuit as encoder and $\mathcal P$ as its image projector, unitary corrections exist if and only if every measurement projector satisfies $\mathcal P E_a\mathcal P=c_a\mathcal P$. The proof applies the Knill–Laflamme condition and explicitly constructs unitaries mapping each nonzero-probability outcome subspace to a reference subspace. For stabilizer codes with commuting Pauli measurements satisfying detectability, corrections can always be Pauli strings, computable by binary linear algebra. The target isometry is $U_{\rm targ}=C U_{\rm circ}$ for a Clifford $C$, so this measurement-and-correction layer only redistributes nonstabilizerness supplied by the encoder. Two constructions go beyond this restriction: non-Pauli measurements on stabilizer codes with Pauli corrections, and Pauli measurements on non-additive codes with single-qubit $S$-gate corrections. A rotated measurement on a GHZ state produces an unequal-amplitude GHZ state whose nonstabilizerness, for specified nondyadic parameters, cannot be removed by constant-depth two-qubit circuits even with arbitrary connectivity. A separate six-qubit-block construction implements an isometry that cannot coincide with a Clifford on its codespace. The general correspondence does not guarantee shallow encoding, measurement, or correction circuits; resource efficiency requires separate analysis. Determining which tensor-network isometries admit efficient protocols remains open.

No sign of AI-generated textOverclaims

Error found: The abstract claims that the non-additive-code route generates long-range nonstabilizerness, whereas the paper establishes only a non-Clifford codespace isometry and long-range entanglement, with its explicit output example being a stabilizer state.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

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

Stabilizer codes : encoding schemes and applications

Shiyu Shi

Quantum information science is a rapidly growing research area. It concerns information theory that makes use of quantum nature of the microscopic world. In reality, quantum systems are vulnerable to disturbance from an external environment, which can lead to decoherence in the system. Thus, the system must be protected from the environmental noise to keep information stored in the quantum registers. In order to realize a working quantum computer and dependable quantum information processing, researchers and engineers have to overcome this difficulty. One of the most promising candidates for overcoming decoherence is Quantum Error Correction. The idea of quantum error correction is to protect quantum information from errors due to decoherence and other quantum noise during the transmission of information in quantum channels. One fundamental question of quantum error correction is the existence of quantum error correcting code for a noisy quantum system. Moreover, constructing practical and operational quantum error correcting schemes in actual quantum computing is of great interest to quantum information scientists. In this thesis, stabilizer codes and a scheme for constructing recovery channels without error syndrome detection are studied. The motivation for construction of recovery channel without error syndrome detection is also given. We first review some basic concepts on stabilizer groups and stabilizer codes. In particular, we consider theories and principles involved in the construction of encoding circuits from the generators of stabilizer group, and propose a new procedure to derive recovery channel for a well known quantum code, the [n, k, d] code. First, an algorithm to obtain the generators for a stabilizer code and the corresponding computational basis codewords defined in terms of Pauli operators are reviewed and illustrated in detail. Examples are given to demonstrate the relation between the X- and Z- matrices of generators of stabilizer group and the corresponding encoding circuit. Then based on the general framework of operator quantum error correction, we provide a general scheme on the construction of encoding and decoding circuits for the [n, k, d] codes. Finally, a detailed procedure to construct the recovery channel using encoding circuits and encoded computational basis codewords are demonstrated for [5, 1, 3] code and [8, 3, 3] code step by step as examples, with heuristic explanations based on necessary and sufficient conditions for quantum error correction. Possible future study and open problems will also be mentioned.

•Jan 1, 2016•0 citations

Stabilizer quantum error correction with quantum bus computation

Casey R. Myers, Marcus Palmer Da Silva, Kae Nemoto +1 more

In this paper we investigate stabilizer quantum error correction codes using controlled phase rotations of strong coherent probe states. We explicitly describe two methods to measure the Pauli operators that generate the stabilizer group of a quantum code. First, we show how to measure a Pauli operator acting on physical qubits using a single coherent state with large average photon number, displacement operations, and photon detection. Second, we show how to measure the stabilizer operators fault-tolerantly by the deterministic preparation of coherent quantum superposition (``cat'') states along with one-bit teleportations between a qubitlike encoding of coherent states and physical qubits.

arXiv:quant-ph/0612097•Physical Review A•Jul 5, 2007•12 citations

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

Kevin C. Smith, Bibek Pokharel, Satvik Maurya +1 more

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.

quant-pharXiv:2609.08925•Sep 9, 2026•0 citations

Encoder Circuit Optimization for Nonbinary Quantum Error Correction Codes in Prime Dimensions: An Algorithmic Framework

Aditya Sodhani, Keshab K. Parhi

Quantum computers are a revolutionary class of computational platforms with applications in combinatorial and global optimization, machine learning, and other domains involving computationally hard problems. While these machines typically operate on qubits—quantum information elements that can occupy superpositions of the basis$|0\rangle$and$|1\rangle$states—recent advances have demonstrated the practical implementation of higher-dimensional quantum systems (qudits) across various hardware platforms. In these hardware realizations, the higher-order states are less stable and thus remain coherent for a shorter duration than the basis$|0\rangle$and$|1\rangle$states. Moreover, formal methods for designing efficient encoder circuits for these systems remain underexplored. This limitation motivates the development of efficient circuit techniques for qudit systems (d-level quantum systems). Previous works have typically established generating gate sets for higher-dimensional codes by generalizing the methods used for qubits. In this work, we introduce a systematic framework for optimizing encoder circuits for prime-dimension stabilizer codes. This framework is based on novel generating gate sets whose elements map directly to efficient Clifford gate sequences. We demonstrate the effectiveness of this method on key codes, achieving a 13–44% reduction in encoder circuit gate count for the qutrit (d = 3)$[[9,5,3]]_{3}$,$[[5,1,3]]_{3}$, and$[[7,1,3]]_{3}$codes, and a 9–21% reduction for the ququint (d = 5)$[[10,6,3]]_{5}$code when compared to prior work. We also achieved circuit depth reductions up to 42%.

arXiv:2509.25587•IEEE Transactions on Quantum Engineering•Jan 1, 2026•1 citation

New pathways to universal quantum logic in the early era of fault tolerance

Friederike Butt

Quantum computers promise to solve computational problems that are inaccessible to classical machines. The reliable execution of large-scale quantum algorithms requires robust operations in the presence of noise. Quantum error correction addresses this challenge by encoding quantum information redundantly across several physical qubits, such that errors can be detected and corrected during a computation. However, no single error-correcting code intrinsically supports an inherently robust, fault-tolerant implementation of all gates needed for universal quantum computing. Moreover, most modern approaches to both quantum error correction and the implementation of universal logical operations on encoded qubits rely on mid-circuit measurements and feed-forward control. These types of operations are technologically demanding, often slow, and prone to high error rates, and they limit the overall success probability of quantum algorithms. In this thesis, we develop fault-tolerant protocols and circuits for quantum error correction and universal logical computation, with an emphasis on implementations compatible with current hardware systems. We first focus on fault-tolerant quantum error correction on small codes. By comparing different protocols, we identify trade-offs between compact circuit constructions and their robustness to noise. We then assess their practical performance by comparing numerical simulations of noisy circuits with experimental data. Beyond the preservation of encoded information, we study how universal logic can be implemented in a fault-tolerant manner on encoded qubits. A central approach considered in this thesis is code switching, in which logical information is transferred between two distinct error-correcting codes that support complementary sets of inherently fault-tolerant logical gates. In combination, these codes give access to a complete universal fault-tolerant logical gate set. In this thesis, we determine conditions that allow us to construct fault-tolerant protocols for code switching. We adapt these protocols to the capabilities of current hardware, thereby enabling the first experimental realization of universal fault-tolerant logic by means of code switching. However, the overall performance of these schemes is limited by slow and noisy mid-circuit measurements. To address this bottleneck, we construct a suite of measurement-free fault-tolerant universal operations that do not require any measurements during the execution of an algorithm. In this framework, error correction and logical operations are implemented coherently as part of the quantum circuit, without mid-circuit measurements or in-sequence classical control. We introduce measurement-free code-switching schemes that can be scaled to arbitrary code distances through concatenation, and which thereby provide, in principle, arbitrarily strong error suppression. We further tailor our approach to the capabilities of current trapped-ion quantum processors. New circuit constructions support the first experimental implementation of a logical quantum algorithm without mid-circuit measurements, demonstrated through Grover's search on three encoded qubits. Together, the results of this thesis expand the toolbox for early fault-tolerant quantum computation. They show how protocols for quantum error correction and universal logical gates can be designed without mid-circuit measurements with realistic hardware constraints in mind, opening new pathways towards universal quantum logic.

•Jan 1, 2026•0 citations
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.
The paper asks when measurements following an encoding circuit can be made deterministic by outcome-dependent unitary feedforward, treating state preparation and transformations of arbitrary inputs as isometries.
Its central result is an exact correspondence with quantum error-correcting codes. Taking the premeasurement circuit as encoder and P\mathcal PP as its image projector, unitary corrections exist if and only if every measurement projector satisfies PEaP=caP\mathcal P E_a\mathcal P=c_a\mathcal PPEa​P=ca​P. The proof applies the Knill–Laflamme condition and explicitly constructs unitaries mapping each nonzero-probability outcome subspace to a reference subspace.
For stabilizer codes with commuting Pauli measurements satisfying detectability, corrections can always be Pauli strings, computable by binary linear algebra. The target isometry is Utarg=CUcircU_{\rm targ}=C U_{\rm circ}Utarg​=CUcirc​ for a Clifford CCC, so this measurement-and-correction layer only redistributes nonstabilizerness supplied by the encoder. Two constructions go beyond this restriction: non-Pauli measurements on stabilizer codes with Pauli corrections, and Pauli measurements on non-additive codes with single-qubit SSS-gate corrections. A rotated measurement on a GHZ state produces an unequal-amplitude GHZ state whose nonstabilizerness, for specified nondyadic parameters, cannot be removed by constant-depth two-qubit circuits even with arbitrary connectivity. A separate six-qubit-block construction implements an isometry that cannot coincide with a Clifford on its codespace.
The general correspondence does not guarantee shallow encoding, measurement, or correction circuits; resource efficiency requires separate analysis. Determining which tensor-network isometries admit efficient protocols remains open.
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.
Quantum information science is a rapidly growing research area. It concerns information theory that makes use of quantum nature of the microscopic world. In reality, quantum systems are vulnerable to disturbance from an external environment, which can lead to decoherence in the system. Thus, the system must be protected from the environmental noise to keep information stored in the quantum registers. In order to realize a working quantum computer and dependable quantum information processing, researchers and engineers have to overcome this difficulty. One of the most promising candidates for overcoming decoherence is Quantum Error Correction. The idea of quantum error correction is to protect quantum information from errors due to decoherence and other quantum noise during the transmission of information in quantum channels. One fundamental question of quantum error correction is the existence of quantum error correcting code for a noisy quantum system. Moreover, constructing practical and operational quantum error correcting schemes in actual quantum computing is of great interest to quantum information scientists. In this thesis, stabilizer codes and a scheme for constructing recovery channels without error syndrome detection are studied. The motivation for construction of recovery channel without error syndrome detection is also given. We first review some basic concepts on stabilizer groups and stabilizer codes. In particular, we consider theories and principles involved in the construction of encoding circuits from the generators of stabilizer group, and propose a new procedure to derive recovery channel for a well known quantum code, the [n, k, d] code. First, an algorithm to obtain the generators for a stabilizer code and the corresponding computational basis codewords defined in terms of Pauli operators are reviewed and illustrated in detail. Examples are given to demonstrate the relation between the X- and Z- matrices of generators of stabilizer group and the corresponding encoding circuit. Then based on the general framework of operator quantum error correction, we provide a general scheme on the construction of encoding and decoding circuits for the [n, k, d] codes. Finally, a detailed procedure to construct the recovery channel using encoding circuits and encoded computational basis codewords are demonstrated for [5, 1, 3] code and [8, 3, 3] code step by step as examples, with heuristic explanations based on necessary and sufficient conditions for quantum error correction. Possible future study and open problems will also be mentioned.
In this paper we investigate stabilizer quantum error correction codes using controlled phase rotations of strong coherent probe states. We explicitly describe two methods to measure the Pauli operators that generate the stabilizer group of a quantum code. First, we show how to measure a Pauli operator acting on physical qubits using a single coherent state with large average photon number, displacement operations, and photon detection. Second, we show how to measure the stabilizer operators fault-tolerantly by the deterministic preparation of coherent quantum superposition (``cat'') states along with one-bit teleportations between a qubitlike encoding of coherent states and physical qubits.
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.
Quantum computers are a revolutionary class of computational platforms with applications in combinatorial and global optimization, machine learning, and other domains involving computationally hard problems. While these machines typically operate on qubits—quantum information elements that can occupy superpositions of the basis∣0⟩|0\rangle∣0⟩and∣1⟩|1\rangle∣1⟩states—recent advances have demonstrated the practical implementation of higher-dimensional quantum systems (qudits) across various hardware platforms. In these hardware realizations, the higher-order states are less stable and thus remain coherent for a shorter duration than the basis∣0⟩|0\rangle∣0⟩and∣1⟩|1\rangle∣1⟩states. Moreover, formal methods for designing efficient encoder circuits for these systems remain underexplored. This limitation motivates the development of efficient circuit techniques for qudit systems (d-level quantum systems). Previous works have typically established generating gate sets for higher-dimensional codes by generalizing the methods used for qubits. In this work, we introduce a systematic framework for optimizing encoder circuits for prime-dimension stabilizer codes. This framework is based on novel generating gate sets whose elements map directly to efficient Clifford gate sequences. We demonstrate the effectiveness of this method on key codes, achieving a 13–44% reduction in encoder circuit gate count for the qutrit (d = 3)[[9,5,3]]3[[9,5,3]]_{3}[[9,5,3]]3​,[[5,1,3]]3[[5,1,3]]_{3}[[5,1,3]]3​, and[[7,1,3]]3[[7,1,3]]_{3}[[7,1,3]]3​codes, and a 9–21% reduction for the ququint (d = 5)[[10,6,3]]5[[10,6,3]]_{5}[[10,6,3]]5​code when compared to prior work. We also achieved circuit depth reductions up to 42%.
Quantum computers promise to solve computational problems that are inaccessible to classical machines. The reliable execution of large-scale quantum algorithms requires robust operations in the presence of noise. Quantum error correction addresses this challenge by encoding quantum information redundantly across several physical qubits, such that errors can be detected and corrected during a computation. However, no single error-correcting code intrinsically supports an inherently robust, fault-tolerant implementation of all gates needed for universal quantum computing. Moreover, most modern approaches to both quantum error correction and the implementation of universal logical operations on encoded qubits rely on mid-circuit measurements and feed-forward control. These types of operations are technologically demanding, often slow, and prone to high error rates, and they limit the overall success probability of quantum algorithms. In this thesis, we develop fault-tolerant protocols and circuits for quantum error correction and universal logical computation, with an emphasis on implementations compatible with current hardware systems. We first focus on fault-tolerant quantum error correction on small codes. By comparing different protocols, we identify trade-offs between compact circuit constructions and their robustness to noise. We then assess their practical performance by comparing numerical simulations of noisy circuits with experimental data. Beyond the preservation of encoded information, we study how universal logic can be implemented in a fault-tolerant manner on encoded qubits. A central approach considered in this thesis is code switching, in which logical information is transferred between two distinct error-correcting codes that support complementary sets of inherently fault-tolerant logical gates. In combination, these codes give access to a complete universal fault-tolerant logical gate set. In this thesis, we determine conditions that allow us to construct fault-tolerant protocols for code switching. We adapt these protocols to the capabilities of current hardware, thereby enabling the first experimental realization of universal fault-tolerant logic by means of code switching. However, the overall performance of these schemes is limited by slow and noisy mid-circuit measurements. To address this bottleneck, we construct a suite of measurement-free fault-tolerant universal operations that do not require any measurements during the execution of an algorithm. In this framework, error correction and logical operations are implemented coherently as part of the quantum circuit, without mid-circuit measurements or in-sequence classical control. We introduce measurement-free code-switching schemes that can be scaled to arbitrary code distances through concatenation, and which thereby provide, in principle, arbitrarily strong error suppression. We further tailor our approach to the capabilities of current trapped-ion quantum processors. New circuit constructions support the first experimental implementation of a logical quantum algorithm without mid-circuit measurements, demonstrated through Grover's search on three encoded qubits. Together, the results of this thesis expand the toolbox for early fault-tolerant quantum computation. They show how protocols for quantum error correction and universal logical gates can be designed without mid-circuit measurements with realistic hardware constraints in mind, opening new pathways towards universal quantum logic.