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

Modular fault-tolerant quantum computing on a non-CSS code

Robert Freund, Friederike Butt, César Benito, Ivan Pogorelov, Marcel Meyer, Alex Steiner, Alejandro Bermudez, Markus Müller, Thomas Monz

quant-phSubmitted Sep 18, 2026• Announced Sep 22, 2026• 0 citations
arXivHTMLPDF

Abstract

Modularization promises to break down the design and implementation complexity of large scale quantum processors into smaller manageable subtasks. In this approach, quantum channels, realized for instance through physical rerouting of qubits or quantum teleportation, connect multiple modules. Each of those modules hosts a subset of qubits, e.g. multiple logical qubits, and provides quantum operations on them. In this work, we implement for the first time all logical operations required for modular fault-tolerant universal quantum computing with a non-Calderbank-Shor-Steane (CSS) code, the perfect $[[5, 1, 3]]$ code, on a trapped-ion quantum computer. This code is the smallest quantum error-correcting (QEC) code capable of correcting any single-qubit error, making it a compact alternative to larger CSS codes. We demonstrate logical state teleportation and a full suite of fault-tolerant operations required for universal logical control, including logical state preparation, QEC with real-time feedback, logical measurements, magic-state preparation, logical entangling operations, and magic-state injection. Moreover, we characterize the logical spectator error picked up by idling logical qubits during quantum operations on distinct qubit registers and demonstrate a logical Pauli quantum process tomography that minimizes required sampling resources for logical tomography.

AI Summary

The paper addresses how to implement universal fault-tolerant logical control and teleportation with a non-CSS code, where transversal CNOT and destructive logical readout are not directly available. It implements a toolbox for the $[[5,1,3]]$ code on a 16-ion trapped-ion processor, using flagged measurements, mid-circuit readout and real-time feedback. Two encoded blocks occupy one ion chain; physically separated modules are not demonstrated. The experiments cover logical Pauli-state preparation, error correction, logical measurement, teleportation, verified magic-state preparation, a pieceably fault-tolerant entangling gate and magic-state injection. Preparation and readout have an average infidelity of $5.24\%$ at $80\%$ acceptance; adding one error-correction cycle gives $26.8\%$ infidelity. Operating an error-correction cycle on one block adds roughly 20 percentage points of spectator-state infidelity. With error-detecting postselection, teleportation reaches $21^{+7}_{-5}\%$ infidelity at $0.035\%$ acceptance. Magic-state preparation reaches $4^{+3}_{-2}\%$ infidelity at $2.3\%$ acceptance; injection has an estimated average gate fidelity of $85\pm8\%$ at $0.023\%$ acceptance. Results are characterized through logical measurements and tomography and compared with Monte Carlo simulations using experimentally informed noise parameters. Single-fault enumeration verifies the magic-state preparation circuit. Reduced-resource logical process tomography uses Pauli-noise assumptions and removes SPAM contributions for error-correcting, but not postselected, operations. Stated limitations include residual physical errors that complicate concatenated-operation characterization, substantial two-qubit-gate and mid-circuit-measurement noise, sequential-operation idling, and very low acceptance for deep protocols; teleportation and injection retain only tens of shots per measurement configuration.

Little sign of AI-generated textOverclaimsStrong assumptions

Central claim may not hold: The abstract leaves unstated that the principal multi-block demonstrations are conditional error-detecting protocols, with acceptance rates of 0.035% for teleportation and 0.023% for magic-state injection, rather than implementations of the full error-correcting protocols. With the paper’s logical Pauli definitions, its stated transversal phase-gate prescription implements logical S† rather than S, and its example Y_2Y_3X_5 represents −X_L rather than X_L. The printed Pauli-transfer-matrix definition omits the factor 1/2^N required for the subsequent composition and fidelity formulas. The same reported 85 ± 8% is inconsistently identified as process fidelity and average gate fidelity, which are distinct quantities.

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

Comments
24 pages, 16 figures

Related papers

Demonstration of measurement-free universal fault-tolerant quantum computation

Friederike Butt, Ivan Pogorelov, Robert Freund +4 more

Abstract The ability to perform quantum error correction (QEC) and robust gate operations on encoded qubits opens the door to demonstrations of quantum algorithms. Contemporary QEC schemes typically require mid-circuit measurements with feed-forward control, which are challenging for qubit control, often slow, and susceptible to relatively high error rates. In this work, we propose and experimentally demonstrate a universal toolbox of fault-tolerant logical operations without mid-circuit measurements on a trapped-ion quantum processor. We present modular logical state teleportation between two four-qubit error-detecting codes without measurements during algorithm execution. Moreover, we realize a fault-tolerant universal gate set on an eight-qubit error-detecting code hosting three logical qubits, based on state injection, which can be executed by coherent gate operations only. We apply this toolbox to experimentally realize Grover's quantum search algorithm fault-tolerantly on three logical qubits encoded in eight physical qubits, with the implementation displaying clear identification of the desired solution states. Our work demonstrates the practical feasibility and provides first steps into the largely unexplored direction of measurement-free quantum computation.

arXiv:2506.22600•Aug 14, 2025•5 citations

Demonstration of measurement-free universal logical quantum computation

Friederike Butt, Ivan Pogorelov, Robert S. Freund +4 more

The ability to perform quantum error correction (QEC) and robust gate operations on encoded qubits opens the door to demonstrations of quantum algorithms. Contemporary QEC schemes typically require mid-circuit measurements with feed-forward control, which are challenging for qubit control, often slow, and susceptible to relatively high error rates. In this work, we propose and experimentally demonstrate a universal toolbox of fault-tolerant logical operations on error-detecting codes without mid-circuit measurements on a trapped-ion quantum processor. We present modular logical state teleportation between two four-qubit error-detecting codes without measurements during algorithm execution. Moreover, we realize a fault-tolerant universal gate set on an eight-qubit error-detecting code hosting three logical qubits, based on state injection, which can be executed by coherent gate operations only. We apply this toolbox to experimentally realize Grover's quantum search algorithm fault-tolerantly on three logical qubits encoded in eight physical qubits, with the implementation displaying clear identification of the desired solution states. Our work demonstrates the practical feasibility and provides first steps into the largely unexplored direction of measurement-free quantum computation.

Nature Communications•Jan 26, 2026•8 citations

Teleportation-based Fault-tolerant Quantum Computation in Multi-qubit Large Block Codes

Todd A. Brun, Yi-Cong Zheng, Kung-Chuan Hsu +2 more

A major goal for fault-tolerant quantum computation (FTQC) is to reduce the overhead needed for error correction. One approach is to use block codes that encode multiple qubits, which can achieve significantly higher rates for the same code distance than single-qubit code blocks or topological codes. We present a scheme for universal quantum computation using multi-qubit Calderbank-Shor-Steane (CSS) block codes, where codes admitting different transversal gates are used to achieve universality, and logical teleportation is used to move qubits between code blocks. All circuits for both computation and error correction are transversal. We also argue that single shot fault-tolerant error correction can be done in Steane syndrome extraction. Then, we present estimates of information lifetime for a few possible codes, which suggests that highly nontrivial quantum computations can be achieved at reasonable error rates, using codes that require significantly less than 100 physical qubits per logical qubit.

arXiv:1504.03913•Apr 15, 2015•27 citations

Demonstration of Fault-Tolerant Steane Quantum Error Correction

Lukas Postler, Friederike Butt, Ivan Pogorelov +7 more

Encoding information redundantly using quantum error-correcting (QEC) codes allows one to overcome the inherent sensitivity to noise in quantum computers to ultimately achieve large-scale quantum computation. The Steane QEC method involves preparing an auxiliary logical qubit of the same QEC code as used for the data register. The data and auxiliary registers are then coupled with a logical controlled- () gate, enabling a measurement of the auxiliary register to reveal the error syndrome. This study presents the implementation of multiple rounds of fault-tolerant (FT) Steane QEC on a trapped-ion quantum computer. Various QEC codes are employed and the results are compared to a previous experimental approach utilizing flag qubits. Our experimental findings show improved logical fidelities for Steane QEC and accompanying numerical simulations indicate an even larger performance advantage for quantum processors limited by entangling-gate errors. This establishes experimental Steane QEC as a competitive paradigm for FT quantum computing. Published by the American Physical Society 2024

arXiv:2312.09745•PRX Quantum•Aug 7, 2024•87 citations

Injection is all you need: parallel universal logic in high-rate concatenated self-dual codes

Joseph Sullivan, David Amaro, Michael A. Perlin

We propose a quantum architecture that achieves addressable and parallel universal fault-tolerant logical in high-rate codes. The codes are obtained from the flexible concatenation of small-distance high-rate self-dual CSS codes. Addressable and parallel universal logic on the resulting $K$ logical qubits is injected by fault-tolerantly preparing and then consuming diverse logical $K$-qubit CSS stabilizer states and logical $\lvert H \rangle^{\otimes K}$ global magic states. Flag-at-origin is used to prepare the stabilizer resource states while a concatenated cultivation protocol prepares the global magic states. These resource states are consumed by Steane-QEC or Knill-QEC teleportation gadgets, which simultaneously perform quantum error correction. Any quantum algorithm with $T$-depth $D_T$ can be executed by consuming $12D_T$ or fewer resource states. We benchmark the fault-tolerant preparation of the resource states for several two-level concatenations of the $[[k+4,k,2]]$ H codes and the Hamming $[[15,7,3]]$ code. In particular, we find that the concatenated cultivation offers at least one order of magnitude spacetime reduction compared to cultivation in the surface code.

quant-pharXiv:2610.30087•Oct 22, 2026•0 citations

Design, decoding, and fault-tolerant implementation of quantum error-correcting codes

Diego Forlivesi

Quantum computation promises to revolutionize information processing by exploiting superposition and entanglement, enabling applications such as quantum simulation, combinatorial optimization, and secure quantum communication. Beyond individual processors, the quantum internet aims to connect quantum nodes through entanglement distribution, enabling distributed computation. However, quantum states are fragile: environmental interactions, imperfect gate operations, and measurement errors can quickly degrade encoded information. Reliable quantum computation therefore requires carefully designed quantum error-correcting codes and fault-tolerant protocols. Unlike classical redundancy schemes, quantum error correction must preserve delicate phase relationships and relies on indirect error detection through syndrome extraction with ancillary qubits, enabling error identification without collapsing encoded states. Topological codes, in particular, emerged early as the preferred choice for many architectures due to their planar structure, local interactions, and natural support for fault-tolerant logical operations. Color codes, for instance, allow transversal implementation of all Clifford gates, whereas non-Clifford operations require magic-state injection. More recent constructions, including quantum low-density parity-check codes, offer higher encoding rates and reduced resource overhead, but require long-range qubit connectivity and more complex protocols. Despite experimental progress, several challenges remain. Many platforms exhibit biased noise, motivating codes that exploit channel asymmetry. Real-time decoding remains a critical bottleneck, as fault-tolerant computation requires low-latency processing of rapidly generated syndrome data. Fault-tolerant logical state initialization also remains resource-intensive and scales poorly with code distance. Addressing these challenges, this thesis develops a unified framework spanning theory and experiment. It provides precise performance analysis of quantum error-correcting codes in the low physical error-rate regime, introduces codes tailored to biased noise, develops fast low-complexity decoding algorithms for real-time operation, and presents modular and efficient protocols for fault-tolerant state preparation of CSS codes. The latter is demonstrated experimentally through the preparation of a logical zero state of the Golay code on the Quantinuum H2 trapped-ion quantum computer.

•Jun 29, 2026•0 citations
Modularization promises to break down the design and implementation complexity of large scale quantum processors into smaller manageable subtasks. In this approach, quantum channels, realized for instance through physical rerouting of qubits or quantum teleportation, connect multiple modules. Each of those modules hosts a subset of qubits, e.g. multiple logical qubits, and provides quantum operations on them. In this work, we implement for the first time all logical operations required for modular fault-tolerant universal quantum computing with a non-Calderbank-Shor-Steane (CSS) code, the perfect [[5,1,3]][[5, 1, 3]][[5,1,3]] code, on a trapped-ion quantum computer. This code is the smallest quantum error-correcting (QEC) code capable of correcting any single-qubit error, making it a compact alternative to larger CSS codes. We demonstrate logical state teleportation and a full suite of fault-tolerant operations required for universal logical control, including logical state preparation, QEC with real-time feedback, logical measurements, magic-state preparation, logical entangling operations, and magic-state injection. Moreover, we characterize the logical spectator error picked up by idling logical qubits during quantum operations on distinct qubit registers and demonstrate a logical Pauli quantum process tomography that minimizes required sampling resources for logical tomography.
The paper addresses how to implement universal fault-tolerant logical control and teleportation with a non-CSS code, where transversal CNOT and destructive logical readout are not directly available. It implements a toolbox for the [[5,1,3]][[5,1,3]][[5,1,3]] code on a 16-ion trapped-ion processor, using flagged measurements, mid-circuit readout and real-time feedback. Two encoded blocks occupy one ion chain; physically separated modules are not demonstrated.
The experiments cover logical Pauli-state preparation, error correction, logical measurement, teleportation, verified magic-state preparation, a pieceably fault-tolerant entangling gate and magic-state injection. Preparation and readout have an average infidelity of 5.24%5.24\%5.24% at 80%80\%80% acceptance; adding one error-correction cycle gives 26.8%26.8\%26.8% infidelity. Operating an error-correction cycle on one block adds roughly 20 percentage points of spectator-state infidelity. With error-detecting postselection, teleportation reaches 21−5+7%21^{+7}_{-5}\%21−5+7​% infidelity at 0.035%0.035\%0.035% acceptance. Magic-state preparation reaches 4−2+3%4^{+3}_{-2}\%4−2+3​% infidelity at 2.3%2.3\%2.3% acceptance; injection has an estimated average gate fidelity of 85±8%85\pm8\%85±8% at 0.023%0.023\%0.023% acceptance.
Results are characterized through logical measurements and tomography and compared with Monte Carlo simulations using experimentally informed noise parameters. Single-fault enumeration verifies the magic-state preparation circuit. Reduced-resource logical process tomography uses Pauli-noise assumptions and removes SPAM contributions for error-correcting, but not postselected, operations. Stated limitations include residual physical errors that complicate concatenated-operation characterization, substantial two-qubit-gate and mid-circuit-measurement noise, sequential-operation idling, and very low acceptance for deep protocols; teleportation and injection retain only tens of shots per measurement configuration.
Abstract The ability to perform quantum error correction (QEC) and robust gate operations on encoded qubits opens the door to demonstrations of quantum algorithms. Contemporary QEC schemes typically require mid-circuit measurements with feed-forward control, which are challenging for qubit control, often slow, and susceptible to relatively high error rates. In this work, we propose and experimentally demonstrate a universal toolbox of fault-tolerant logical operations without mid-circuit measurements on a trapped-ion quantum processor. We present modular logical state teleportation between two four-qubit error-detecting codes without measurements during algorithm execution. Moreover, we realize a fault-tolerant universal gate set on an eight-qubit error-detecting code hosting three logical qubits, based on state injection, which can be executed by coherent gate operations only. We apply this toolbox to experimentally realize Grover's quantum search algorithm fault-tolerantly on three logical qubits encoded in eight physical qubits, with the implementation displaying clear identification of the desired solution states. Our work demonstrates the practical feasibility and provides first steps into the largely unexplored direction of measurement-free quantum computation.
The ability to perform quantum error correction (QEC) and robust gate operations on encoded qubits opens the door to demonstrations of quantum algorithms. Contemporary QEC schemes typically require mid-circuit measurements with feed-forward control, which are challenging for qubit control, often slow, and susceptible to relatively high error rates. In this work, we propose and experimentally demonstrate a universal toolbox of fault-tolerant logical operations on error-detecting codes without mid-circuit measurements on a trapped-ion quantum processor. We present modular logical state teleportation between two four-qubit error-detecting codes without measurements during algorithm execution. Moreover, we realize a fault-tolerant universal gate set on an eight-qubit error-detecting code hosting three logical qubits, based on state injection, which can be executed by coherent gate operations only. We apply this toolbox to experimentally realize Grover's quantum search algorithm fault-tolerantly on three logical qubits encoded in eight physical qubits, with the implementation displaying clear identification of the desired solution states. Our work demonstrates the practical feasibility and provides first steps into the largely unexplored direction of measurement-free quantum computation.
A major goal for fault-tolerant quantum computation (FTQC) is to reduce the overhead needed for error correction. One approach is to use block codes that encode multiple qubits, which can achieve significantly higher rates for the same code distance than single-qubit code blocks or topological codes. We present a scheme for universal quantum computation using multi-qubit Calderbank-Shor-Steane (CSS) block codes, where codes admitting different transversal gates are used to achieve universality, and logical teleportation is used to move qubits between code blocks. All circuits for both computation and error correction are transversal. We also argue that single shot fault-tolerant error correction can be done in Steane syndrome extraction. Then, we present estimates of information lifetime for a few possible codes, which suggests that highly nontrivial quantum computations can be achieved at reasonable error rates, using codes that require significantly less than 100 physical qubits per logical qubit.
Encoding information redundantly using quantum error-correcting (QEC) codes allows one to overcome the inherent sensitivity to noise in quantum computers to ultimately achieve large-scale quantum computation. The Steane QEC method involves preparing an auxiliary logical qubit of the same QEC code as used for the data register. The data and auxiliary registers are then coupled with a logical controlled- () gate, enabling a measurement of the auxiliary register to reveal the error syndrome. This study presents the implementation of multiple rounds of fault-tolerant (FT) Steane QEC on a trapped-ion quantum computer. Various QEC codes are employed and the results are compared to a previous experimental approach utilizing flag qubits. Our experimental findings show improved logical fidelities for Steane QEC and accompanying numerical simulations indicate an even larger performance advantage for quantum processors limited by entangling-gate errors. This establishes experimental Steane QEC as a competitive paradigm for FT quantum computing. Published by the American Physical Society 2024
We propose a quantum architecture that achieves addressable and parallel universal fault-tolerant logical in high-rate codes. The codes are obtained from the flexible concatenation of small-distance high-rate self-dual CSS codes. Addressable and parallel universal logic on the resulting KKK logical qubits is injected by fault-tolerantly preparing and then consuming diverse logical KKK-qubit CSS stabilizer states and logical ∣H⟩⊗K\lvert H \rangle^{\otimes K}∣H⟩⊗K global magic states. Flag-at-origin is used to prepare the stabilizer resource states while a concatenated cultivation protocol prepares the global magic states. These resource states are consumed by Steane-QEC or Knill-QEC teleportation gadgets, which simultaneously perform quantum error correction. Any quantum algorithm with TTT-depth DTD_TDT​ can be executed by consuming 12DT12D_T12DT​ or fewer resource states. We benchmark the fault-tolerant preparation of the resource states for several two-level concatenations of the [[k+4,k,2]][[k+4,k,2]][[k+4,k,2]] H codes and the Hamming [[15,7,3]][[15,7,3]][[15,7,3]] code. In particular, we find that the concatenated cultivation offers at least one order of magnitude spacetime reduction compared to cultivation in the surface code.
Quantum computation promises to revolutionize information processing by exploiting superposition and entanglement, enabling applications such as quantum simulation, combinatorial optimization, and secure quantum communication. Beyond individual processors, the quantum internet aims to connect quantum nodes through entanglement distribution, enabling distributed computation. However, quantum states are fragile: environmental interactions, imperfect gate operations, and measurement errors can quickly degrade encoded information. Reliable quantum computation therefore requires carefully designed quantum error-correcting codes and fault-tolerant protocols. Unlike classical redundancy schemes, quantum error correction must preserve delicate phase relationships and relies on indirect error detection through syndrome extraction with ancillary qubits, enabling error identification without collapsing encoded states. Topological codes, in particular, emerged early as the preferred choice for many architectures due to their planar structure, local interactions, and natural support for fault-tolerant logical operations. Color codes, for instance, allow transversal implementation of all Clifford gates, whereas non-Clifford operations require magic-state injection. More recent constructions, including quantum low-density parity-check codes, offer higher encoding rates and reduced resource overhead, but require long-range qubit connectivity and more complex protocols. Despite experimental progress, several challenges remain. Many platforms exhibit biased noise, motivating codes that exploit channel asymmetry. Real-time decoding remains a critical bottleneck, as fault-tolerant computation requires low-latency processing of rapidly generated syndrome data. Fault-tolerant logical state initialization also remains resource-intensive and scales poorly with code distance. Addressing these challenges, this thesis develops a unified framework spanning theory and experiment. It provides precise performance analysis of quantum error-correcting codes in the low physical error-rate regime, introduces codes tailored to biased noise, develops fast low-complexity decoding algorithms for real-time operation, and presents modular and efficient protocols for fault-tolerant state preparation of CSS codes. The latter is demonstrated experimentally through the preparation of a logical zero state of the Golay code on the Quantinuum H2 trapped-ion quantum computer.