Quantum Computers Can Now Fix Errors Without Taking a Break

The most tedious part of quantum error correction is also the slowest: stopping everything to measure. Every few microseconds, a fault-tolerant quantum computer must pause, probe its qubits, classically compute what went wrong, and decide whether to correct. On most hardware platforms, that measurement step takes roughly 30 milliseconds — orders of magnitude slower than a gate operation — during which idling qubits accumulate decoherence. Now a joint team from the University of Innsbruck, RWTH Aachen University, and Forschungszentrum Jülich has demonstrated that you don't have to stop the music at all.

In a paper published this month in Nature Communications, the group shows a complete toolbox of fault-tolerant quantum operations that eliminates mid-circuit measurements and feed-forward control entirely. Rather than halting computation to read out error syndromes and classically decide on corrections, the system processes error information coherently — inside the quantum circuit itself, using only ordinary quantum gates. "This makes the method faster and potentially less error-prone than conventional schemes, and particularly well-suited to hardware platforms where measurements are especially costly," said Friederike Butt, one of the paper's lead authors, in a university press release.

The practical benefit is concrete. On the Innsbruck team's trapped-ion processor, a reset operation takes 1.7 milliseconds. A mid-circuit measurement on the same hardware takes roughly 30 milliseconds. The measurement-free approach sidesteps that gap entirely — about 18 times faster, not the 100 times the wire headline claimed.

To prove the concept actually works, the team ran Grover's quantum search algorithm fault-tolerantly on three logical qubits encoded across eight physical qubits, searching for two marked items in a set of eight. The algorithm identified the correct solutions, a meaningful step from "we can do fault-tolerant gates" to "we can run a complete fault-tolerant algorithm." Previous demonstrations of Grover on logical qubits used two logical qubits; scaling to three puts the approach closer to something that could not be efficiently simulated classically. The current success probability of 0.40 is slightly below the optimal classical probability of 0.46, but with two-qubit gate errors reduced by one percentage point — to roughly 1.5 percent — the projected success rate climbs to 0.52, beating classical. Extend the coherence time of idling qubits, which currently accounts for nearly two-thirds of all logical errors, and the projection rises to 0.67.

The theoretical framework was developed by Butt and Markus Müller at RWTH Aachen and Jülich. The experimental implementation was led by Ivan Pogorelov and Thomas Monz at Innsbruck, with Monz also a co-founder of the spin-out Alpine Quantum Technologies. The full author list is: Friederike Butt, Ivan Pogorelov, Robert Freund, Alex Steiner, Marcel Meyer, Thomas Monz & Markus Müller.

Why this matters beyond the lab. Mid-circuit measurement is a bottleneck not just for trapped ions but for superconducting qubits, which face the same fundamental constraint: measurement is slower than gates, and idling qubits decohere. Several leading groups have focused on reducing feed-forward latency as an engineering challenge. The measurement-free paradigm sidesteps the problem architecturally rather than optimizing around it. If the approach generalizes to larger code distances and more logical qubits, it could reshape what fault-tolerant quantum algorithms actually look like on real hardware.

The result is a proof-of-concept, not a product. Three logical qubits is a long way from the millions of physical qubits a practical quantum computer will require. And the paper does not claim that measurement-free operations have lower logical error rates than measurement-based approaches — only that they avoid the speed and overhead penalties. Whether the tradeoffs improve at scale remains an open question. The Innsbruck group has taken a well-known theoretical idea and shown it works in hardware. That's genuine progress on a real bottleneck.

Nature Communications, 2026. DOI: 10.1038/s41467-026-68533-x