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

ITU and Fault-Tolerant Quantum Computing: A Single-Axiom Derivation of Optimal QECC Architectures

Munehiro Terada

Published May 12, 2026• 0 citations
Publisher

Abstract

We apply the Information-Theoretic Unification (ITU) framework (Terada 2026, concept DOI 10.5281/zenodo.20109209; current version v2.0.0 at 10.5281/zenodo.20133709) to fault-tolerant quantum computing. Phase 5 of ITU established that bulk locality in AdS/CFT is mathematically equivalent to a quantum error correction code (QECC); here we exploit the reverse direction — using the ITU axiom δS = δ⟨K⟩ to derive optimal QECC architectures for practical quantum computation. This is a Tier 1 application paper, complementary to the Tier 0 core ITU theory. It is the first in a planned series of focused application papers (ITU + AI, ITU + cancer biology, ITU + economics, etc.), each as an independent Zenodo deposit linked via isSupplementTo relations to the core ITU concept DOI. Phase 43: [[5,1,3]] perfect quantum code — the discrete realization of bulk locality in AdS₃/CFT₂ (Pastawski-Yoshida-Harlow-Preskill HaPPY code building block) — verified as a complete fault-tolerant primitive: 4 stabilizers, code distance d = 3, all 15 single-qubit Pauli errors yield distinct syndromes, decoder lookup table of size 16 maps every syndrome to its corrective operation, and the encoded logical error rate is below the bare-qubit rate at physical error rates up to 25%. Phase 44: Toric/surface code threshold simulated for L = 3, 5, 7 (18, 50, 98 qubits) under independent bit-flip noise. Empirical threshold p_c ≈ 0.045 with a greedy nearest-neighbor decoder (theoretical perfect-MWPM threshold ~0.103); exponential error suppression with lattice size confirmed. The toric code is the discrete realization of AdS₃/CFT₂ bulk locality at finite size. Phase 45: Magic state distillation (Bravyi-Kitaev 5-to-1 protocol) verified using the same [[5,1,3]] code from Phase 43. Fit slope = 1.98 (theoretical 2.0; quadratic suppression confirmed), coefficient c ≈ 10, threshold ε_th ≈ 0.129. Iterated distillation converges to machine precision (10⁻¹⁶) in 4-6 rounds below threshold. This completes the path from Clifford to universal fault-tolerant computation. Phase 46: NISQ-era resource estimates for 11 hardware platforms (IBM Heron R1, IBM Condor, IBM Flamingo, IBM Kookaburra, Google Willow, Google projected 2026, IonQ Forte, IonQ Tempo, Quantinuum H2, Quantinuum H3 projected, Rigetti Ankaa-3). At physical error rate p = 10⁻³ (current best), standard surface code requires distance d = 11 (302 physical qubits per logical qubit). A hypothetical ITU-optimised code with 2× threshold improvement reduces this to d = 9 (202 physical qubits per logical qubit), a 40-60% overhead reduction. IBM Kookaburra (2026, 4158 qubits) is projected to support 13 logical qubits with standard codes, 20 with ITU-optimised codes. Central thesis: the same single information-theoretic axiom that yields emergent spacetime (ITU Phases 1-32), life (Phases 33-39), and consciousness (Phases 41-42) also yields practical quantum-computing primitives ready for near-term hardware deployment. ITU is not merely a theoretical TOE but a constructive framework that can be applied to engineering problems. Includes 4 theory documents (Markdown), 4 Python numerical experiments, 4 result figures, 4 JSON summaries, paper metadata (CITATION.cff, .zenodo.json, README). Total runtime ~30 seconds on a modern laptop.

DOI
10.5281/zenodo.20139391

Related papers

Quantum Error Correction and Fault-Tolerant Computing: Recent Progress in Codes, Decoders, and Architectures

Volkan Erol

Quantum error correction (QEC) represents the cornerstone technology for realizing fault-tolerant quantum computing, addressing the fundamental challenge of quantum state decoherence in noisy intermediate-scale quantum (NISQ) devices. This comprehensive review examines recent advances in QEC implementations from 2020-2024, spanning theoretical foundations to practical hardware demonstrations. We analyze the evolution from pioneering stabilizer codes to modern topological approaches, with particular emphasis on surface codes and low-density parity-check (LDPC) codes that have demonstrated below-threshold error correction in superconducting and trapped-ion systems. The paper provides a comparative analysis of classical and machine learning-based decoder algorithms, evaluating their performance through complexity analysis and threshold comparisons in real-time error correction scenarios. Through examination of breakthrough experiments by Google, IBM, Quantinuum, and emerging platforms, we assess the current state of fault-tolerant quantum computing and identify critical engineering challenges including correlated noise models, cryogenic control systems, and scalable logical gate implementations. Our quantitative analysis reveals that while significant progress has been made toward practical fault-tolerance thresholds, achieving the resource efficiency and reliability required for large-scale quantum computation remains challenging. We provide detailed resource estimates for key applications including Shor's algorithm and optimization problems, along with analysis of industry roadmaps toward thousand-logical-qubit systems. This review serves as a comprehensive guide for researchers and engineers working toward the next generation of fault-tolerant quantum computers, with particular focus on information-theoretic perspectives relevant to quantum information entropy and syndrome processing.

•Sep 30, 2025•3 citations

Quantum Error Correction and Fault-Tolerant Computing: Recent Progress in Codes, Decoders, and Architectures

Volkan Erol

Quantum error correction (QEC) represents the cornerstone technology for realizing fault-tolerant quantum computing, addressing the fundamental challenge of quantum state decoherence in noisy intermediate-scale quantum (NISQ) devices. This comprehensive review examines recent advances in QEC implementations from 2020-2024, spanning theoretical foundations to practical hardware demonstrations. We analyze the evolution from pioneering stabilizer codes to modern topological approaches, with particular emphasis on surface codes and low-density parity-check (LDPC) codes that have demonstrated below-threshold error correction in superconducting and trapped-ion systems. The paper provides a comparative analysis of classical and machine learning-based decoder algorithms, evaluating their performance through complexity analysis and threshold comparisons in real-time error correction scenarios. Through examination of breakthrough experiments by Google, IBM, Quantinuum, and emerging platforms, we assess the current state of fault-tolerant quantum computing and identify critical engineering challenges including correlated noise models, cryogenic control systems, and scalable logical gate implementations. Our quantitative analysis reveals that while significant progress has been made toward practical fault-tolerance thresholds, achieving the resource efficiency and reliability required for large-scale quantum computation remains challenging. We provide detailed resource estimates for key applications including Shor's algorithm and optimization problems, along with analysis of industry roadmaps toward thousand-logical-qubit systems. This review serves as a comprehensive guide for researchers and engineers working toward the next generation of fault-tolerant quantum computers, with particular focus on information-theoretic perspectives relevant to quantum information entropy and syndrome processing.

•Sep 26, 2025•4 citations

Quantum Computing in 2026: A Comprehensive Architectural, Physical, and Algorithmic Analysis of the Transition from Noisy Intermediate-Scale Quantum (NISQ) Processors to Fault-Tolerant Logical Qubits, High-Rate qLDPC Codes, and Quantum-Centric Supercomputing

Sandeep, Gautam, Sankalp, Dr. Vishal Shrivastava, Dr.Akhil Pandey, Er.Ram Babu Buri

The years 2025 and 2026 mark a historic inflection point in quantum information science: the definitive transition from the Noisy Intermediate-Scale Quantum (NISQ) era toward early Fault-Tolerant Quantum Computing (FTQC) and Quantum-Centric Supercomputing. For nearly three decades, the central impediment to scalable quantum computation was that adding physical qubits increased aggregate decoherence faster than Quantum Error Correction (QEC) codes could suppress it. This barrier was decisively shattered by recent experimental milestones demonstrating below-threshold exponential error suppression on superconducting surface codes (Google's 105-qubit Willow and USTC's 107-qubit Zuchongzhi 3.2), high-rate Bivariate Bicycle quantum Low-Density Parity-Check (qLDPC) memory modules reducing physical qubit overhead by over 90% (IBM's Heron, Nighthawk, and 2026 Kookaburra architectures), reconfigurable neutral-atom optical tweezer arrays executing transversal logical gates (QuEra and Harvard), 99.92%–99.99% fidelity trapped-ion systems (Quantinuum Helios and Oxford Ionics), bosonic cat-qubit processors (AWS Ocelot), and topological InAs-Al nanowire interferometry (Microsoft Majorana 1). This paper presents a comprehensive architectural, mathematical, and algorithmic investigation of the 2026 quantum computing landscape. We formalize a five-layer Quantum-Centric Supercomputing reference stack integrating heterogeneous physical modalities, 4K cryo-CMOS and NVQLink GPU-QPU interconnects, sub-microsecond real-time syndrome decoders, CUDA-Q/Qiskit 2.0 hybrid compilers, and domain applications. We formulate rigorous mathematical models for Lindblad open-system decoherence, surface-code below-threshold scaling (Lambda > 1), Bivariate Bicycle [[144, 12, 12]] qLDPC codes, bosonic cat-qubit bit-flip suppression, and hybrid Variational/FaultTolerant Hamiltonian simulation. Finally, we evaluate NIST Post-Quantum Cryptography (FIPS 203 ML-KEM and FIPS 204 ML-DSA) migration imperatives and chart the roadmap toward mega-quop fault-tolerant machines.

•Nov 6, 2026•0 citations

Aspects of Fault-Tolerant Quantum Computation

Joseph K. Iverson

This thesis is concerned with fault-tolerant quantum information processing using quantum error-correcting codes. It contains two major pieces of work. The first is a study of coherent noise in the context of stabilizer error-correcting codes. The second is a proposed scheme for a universal set of fault-tolerant logical gates in a particular code family built out of the 3D toric code. Chapter 1 provides an introduction to quantum computation and fault tolerance. Many basic concepts in error-correcting codes are defined. Special attention is paid to the set of code properties that are most likely to determine how easily a given fault-tolerant scheme might be implemented on a physical device. These include the fault-tolerant noise threshold and the overhead. In Chapters 2 and 3 we study the effectiveness of quantum error correction against coherent noise. Coherent errors (for example, unitary noise) can interfere constructively, so that in some cases the average infidelity of a quantum circuit subjected to coherent errors may increase quadratically with the circuit size; in contrast, when errors are incoherent (for example, depolarizing noise), the average infidelity increases at worst linearly with circuit size. We consider the performance of quantum stabilizer codes against a noise model in which a unitary rotation is applied to each qubit, where the axes and angles of rotation are nearly the same for all qubits. In Chapter 2 we introduce coherent noise and incoherent noise and a number of methods that are useful for the study of coherent noise. We study the repetition code as a basic example, and we also study a correlated noise model. In Chapter 3 we show that for the toric code subject to such independent coherent noise, and for minimal-weight decoding, the logical channel after error correction becomes increasingly incoherent as the length of the code increases, provided the noise strength decays inversely with the code distance. A similar conclusion holds for weakly correlated coherent noise. Our methods can also be used for analyzing the performance of other codes and fault-tolerant protocols against coherent noise. However, our result does not show that the coherence of the logical channel is suppressed in the more physically relevant case where the noise strength is held constant as the code block grows, and we recount the difficulties that prevented us from extending the result to that case. Nevertheless our work supports the idea that fault-tolerant quantum computing schemes will work effectively against coherent noise, providing encouraging news for quantum hardware builders who worry about the damaging effects of control errors and coherent interactions with the environment. Chapter 4 is connected to another aspect of fault tolerance, fault-tolerant logical gates. The toric code is a promising candidate for fault-tolerant quantum computation because of its high threshold and low-weight stabilizers. A universal gate set in the toric code generally requires magic state distillation, which can incur a significant qubit overhead. In this work we construct an error-correcting code in three dimensions based on the toric code that features a fault-tolerant T gate with no magic state distillation required. We further describe a subsystem version of our code which supports a universal set of fault-tolerant gates. This code can be converted into the stabilizer version using gauge-fixing. We also argue that our code can be converted to a (2+1)-D protocol, where a 2D lattice undergoes a measurement-based protocol over time. In this way, a fault-tolerant logical T gate can be realized in a 2D toric code structure.

•Jun 1, 2020•2 citations

Advances in Logical Qubits and Quantum Error Correction: Progress Toward Fault-Tolerant Quantum Computing

Mirza Adnan Mohtashim

Quantum computing has reached a pivotal inflection point with the recent demonstration ofbelow-threshold quantum error correction and the emergence of logical qubits that outperformtheir physical counterparts. This review synthesizes the remarkable progress achieved between2024 and 2026 across multiple quantum hardware platforms, including superconducting circuits,trapped ions, and neutral atom arrays. We examine the theoretical foundations of quantumerror correction codes, with particular emphasis on surface codes and the rapidly advancingquantum low-density parity-check (qLDPC) codes. Key experimental milestones are analyzed,including Google’s Willow chip demonstration of exponential error suppression, IBM’s modularfault-tolerant roadmap culminating in the Starling system, IonQ’s achievement of 48 logicalqubits with a 2:1 encoding ratio, and QuEra’s record-efficiency neutral atom error correctionapproaching the Teraquop regime. The review further explores critical enabling technologiessuch as real-time decoding architectures, magic state distillation protocols, and fault-tolerant gateimplementations. We discuss the remaining challenges in scaling to hundreds of logical qubits,achieving practical logical error rates of 10−10 to 10−15, and realizing end-to-end fault-tolerantalgorithms. By synthesizing these developments, this article provides a comprehensive assessmentof the field’s trajectory toward practical fault-tolerant quantum computing and identifies the keymilestones that will define the next phase of progress.

•May 12, 2026•0 citations

High-threshold decoding of non-Pauli codes for 2D universality

Julio C. Magdalena de la Fuente, Noa Feldman, Jens Eisert +1 more

Topological codes have many desirable properties that allow fault-tolerant quantum computation with relatively low overhead. A core challenge for these codes, however, is to achieve a low-overhead universal gate set with limited connectivity. In this work, we explore a non-Pauli stabilizer code that can be used to complete a universal gate set on topological toric and surface codes in strictly two dimensions. Fault-tolerant syndrome extraction for the non-Pauli code requires mid-circuit $X$ corrections, a key difference to conventional Pauli codes. We construct and benchmark a just-in-time (JIT) matching decoder to reliably decide these corrections. Under a phenomenological error model with equally likely physical and measurement errors, we find a high threshold of $\approx 2.5\,\%$, close to the $\approx 2.9\,\%$ of a decoder with access to the full syndrome history. We also perform a finite-size scaling analysis to estimate how the logical error rate scales below threshold and verify an exponential suppression in both physical error rate and in the system size. A second global decoding step for $Z$ errors is required and the non-Clifford gates in the circuit reduce the threshold from $\approx 2.9\,\%$ to $\approx 1.8\,\%$ with a naive decoder. We show how $Z$ decoding can be improved using knowledge of the $X$ corrections, pushing the threshold to $\approx 2.2\,\%$. Our results suggest non-Clifford logic in 2D codes could perform comparably to 2D quantum memory. Our formalism for efficient benchmarking and decoding directly generalizes to a broader family of CSS codes whose $X$ stabilizers are twisted by diagonal Clifford operators, and spacetime versions thereof, defined by CSS-like circuits enriched by $CCZ$, $CS$, and $T$ gates.

quant-pharXiv:2604.02033•Apr 3, 2026•21 citations
We apply the Information-Theoretic Unification (ITU) framework (Terada 2026, concept DOI 10.5281/zenodo.20109209; current version v2.0.0 at 10.5281/zenodo.20133709) to fault-tolerant quantum computing. Phase 5 of ITU established that bulk locality in AdS/CFT is mathematically equivalent to a quantum error correction code (QECC); here we exploit the reverse direction — using the ITU axiom δS = δ⟨K⟩ to derive optimal QECC architectures for practical quantum computation. This is a Tier 1 application paper, complementary to the Tier 0 core ITU theory. It is the first in a planned series of focused application papers (ITU + AI, ITU + cancer biology, ITU + economics, etc.), each as an independent Zenodo deposit linked via isSupplementTo relations to the core ITU concept DOI. Phase 43: [[5,1,3]] perfect quantum code — the discrete realization of bulk locality in AdS₃/CFT₂ (Pastawski-Yoshida-Harlow-Preskill HaPPY code building block) — verified as a complete fault-tolerant primitive: 4 stabilizers, code distance d = 3, all 15 single-qubit Pauli errors yield distinct syndromes, decoder lookup table of size 16 maps every syndrome to its corrective operation, and the encoded logical error rate is below the bare-qubit rate at physical error rates up to 25%. Phase 44: Toric/surface code threshold simulated for L = 3, 5, 7 (18, 50, 98 qubits) under independent bit-flip noise. Empirical threshold p_c ≈ 0.045 with a greedy nearest-neighbor decoder (theoretical perfect-MWPM threshold ~0.103); exponential error suppression with lattice size confirmed. The toric code is the discrete realization of AdS₃/CFT₂ bulk locality at finite size. Phase 45: Magic state distillation (Bravyi-Kitaev 5-to-1 protocol) verified using the same [[5,1,3]] code from Phase 43. Fit slope = 1.98 (theoretical 2.0; quadratic suppression confirmed), coefficient c ≈ 10, threshold ε_th ≈ 0.129. Iterated distillation converges to machine precision (10⁻¹⁶) in 4-6 rounds below threshold. This completes the path from Clifford to universal fault-tolerant computation. Phase 46: NISQ-era resource estimates for 11 hardware platforms (IBM Heron R1, IBM Condor, IBM Flamingo, IBM Kookaburra, Google Willow, Google projected 2026, IonQ Forte, IonQ Tempo, Quantinuum H2, Quantinuum H3 projected, Rigetti Ankaa-3). At physical error rate p = 10⁻³ (current best), standard surface code requires distance d = 11 (302 physical qubits per logical qubit). A hypothetical ITU-optimised code with 2× threshold improvement reduces this to d = 9 (202 physical qubits per logical qubit), a 40-60% overhead reduction. IBM Kookaburra (2026, 4158 qubits) is projected to support 13 logical qubits with standard codes, 20 with ITU-optimised codes. Central thesis: the same single information-theoretic axiom that yields emergent spacetime (ITU Phases 1-32), life (Phases 33-39), and consciousness (Phases 41-42) also yields practical quantum-computing primitives ready for near-term hardware deployment. ITU is not merely a theoretical TOE but a constructive framework that can be applied to engineering problems. Includes 4 theory documents (Markdown), 4 Python numerical experiments, 4 result figures, 4 JSON summaries, paper metadata (CITATION.cff, .zenodo.json, README). Total runtime ~30 seconds on a modern laptop.
Quantum error correction (QEC) represents the cornerstone technology for realizing fault-tolerant quantum computing, addressing the fundamental challenge of quantum state decoherence in noisy intermediate-scale quantum (NISQ) devices. This comprehensive review examines recent advances in QEC implementations from 2020-2024, spanning theoretical foundations to practical hardware demonstrations. We analyze the evolution from pioneering stabilizer codes to modern topological approaches, with particular emphasis on surface codes and low-density parity-check (LDPC) codes that have demonstrated below-threshold error correction in superconducting and trapped-ion systems. The paper provides a comparative analysis of classical and machine learning-based decoder algorithms, evaluating their performance through complexity analysis and threshold comparisons in real-time error correction scenarios. Through examination of breakthrough experiments by Google, IBM, Quantinuum, and emerging platforms, we assess the current state of fault-tolerant quantum computing and identify critical engineering challenges including correlated noise models, cryogenic control systems, and scalable logical gate implementations. Our quantitative analysis reveals that while significant progress has been made toward practical fault-tolerance thresholds, achieving the resource efficiency and reliability required for large-scale quantum computation remains challenging. We provide detailed resource estimates for key applications including Shor's algorithm and optimization problems, along with analysis of industry roadmaps toward thousand-logical-qubit systems. This review serves as a comprehensive guide for researchers and engineers working toward the next generation of fault-tolerant quantum computers, with particular focus on information-theoretic perspectives relevant to quantum information entropy and syndrome processing.
Quantum error correction (QEC) represents the cornerstone technology for realizing fault-tolerant quantum computing, addressing the fundamental challenge of quantum state decoherence in noisy intermediate-scale quantum (NISQ) devices. This comprehensive review examines recent advances in QEC implementations from 2020-2024, spanning theoretical foundations to practical hardware demonstrations. We analyze the evolution from pioneering stabilizer codes to modern topological approaches, with particular emphasis on surface codes and low-density parity-check (LDPC) codes that have demonstrated below-threshold error correction in superconducting and trapped-ion systems. The paper provides a comparative analysis of classical and machine learning-based decoder algorithms, evaluating their performance through complexity analysis and threshold comparisons in real-time error correction scenarios. Through examination of breakthrough experiments by Google, IBM, Quantinuum, and emerging platforms, we assess the current state of fault-tolerant quantum computing and identify critical engineering challenges including correlated noise models, cryogenic control systems, and scalable logical gate implementations. Our quantitative analysis reveals that while significant progress has been made toward practical fault-tolerance thresholds, achieving the resource efficiency and reliability required for large-scale quantum computation remains challenging. We provide detailed resource estimates for key applications including Shor's algorithm and optimization problems, along with analysis of industry roadmaps toward thousand-logical-qubit systems. This review serves as a comprehensive guide for researchers and engineers working toward the next generation of fault-tolerant quantum computers, with particular focus on information-theoretic perspectives relevant to quantum information entropy and syndrome processing.
The years 2025 and 2026 mark a historic inflection point in quantum information science: the definitive transition from the Noisy Intermediate-Scale Quantum (NISQ) era toward early Fault-Tolerant Quantum Computing (FTQC) and Quantum-Centric Supercomputing. For nearly three decades, the central impediment to scalable quantum computation was that adding physical qubits increased aggregate decoherence faster than Quantum Error Correction (QEC) codes could suppress it. This barrier was decisively shattered by recent experimental milestones demonstrating below-threshold exponential error suppression on superconducting surface codes (Google's 105-qubit Willow and USTC's 107-qubit Zuchongzhi 3.2), high-rate Bivariate Bicycle quantum Low-Density Parity-Check (qLDPC) memory modules reducing physical qubit overhead by over 90% (IBM's Heron, Nighthawk, and 2026 Kookaburra architectures), reconfigurable neutral-atom optical tweezer arrays executing transversal logical gates (QuEra and Harvard), 99.92%–99.99% fidelity trapped-ion systems (Quantinuum Helios and Oxford Ionics), bosonic cat-qubit processors (AWS Ocelot), and topological InAs-Al nanowire interferometry (Microsoft Majorana 1). This paper presents a comprehensive architectural, mathematical, and algorithmic investigation of the 2026 quantum computing landscape. We formalize a five-layer Quantum-Centric Supercomputing reference stack integrating heterogeneous physical modalities, 4K cryo-CMOS and NVQLink GPU-QPU interconnects, sub-microsecond real-time syndrome decoders, CUDA-Q/Qiskit 2.0 hybrid compilers, and domain applications. We formulate rigorous mathematical models for Lindblad open-system decoherence, surface-code below-threshold scaling (Lambda > 1), Bivariate Bicycle [[144, 12, 12]] qLDPC codes, bosonic cat-qubit bit-flip suppression, and hybrid Variational/FaultTolerant Hamiltonian simulation. Finally, we evaluate NIST Post-Quantum Cryptography (FIPS 203 ML-KEM and FIPS 204 ML-DSA) migration imperatives and chart the roadmap toward mega-quop fault-tolerant machines.
This thesis is concerned with fault-tolerant quantum information processing using quantum error-correcting codes. It contains two major pieces of work. The first is a study of coherent noise in the context of stabilizer error-correcting codes. The second is a proposed scheme for a universal set of fault-tolerant logical gates in a particular code family built out of the 3D toric code. Chapter 1 provides an introduction to quantum computation and fault tolerance. Many basic concepts in error-correcting codes are defined. Special attention is paid to the set of code properties that are most likely to determine how easily a given fault-tolerant scheme might be implemented on a physical device. These include the fault-tolerant noise threshold and the overhead. In Chapters 2 and 3 we study the effectiveness of quantum error correction against coherent noise. Coherent errors (for example, unitary noise) can interfere constructively, so that in some cases the average infidelity of a quantum circuit subjected to coherent errors may increase quadratically with the circuit size; in contrast, when errors are incoherent (for example, depolarizing noise), the average infidelity increases at worst linearly with circuit size. We consider the performance of quantum stabilizer codes against a noise model in which a unitary rotation is applied to each qubit, where the axes and angles of rotation are nearly the same for all qubits. In Chapter 2 we introduce coherent noise and incoherent noise and a number of methods that are useful for the study of coherent noise. We study the repetition code as a basic example, and we also study a correlated noise model. In Chapter 3 we show that for the toric code subject to such independent coherent noise, and for minimal-weight decoding, the logical channel after error correction becomes increasingly incoherent as the length of the code increases, provided the noise strength decays inversely with the code distance. A similar conclusion holds for weakly correlated coherent noise. Our methods can also be used for analyzing the performance of other codes and fault-tolerant protocols against coherent noise. However, our result does not show that the coherence of the logical channel is suppressed in the more physically relevant case where the noise strength is held constant as the code block grows, and we recount the difficulties that prevented us from extending the result to that case. Nevertheless our work supports the idea that fault-tolerant quantum computing schemes will work effectively against coherent noise, providing encouraging news for quantum hardware builders who worry about the damaging effects of control errors and coherent interactions with the environment. Chapter 4 is connected to another aspect of fault tolerance, fault-tolerant logical gates. The toric code is a promising candidate for fault-tolerant quantum computation because of its high threshold and low-weight stabilizers. A universal gate set in the toric code generally requires magic state distillation, which can incur a significant qubit overhead. In this work we construct an error-correcting code in three dimensions based on the toric code that features a fault-tolerant T gate with no magic state distillation required. We further describe a subsystem version of our code which supports a universal set of fault-tolerant gates. This code can be converted into the stabilizer version using gauge-fixing. We also argue that our code can be converted to a (2+1)-D protocol, where a 2D lattice undergoes a measurement-based protocol over time. In this way, a fault-tolerant logical T gate can be realized in a 2D toric code structure.
Quantum computing has reached a pivotal inflection point with the recent demonstration ofbelow-threshold quantum error correction and the emergence of logical qubits that outperformtheir physical counterparts. This review synthesizes the remarkable progress achieved between2024 and 2026 across multiple quantum hardware platforms, including superconducting circuits,trapped ions, and neutral atom arrays. We examine the theoretical foundations of quantumerror correction codes, with particular emphasis on surface codes and the rapidly advancingquantum low-density parity-check (qLDPC) codes. Key experimental milestones are analyzed,including Google’s Willow chip demonstration of exponential error suppression, IBM’s modularfault-tolerant roadmap culminating in the Starling system, IonQ’s achievement of 48 logicalqubits with a 2:1 encoding ratio, and QuEra’s record-efficiency neutral atom error correctionapproaching the Teraquop regime. The review further explores critical enabling technologiessuch as real-time decoding architectures, magic state distillation protocols, and fault-tolerant gateimplementations. We discuss the remaining challenges in scaling to hundreds of logical qubits,achieving practical logical error rates of 10−10 to 10−15, and realizing end-to-end fault-tolerantalgorithms. By synthesizing these developments, this article provides a comprehensive assessmentof the field’s trajectory toward practical fault-tolerant quantum computing and identifies the keymilestones that will define the next phase of progress.
Topological codes have many desirable properties that allow fault-tolerant quantum computation with relatively low overhead. A core challenge for these codes, however, is to achieve a low-overhead universal gate set with limited connectivity. In this work, we explore a non-Pauli stabilizer code that can be used to complete a universal gate set on topological toric and surface codes in strictly two dimensions. Fault-tolerant syndrome extraction for the non-Pauli code requires mid-circuit XXX corrections, a key difference to conventional Pauli codes. We construct and benchmark a just-in-time (JIT) matching decoder to reliably decide these corrections. Under a phenomenological error model with equally likely physical and measurement errors, we find a high threshold of ≈2.5 %\approx 2.5\,\%≈2.5%, close to the ≈2.9 %\approx 2.9\,\%≈2.9% of a decoder with access to the full syndrome history. We also perform a finite-size scaling analysis to estimate how the logical error rate scales below threshold and verify an exponential suppression in both physical error rate and in the system size. A second global decoding step for ZZZ errors is required and the non-Clifford gates in the circuit reduce the threshold from ≈2.9 %\approx 2.9\,\%≈2.9% to ≈1.8 %\approx 1.8\,\%≈1.8% with a naive decoder. We show how ZZZ decoding can be improved using knowledge of the XXX corrections, pushing the threshold to ≈2.2 %\approx 2.2\,\%≈2.2%. Our results suggest non-Clifford logic in 2D codes could perform comparably to 2D quantum memory. Our formalism for efficient benchmarking and decoding directly generalizes to a broader family of CSS codes whose XXX stabilizers are twisted by diagonal Clifford operators, and spacetime versions thereof, defined by CSS-like circuits enriched by CCZCCZCCZ, CSCSCS, and TTT gates.