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:2504.16303 · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS)

iSwitch: QEC on Demand via In-Situ Encoding of Bare Qubits for Ion Trap Architectures

Keyi Yin, Xiang Fang, Zhuo Chen, David Hayes, Eneet Kaur, Reza Nejabati, Hartmut Häffner, Wesley C. Campbell, Eric R. Hudson, Jens Palsberg, Travis S. Humble, Yufei Ding

Published Mar 10, 2026• 12 citations
arXivHTMLPDF

Abstract

Recent advances in quantum hardware and error correction have paved the way for early fault-tolerant (EFT) quantum computing. We propose iSwitch, a hybrid system architecture for trapped-ion quantum computers (TIQC) that exploits ultra-high-fidelity single-qubit gates and efficient logical CNOTs enabled by ion shuttling. iSwitch employs bare qubits for single-qubit operations and QEC-encoded logical qubits for two-qubit gates, avoiding full logical encoding, gate synthesis, and magic state distillation. To enable this selective encoding, we develop a low-noise conversion protocol between bare and logical qubits, a hybrid instruction set tailored to 2D TIQC layouts, and a compiler that minimizes conversion overhead and optimizes scheduling. Evaluations on variational quantum algorithm benchmarks show that iSwitch achieves comparable fidelity to conventional QEC methods, while reducing qubit and operation counts by roughly 33–50%, offering a practical, resource-efficient path toward EFT quantum computing on trapped-ion platforms.

DOI
10.1145/3779212.3790177

Related papers

Ion-trap chip architecture optimized for the implementation of quantum error-correcting codes

Jeonghoon Lee, Hyeongjun Jeon, Taehyun Kim

We propose a scalable trapped-ion quantum-computing architecture that efficiently incorporates quantum error correction. The chip design exploits orthogonal qubit connectivity by assigning horizontal trap regions to transversal logical gates and vertical regions to nontransversal gates and syndrome extraction, thereby enabling universal gate operations with minimal ion shuttling and reduced hardware complexity. Using a dedicated software tool, we evaluate the architecture on several benchmark algorithms and scheduling policies for two-dimensional color code of varying code distance. Our results demonstrate that increasing the code distance by two reduces the effective logical two-qubit gate error probability by approximately two orders of magnitude, reaching values as low as $10^{-8}$ with the $[[31, 1, 7]]$ color code. This improvement substantially expands the range of algorithms that can be executed reliably, up to scales of a few thousand logical qubits, depending on the algorithmic structure. Overall, these findings validate the practicality and scalability of the proposed architecture and its control strategies, highlighting a viable route toward fault-tolerant, trapped-ion quantum computing.

arXiv:2501.15200•Physical Review A•Feb 18, 2026•1 citation

Experimental validation of a compact fault-tolerant architecture for trapped ions

Noah Berthusen, Ali Lavasani, Asmae Benhemou +11 more

Quantum error correction (QEC) is beginning to enable logical operations that outperform their unencoded physical counterparts, but useful fault-tolerant computation will require more than low-error quantum memory. An effective architecture must orchestrate efficient logical encoding, low-overhead logical operations, and access to the non-Clifford resources required for universal computation. Here, we introduce and experimentally validate such an architecture based on the $[[20,2,6]]$ $C_4$-Helix code, designed for the early fault-tolerant regime. Using Quantinuum Helios, a 98-qubit trapped-ion quantum processor, we experimentally demonstrate the principal components of this architecture: we perform repeated quantum error correction with an error of $4.6^{+6.2}_{-2.6}\times10^{-5}$ per logical qubit per QEC cycle. We benchmark the complete Clifford group on the two logical qubits of a single codeblock under active error correction, obtaining an error of $2.8^{+1.0}_{-1.6}\times 10^{-4}$ per two-qubit logical Clifford. We further demonstrate a fault-tolerant chain-map interface between $C_4$-Helix and a distance-5 surface code, preparing a heterogeneous three-logical-qubit GHZ state with a fidelity lower bound of $99.925^{+0.068}_{-0.245}\%$. In each case, the encoded implementation outperforms its corresponding unencoded physical baseline without relying on postselection. Circuit-level simulations indicate that improvements in physical fidelity bring the same architecture into the $10^{-6}$-$10^{-8}$ logical-error regime targeted for early fault-tolerant computation. Together, these results establish $C_4$-Helix as a hardware-validated fault-tolerant architecture rather than a bare quantum memory.

quant-pharXiv:2609.03194•Sep 4, 2026•8 citations

Hybrid Optimization-Driven Performance Benchmarking of Logical Qubits for Reliable Fault-Tolerant Quantum Computing

P. Nirupama, Seeniappan Kaliappan, M. Muthukannan +1 more

Recent developments in quantum computation have motivated the search for scalable logical qubit architectures that may strongly suppress errors under hardware constraints and realistic noise conditions. Although the field of QEC codes and decoders achieved substantial progress, previous work either focuses on individual solutions that are disconnected from each other or proposed specific benchmarking setups without a common framework to evaluate them; criteria used may include hardware abstraction level, decoding latency, hybrid optimization heuristic etc., as well as application-level performance metrics. Towards this end, we propose a complete end-to-end benchmarking suite tailored to assess the efficacy of logical quantum computing within a wide variety of quantum settings such as superconducting qubits, trapped ions, neutral atoms and photonic systems. It is mainly to find out the best configuration that keeps a tradeoff between logical reliability and physical resource overhead as well as operation real time requirement. The framework includes surface codes, qLDPC codes, and bosonic encoding schemes as well as hybrid-adaptive code-distance optimization to study trade-offs between logical error rates and physical qubit costs. Numerical results also demonstrate that the proposed hybrid adaptive schemes significantly increase the probability of successful task release and reduce the total cost of resource compared with fixed-distance-based ones. Simulation results demonstrate lower logical failure probability and favorable effective throughput performance in presence of practical decoder latency constraints. The proposed approach provides a standardized benchmarking methodology for scalable quantum systems and the ability to effectively benchmark near-term quantum workloads, cloud-based quantum services and future fault-tolerant quantum applications.

•Sep 1, 2026•0 citations

Computing with many encoded logical qubits beyond break-even

Shival Dasu, Matthew DeCross, Andrew Y. Guo +42 more

High-rate quantum error correcting (QEC) codes encode many logical qubits in a given number of physical qubits, making them promising candidates for quantum computation. Implementing high-rate codes at a scale that both frustrates classical computing and improves performance by encoding requires both high fidelity gates and long-range qubit connectivity -- both of which are offered by trapped-ion quantum computers. Here, we demonstrate computations that outperform their unencoded counterparts in the high-rate $[[ k+2,\, k,\, 2 ]]$ iceberg quantum error detecting (QED) and $[[ (k_2 + 2)(k_1 + 2),\, k_2k_1,\, 4 ]]$ two-level concatenated iceberg QEC codes, using the 98-qubit Quantinuum Helios trapped-ion quantum processor. Utilizing new gadgets for encoded operations, we realize this "beyond break-even" performance with reasonable postselection rates across a range of fault-tolerant (FT) and partially-fault-tolerant (pFT) component and application benchmarks with between $48$ and $94$ logical qubits. These benchmarks include FT state preparation and measurement, QEC cycle benchmarking, logical gate benchmarking, GHZ state preparation, and a pFT quantum simulation of the three-dimensional $XY$ model of quantum magnetism. Additionally, we illustrate that postselection rates can be suppressed by increasing the code distance via concatenation. Our results represent state-of-the-art logical component and state fidelities and provide evidence that high-rate QED/QEC codes are viable on contemporary quantum computers for near-term beyond-classical-scale computation.

quant-pharXiv:2602.22211•Feb 26, 2026•42 citations

High-fidelity entanglement of metastable trapped-ion qubits with integrated erasure conversion

A. Quinn, G. J. Gregory, I. D. Moore +6 more

Today's most advanced ion trap quantum computers have significant overhead due to the need for dual-species operation. Looking ahead, logical qubit register sizes will be limited by the encoding rate needed to correct generic Pauli errors. We address both of these issues by establishing high-fidelity control of metastable qubits, a key component of \textit{omg} or dual-type architectures, which enables converting a significant fraction of gate errors to erasures. We first implement an erasure conversion scheme which enables detection of $\sim 94\%$ of spontaneous Raman scattering errors during logic gates and nearly all errors from qubit decay. Second, we perform a two-ion geometric phase gate using far-detuned (-44\,THz) stimulated Raman transitions to produce an entangled state with a raw Bell state fidelity of 97.73\% and a SPAM-corrected Bell state fidelity of 98.61\%. When subtracting erasure errors, this fidelity becomes 99.16\%. These results, along with projections based on our detailed error budget, demonstrate metastable trapped-ion qubits as a platform for low-overhead, fault-tolerant quantum computing.

arXiv:2411.12727•Physical Review A•Mar 17, 2026•11 citations

Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture

Felix Tripier, Woo Chang Chung, Jacob Young +15 more

We propose a fault-tolerant quantum computer architecture for trapped-ion devices, which we call the walking cat architecture. Our blueprint includes a compiler, a detailed description of all the quantum error-correction protocols, a micro-architecture, a sufficiently fast decoder, and thorough simulations. The backbone of the architecture is a cat factory, producing cat states distributed throughout the machine, which are consumed to perform logical operations. The walking cat architecture is based entirely on a modern quantum error-correction approach called low-density parity-check (LDPC) codes. We identify promising instances of the walking cat architecture, such as (1) a simple architecture based on a single LDPC code, (2) a fast architecture based on fast logical gates relying on a [[70, 6, 9]] code, equipped with Clifford-frame tracking for any 6-qubit Clifford gate, and (3) a dense architecture based on a [[102, 22, 9]]] code encoding 22 logical qubits per memory block. Our dense architecture provides a design with 110 logical qubits executing about one million T gates per day using only 2,514 physical qubits. We estimate that the quantum Hamiltonian simulation of a Heisenberg model on 100 sites can be executed within one month with 10,000 physical qubits, including all shots required to achieve chemical accuracy, suggesting that such a device could enter the regime of classically intractable physics simulations. Our design relies on hardware components that have been experimentally demonstrated on small devices. We emphasize simplicity over hypothetical performance to facilitate the practical realization of this machine. Based on this approach, we believe that a fault-tolerant quantum computer with hundreds of logical qubits capable of running millions of logical gates can be built in the near term, providing a platform to explore a broad range of applications.

quant-pharXiv:2604.19481•Apr 22, 2026•36 citations
Recent advances in quantum hardware and error correction have paved the way for early fault-tolerant (EFT) quantum computing. We propose iSwitch, a hybrid system architecture for trapped-ion quantum computers (TIQC) that exploits ultra-high-fidelity single-qubit gates and efficient logical CNOTs enabled by ion shuttling. iSwitch employs bare qubits for single-qubit operations and QEC-encoded logical qubits for two-qubit gates, avoiding full logical encoding, gate synthesis, and magic state distillation. To enable this selective encoding, we develop a low-noise conversion protocol between bare and logical qubits, a hybrid instruction set tailored to 2D TIQC layouts, and a compiler that minimizes conversion overhead and optimizes scheduling. Evaluations on variational quantum algorithm benchmarks show that iSwitch achieves comparable fidelity to conventional QEC methods, while reducing qubit and operation counts by roughly 33–50%, offering a practical, resource-efficient path toward EFT quantum computing on trapped-ion platforms.
We propose a scalable trapped-ion quantum-computing architecture that efficiently incorporates quantum error correction. The chip design exploits orthogonal qubit connectivity by assigning horizontal trap regions to transversal logical gates and vertical regions to nontransversal gates and syndrome extraction, thereby enabling universal gate operations with minimal ion shuttling and reduced hardware complexity. Using a dedicated software tool, we evaluate the architecture on several benchmark algorithms and scheduling policies for two-dimensional color code of varying code distance. Our results demonstrate that increasing the code distance by two reduces the effective logical two-qubit gate error probability by approximately two orders of magnitude, reaching values as low as 10−810^{-8}10−8 with the [[31,1,7]][[31, 1, 7]][[31,1,7]] color code. This improvement substantially expands the range of algorithms that can be executed reliably, up to scales of a few thousand logical qubits, depending on the algorithmic structure. Overall, these findings validate the practicality and scalability of the proposed architecture and its control strategies, highlighting a viable route toward fault-tolerant, trapped-ion quantum computing.
Quantum error correction (QEC) is beginning to enable logical operations that outperform their unencoded physical counterparts, but useful fault-tolerant computation will require more than low-error quantum memory. An effective architecture must orchestrate efficient logical encoding, low-overhead logical operations, and access to the non-Clifford resources required for universal computation. Here, we introduce and experimentally validate such an architecture based on the [[20,2,6]][[20,2,6]][[20,2,6]] C4C_4C4​-Helix code, designed for the early fault-tolerant regime. Using Quantinuum Helios, a 98-qubit trapped-ion quantum processor, we experimentally demonstrate the principal components of this architecture: we perform repeated quantum error correction with an error of 4.6−2.6+6.2×10−54.6^{+6.2}_{-2.6}\times10^{-5}4.6−2.6+6.2​×10−5 per logical qubit per QEC cycle. We benchmark the complete Clifford group on the two logical qubits of a single codeblock under active error correction, obtaining an error of 2.8−1.6+1.0×10−42.8^{+1.0}_{-1.6}\times 10^{-4}2.8−1.6+1.0​×10−4 per two-qubit logical Clifford. We further demonstrate a fault-tolerant chain-map interface between C4C_4C4​-Helix and a distance-5 surface code, preparing a heterogeneous three-logical-qubit GHZ state with a fidelity lower bound of 99.925−0.245+0.068%99.925^{+0.068}_{-0.245}\%99.925−0.245+0.068​%. In each case, the encoded implementation outperforms its corresponding unencoded physical baseline without relying on postselection. Circuit-level simulations indicate that improvements in physical fidelity bring the same architecture into the 10−610^{-6}10−6-10−810^{-8}10−8 logical-error regime targeted for early fault-tolerant computation. Together, these results establish C4C_4C4​-Helix as a hardware-validated fault-tolerant architecture rather than a bare quantum memory.
Recent developments in quantum computation have motivated the search for scalable logical qubit architectures that may strongly suppress errors under hardware constraints and realistic noise conditions. Although the field of QEC codes and decoders achieved substantial progress, previous work either focuses on individual solutions that are disconnected from each other or proposed specific benchmarking setups without a common framework to evaluate them; criteria used may include hardware abstraction level, decoding latency, hybrid optimization heuristic etc., as well as application-level performance metrics. Towards this end, we propose a complete end-to-end benchmarking suite tailored to assess the efficacy of logical quantum computing within a wide variety of quantum settings such as superconducting qubits, trapped ions, neutral atoms and photonic systems. It is mainly to find out the best configuration that keeps a tradeoff between logical reliability and physical resource overhead as well as operation real time requirement. The framework includes surface codes, qLDPC codes, and bosonic encoding schemes as well as hybrid-adaptive code-distance optimization to study trade-offs between logical error rates and physical qubit costs. Numerical results also demonstrate that the proposed hybrid adaptive schemes significantly increase the probability of successful task release and reduce the total cost of resource compared with fixed-distance-based ones. Simulation results demonstrate lower logical failure probability and favorable effective throughput performance in presence of practical decoder latency constraints. The proposed approach provides a standardized benchmarking methodology for scalable quantum systems and the ability to effectively benchmark near-term quantum workloads, cloud-based quantum services and future fault-tolerant quantum applications.
High-rate quantum error correcting (QEC) codes encode many logical qubits in a given number of physical qubits, making them promising candidates for quantum computation. Implementing high-rate codes at a scale that both frustrates classical computing and improves performance by encoding requires both high fidelity gates and long-range qubit connectivity -- both of which are offered by trapped-ion quantum computers. Here, we demonstrate computations that outperform their unencoded counterparts in the high-rate [[k+2, k, 2]][[ k+2,\, k,\, 2 ]][[k+2,k,2]] iceberg quantum error detecting (QED) and [[(k2+2)(k1+2), k2k1, 4]][[ (k_2 + 2)(k_1 + 2),\, k_2k_1,\, 4 ]][[(k2​+2)(k1​+2),k2​k1​,4]] two-level concatenated iceberg QEC codes, using the 98-qubit Quantinuum Helios trapped-ion quantum processor. Utilizing new gadgets for encoded operations, we realize this "beyond break-even" performance with reasonable postselection rates across a range of fault-tolerant (FT) and partially-fault-tolerant (pFT) component and application benchmarks with between 484848 and 949494 logical qubits. These benchmarks include FT state preparation and measurement, QEC cycle benchmarking, logical gate benchmarking, GHZ state preparation, and a pFT quantum simulation of the three-dimensional XYXYXY model of quantum magnetism. Additionally, we illustrate that postselection rates can be suppressed by increasing the code distance via concatenation. Our results represent state-of-the-art logical component and state fidelities and provide evidence that high-rate QED/QEC codes are viable on contemporary quantum computers for near-term beyond-classical-scale computation.
Today's most advanced ion trap quantum computers have significant overhead due to the need for dual-species operation. Looking ahead, logical qubit register sizes will be limited by the encoding rate needed to correct generic Pauli errors. We address both of these issues by establishing high-fidelity control of metastable qubits, a key component of \textit{omg} or dual-type architectures, which enables converting a significant fraction of gate errors to erasures. We first implement an erasure conversion scheme which enables detection of ∼94%\sim 94\%∼94% of spontaneous Raman scattering errors during logic gates and nearly all errors from qubit decay. Second, we perform a two-ion geometric phase gate using far-detuned (-44\,THz) stimulated Raman transitions to produce an entangled state with a raw Bell state fidelity of 97.73\% and a SPAM-corrected Bell state fidelity of 98.61\%. When subtracting erasure errors, this fidelity becomes 99.16\%. These results, along with projections based on our detailed error budget, demonstrate metastable trapped-ion qubits as a platform for low-overhead, fault-tolerant quantum computing.
We propose a fault-tolerant quantum computer architecture for trapped-ion devices, which we call the walking cat architecture. Our blueprint includes a compiler, a detailed description of all the quantum error-correction protocols, a micro-architecture, a sufficiently fast decoder, and thorough simulations. The backbone of the architecture is a cat factory, producing cat states distributed throughout the machine, which are consumed to perform logical operations. The walking cat architecture is based entirely on a modern quantum error-correction approach called low-density parity-check (LDPC) codes. We identify promising instances of the walking cat architecture, such as (1) a simple architecture based on a single LDPC code, (2) a fast architecture based on fast logical gates relying on a [[70, 6, 9]] code, equipped with Clifford-frame tracking for any 6-qubit Clifford gate, and (3) a dense architecture based on a [[102, 22, 9]]] code encoding 22 logical qubits per memory block. Our dense architecture provides a design with 110 logical qubits executing about one million T gates per day using only 2,514 physical qubits. We estimate that the quantum Hamiltonian simulation of a Heisenberg model on 100 sites can be executed within one month with 10,000 physical qubits, including all shots required to achieve chemical accuracy, suggesting that such a device could enter the regime of classically intractable physics simulations. Our design relies on hardware components that have been experimentally demonstrated on small devices. We emphasize simplicity over hypothetical performance to facilitate the practical realization of this machine. Based on this approach, we believe that a fault-tolerant quantum computer with hundreds of logical qubits capable of running millions of logical gates can be built in the near term, providing a platform to explore a broad range of applications.