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

INTRINSIC TOPOLOGICAL ERROR CORRECTION

Michael I Aksman

Published Jun 4, 2026• 0 citations
Publisher

Abstract

Recent breakthroughs in neutral-atom quantum computing (e.g., arXiv:2606.04079v1 andrelated works, 2026) have achieved repeated fault-tolerant quantum error correction using ToricCode architectures. These systems rely on active mid-circuit measurement, classical syndromedecoding, and continuous atom reloading from an external reservoir to maintain logical qubitsover many cycles, demonstrating sub-threshold behavior where logical error rates decrease withincreasing code distance.We present a detailed, rigorous comparison demonstrating that the DSM-861 hydrodynamicvacuum implements a vastly superior intrinsic, passive, autonomous topological surface code.While artificial systems demand continuous external intervention, the DSM-861 manifold—atriangular 3-torus lattice with N = 861 nodes anchored by the Heegner discriminantD = −163—provides self-stabilizing error correction through deterministic enstrophy collapse,vorton reconnection, and continuous dissipation into a built-in 1.618 eV acoustic reservoiron a 2.56 fs cycle. We compare lattice geometry, encoding, syndrome detection, correctionmechanisms, stabilizer reservoirs, fault-tolerant thresholds, scalability, and energetic efficiency,showing that Nature has engineered the ultimate fault-tolerant topological quantum computerat the foundation of spacetime. Furthermore, we examine recent derivations of divergentphoton truncation (Rukan et al., 2026) to demonstrate how the lattice provides a naturalphysical regularizer against localized optical shear.

DOI
10.5281/zenodo.20542403

Related papers

Quantum error correction with the toric code

Atom Computing, Collaborators

Quantum computing platforms based on arrays of tweezer-confined neutral atoms have recently emerged as a competitive modality thanks to a direct path toward high qubit count, rapidly advancing operation fidelities, and their ability to execute circuits with arbitrary qubit connectivity. These features will enable the use of efficient error correction schemes with high encoding-rates, time-efficient decoding, and resource-efficient architectures based on transversal gates. With these goals in mind, recent state of the art neutral atom demonstrations focus on the transition from the use of physical qubits to error-corrected logical qubits, but to date there has been no demonstration of repeated error correction scalable to arbitrary depth. Here, we demonstrate many cycles of syndrome extraction in a toric quantum error correcting code, using mid-circuit measurement and replacement of lost qubits, including reloading of a qubit reservoir for indefinite coherent operation. We characterize the logical error rate after up to 90 cycles, showing that logical information can be preserved through multiple rounds of qubit reloading. Comparing two distances of the code up to 8 rounds of syndrome extraction shows a lower absolute logical error rate for the larger distance code.

quant-pharXiv:2606.04079•Jun 3, 2026•0 citations

Quantum error correction with the toric code

Matthew A. Norcia, David Aasen, Stephen Armstrong +97 more

Abstract Quantum computing platforms based on arrays of tweezer-confined neutral atoms have recently emerged as a competitive modality thanks to a direct path toward high qubit count, rapidly ad- vancing operation fidelities, and their ability to execute circuits with arbitrary qubit connectivity. These features will enable the use of efficient error correction schemes with high encoding-rates, time-efficient decoding, and resource-efficient architectures based on transversal gates. With these goals in mind, recent state of the art neutral atom demonstrations focus on the transition from the use of physical qubits to error-corrected logical qubits, but to date there has been no demonstra- tion of repeated error correction scalable to arbitrary depth. Here, we demonstrate many cycles of syndrome extraction in a toric quantum error correcting code, using mid-circuit measurement and replacement of lost qubits, including reloading of a qubit reservoir for indefinite coherent operation. We characterize the logical error rate after up to 90 cycles, showing that logical information can be preserved through multiple rounds of qubit reloading. Comparing two distances of the code up to 8 rounds of syndrome extraction shows a lower absolute logical error rate for the larger distance code.

•Jun 15, 2026•0 citations

ERROR CORRECTION ACROSS SCALES Topological Error Suppression in Quantum Memories, Biological Genomes, and KAN-DAM Quantum Computation

Michael I Aksman

The DSM-861 error-correction mechanism—defined as the instantaneous orthogonal projection Π861 onto the Heegner-rigid 861-node vorton lattice—is systematically applied and mathematically resolved across three disparate physical domains. (I) Quantum Memories: We unify the DSM-861 projection-enforced admissibility with the 2026 3D sheaf-code passive quantum memory (Balasubramanian et al., arXiv:2605.10943) and the classic 4D loop toric code (Dennis et al., 2002), demonstrating how arithmetic rigidity completely bypasses active decoder overhead to achieve hardware-level zero-drift. (II) Biological Error Catastrophe: We resolve the Meyer-Axe paradox of protein folding by quantifying the Spectral Admissibility Criterion (SAC). We establish the exact thermodynamic threshold linking admissibility gaps to folding free energy, formulate the topological restoration force, and derive the biological longevity limit as a deterministic consequence of KolmogorovArnold-Moser (KAM) stability breakdown. (III) KAN-DAM Quantum Computation: We prove the computational universality of the KAN-DAM framework, encoding states nonlocally across all 861 modes. We demonstrate that the system avoids the exponential scaling of volume-law entanglement by utilizing the Π861 projection as a continuous physical disentangler, bounding classical simulation complexity strictly to polynomial time O(N2log(1/)). This unified paradigm requires no external error-correcting codes, replacingprobabilistic syndrome measurements with deterministic geometric necessity.

•Jun 20, 2026•0 citations

Provably Efficient Self-Calibrating Quantum Fault Tolerance

Weiyuan Gong, Hong-Ye Hu

Quantum error correction protects logical information only when every physical operation remains below the fault-tolerance threshold, a condition that must be maintained continuously rather than only at the initial calibration. In practice, however, analog control parameters inevitably drift because of environmental fluctuations. As future fault-tolerant quantum computations are expected to run for days or even months, interrupting computation for repeated recalibration becomes fundamentally impractical. A promising alternative is to integrate calibration directly into computation by repurposing syndrome measurements as a calibration signal (Sivak et al, Nature 2026), but whether such self-calibration can be achieved with provable efficiency remains an open question. Here we establish a theoretical framework for such self-calibrating quantum fault tolerance. We prove that, for a broad class of control-induced errors, the detection rate defines a locally strongly convex surrogate objective for analog calibration with high probability. This geometric property enables a simple and efficient online optimization algorithm using only syndrome measurements collected during normal error correction. We prove convergence to an $\varepsilon$ detection rate within $O(1/\varepsilon^2)$ epochs for time-independent drifts and also establish guarantees for time-dependent drifts. We further show that the convergence rate is independent of the code distance for quantum low-density parity-check (LDPC) codes. Pulse-level simulations of neutral-atom arrays and large-scale circuit-level Clifford simulations confirm these theoretical predictions. Our results establish self-calibrating fault tolerance as a provably efficient paradigm in which the same syndrome measurements simultaneously protect logical information and stabilize the underlying hardware.

quant-pharXiv:2608.05686•Aug 7, 2026•0 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 30, 2025•3 citations

Measurement-Free Toric-Code Memory in Array Globally Controlled Rydberg Array

Han Wang, Yusheng Zhao, Xiuhao Deng +1 more

The central prerequisite of any fault-tolerant quantum architecture is a quantum memory: a block of encoded physical qubits whose logical state is actively preserved against noise across many rounds of error correction. In neutral-atom Rydberg arrays, realizing such a memory is obstructed not by the entangling gates themselves, which are already fast and high-fidelity, but by the auxiliary operations that a conventional error-correction cycle requires: mid-circuit fluorescence measurement, inter-zone atom transport, and locally focused single-qubit addressing. Each of these introduces latency, atom loss, or optical crosstalk that exceeds the cost of the underlying gates by orders of magnitude. These costs accumulate cycle after cycle, progressively degrading the very logical information the code is meant to protect. Here we propose a protocol that stabilizes a toric-code quantum memory without moving, measuring or local addressing atoms. The key is to use a three-species Rydberg atom array for the complete stabilizer cycle, including syndrome extraction, coherent correction, and ancilla reset, under global, species-selective laser pulses. Numerical simulation of a $4 \times 4$ rotated toric code shows a longer qubit lifetime when the physical error rate is below a pseudo-threshold $p^\star \approx 0.034$. The scheme offers a concrete, hardware-efficient route to topological quantum memory in neutral-atom platforms.

quant-pharXiv:2606.12030•Jun 11, 2026•0 citations
Recent breakthroughs in neutral-atom quantum computing (e.g., arXiv:2606.04079v1 andrelated works, 2026) have achieved repeated fault-tolerant quantum error correction using ToricCode architectures. These systems rely on active mid-circuit measurement, classical syndromedecoding, and continuous atom reloading from an external reservoir to maintain logical qubitsover many cycles, demonstrating sub-threshold behavior where logical error rates decrease withincreasing code distance.We present a detailed, rigorous comparison demonstrating that the DSM-861 hydrodynamicvacuum implements a vastly superior intrinsic, passive, autonomous topological surface code.While artificial systems demand continuous external intervention, the DSM-861 manifold—atriangular 3-torus lattice with N = 861 nodes anchored by the Heegner discriminantD = −163—provides self-stabilizing error correction through deterministic enstrophy collapse,vorton reconnection, and continuous dissipation into a built-in 1.618 eV acoustic reservoiron a 2.56 fs cycle. We compare lattice geometry, encoding, syndrome detection, correctionmechanisms, stabilizer reservoirs, fault-tolerant thresholds, scalability, and energetic efficiency,showing that Nature has engineered the ultimate fault-tolerant topological quantum computerat the foundation of spacetime. Furthermore, we examine recent derivations of divergentphoton truncation (Rukan et al., 2026) to demonstrate how the lattice provides a naturalphysical regularizer against localized optical shear.
Quantum computing platforms based on arrays of tweezer-confined neutral atoms have recently emerged as a competitive modality thanks to a direct path toward high qubit count, rapidly advancing operation fidelities, and their ability to execute circuits with arbitrary qubit connectivity. These features will enable the use of efficient error correction schemes with high encoding-rates, time-efficient decoding, and resource-efficient architectures based on transversal gates. With these goals in mind, recent state of the art neutral atom demonstrations focus on the transition from the use of physical qubits to error-corrected logical qubits, but to date there has been no demonstration of repeated error correction scalable to arbitrary depth. Here, we demonstrate many cycles of syndrome extraction in a toric quantum error correcting code, using mid-circuit measurement and replacement of lost qubits, including reloading of a qubit reservoir for indefinite coherent operation. We characterize the logical error rate after up to 90 cycles, showing that logical information can be preserved through multiple rounds of qubit reloading. Comparing two distances of the code up to 8 rounds of syndrome extraction shows a lower absolute logical error rate for the larger distance code.
Abstract Quantum computing platforms based on arrays of tweezer-confined neutral atoms have recently emerged as a competitive modality thanks to a direct path toward high qubit count, rapidly ad- vancing operation fidelities, and their ability to execute circuits with arbitrary qubit connectivity. These features will enable the use of efficient error correction schemes with high encoding-rates, time-efficient decoding, and resource-efficient architectures based on transversal gates. With these goals in mind, recent state of the art neutral atom demonstrations focus on the transition from the use of physical qubits to error-corrected logical qubits, but to date there has been no demonstra- tion of repeated error correction scalable to arbitrary depth. Here, we demonstrate many cycles of syndrome extraction in a toric quantum error correcting code, using mid-circuit measurement and replacement of lost qubits, including reloading of a qubit reservoir for indefinite coherent operation. We characterize the logical error rate after up to 90 cycles, showing that logical information can be preserved through multiple rounds of qubit reloading. Comparing two distances of the code up to 8 rounds of syndrome extraction shows a lower absolute logical error rate for the larger distance code.
The DSM-861 error-correction mechanism—defined as the instantaneous orthogonal projection Π861 onto the Heegner-rigid 861-node vorton lattice—is systematically applied and mathematically resolved across three disparate physical domains. (I) Quantum Memories: We unify the DSM-861 projection-enforced admissibility with the 2026 3D sheaf-code passive quantum memory (Balasubramanian et al., arXiv:2605.10943) and the classic 4D loop toric code (Dennis et al., 2002), demonstrating how arithmetic rigidity completely bypasses active decoder overhead to achieve hardware-level zero-drift. (II) Biological Error Catastrophe: We resolve the Meyer-Axe paradox of protein folding by quantifying the Spectral Admissibility Criterion (SAC). We establish the exact thermodynamic threshold linking admissibility gaps to folding free energy, formulate the topological restoration force, and derive the biological longevity limit as a deterministic consequence of KolmogorovArnold-Moser (KAM) stability breakdown. (III) KAN-DAM Quantum Computation: We prove the computational universality of the KAN-DAM framework, encoding states nonlocally across all 861 modes. We demonstrate that the system avoids the exponential scaling of volume-law entanglement by utilizing the Π861 projection as a continuous physical disentangler, bounding classical simulation complexity strictly to polynomial time O(N2log(1/)). This unified paradigm requires no external error-correcting codes, replacingprobabilistic syndrome measurements with deterministic geometric necessity.
Quantum error correction protects logical information only when every physical operation remains below the fault-tolerance threshold, a condition that must be maintained continuously rather than only at the initial calibration. In practice, however, analog control parameters inevitably drift because of environmental fluctuations. As future fault-tolerant quantum computations are expected to run for days or even months, interrupting computation for repeated recalibration becomes fundamentally impractical. A promising alternative is to integrate calibration directly into computation by repurposing syndrome measurements as a calibration signal (Sivak et al, Nature 2026), but whether such self-calibration can be achieved with provable efficiency remains an open question. Here we establish a theoretical framework for such self-calibrating quantum fault tolerance. We prove that, for a broad class of control-induced errors, the detection rate defines a locally strongly convex surrogate objective for analog calibration with high probability. This geometric property enables a simple and efficient online optimization algorithm using only syndrome measurements collected during normal error correction. We prove convergence to an ε\varepsilonε detection rate within O(1/ε2)O(1/\varepsilon^2)O(1/ε2) epochs for time-independent drifts and also establish guarantees for time-dependent drifts. We further show that the convergence rate is independent of the code distance for quantum low-density parity-check (LDPC) codes. Pulse-level simulations of neutral-atom arrays and large-scale circuit-level Clifford simulations confirm these theoretical predictions. Our results establish self-calibrating fault tolerance as a provably efficient paradigm in which the same syndrome measurements simultaneously protect logical information and stabilize the underlying hardware.
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 central prerequisite of any fault-tolerant quantum architecture is a quantum memory: a block of encoded physical qubits whose logical state is actively preserved against noise across many rounds of error correction. In neutral-atom Rydberg arrays, realizing such a memory is obstructed not by the entangling gates themselves, which are already fast and high-fidelity, but by the auxiliary operations that a conventional error-correction cycle requires: mid-circuit fluorescence measurement, inter-zone atom transport, and locally focused single-qubit addressing. Each of these introduces latency, atom loss, or optical crosstalk that exceeds the cost of the underlying gates by orders of magnitude. These costs accumulate cycle after cycle, progressively degrading the very logical information the code is meant to protect. Here we propose a protocol that stabilizes a toric-code quantum memory without moving, measuring or local addressing atoms. The key is to use a three-species Rydberg atom array for the complete stabilizer cycle, including syndrome extraction, coherent correction, and ancilla reset, under global, species-selective laser pulses. Numerical simulation of a 4×44 \times 44×4 rotated toric code shows a longer qubit lifetime when the physical error rate is below a pseudo-threshold p⋆≈0.034p^\star \approx 0.034p⋆≈0.034. The scheme offers a concrete, hardware-efficient route to topological quantum memory in neutral-atom platforms.