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

Logical and Process Thresholds for Long-Lifetime Quantum Computation via Surface-Code Quantum Error Correction

Santos C. Borom

Published Dec 12, 2025• 0 citations
Publisher

Abstract

Surface--code threshold theorems traditionally assume an abstract local noise model, typically an i.i.d.\ or weakly correlated Pauli channel on a flat hardware lattice, and establish exponential suppression of logical error below a critical physical error rate~\cite{dennis2002topological,aharonov2008fault,aliferis2006quantum,fowler2012surface,terhal2015quantum}. In this setting the surface code functions primarily as a quantum memory architecture, with fault--tolerant computation obtained by supplementing the code with transversal gates and magic--state distillation under the same phenomenological noise assumptions~\cite{nielsen2010quantum,watrous2018theory}. Such analyses, however, do not natively accommodate curved or slowly drifting chronogeometries, structured vacuum or spectral noise, or process--level equivalence between distinct QEC schedules. This work develops a triadic--Fourfold fault--tolerance framework for surface--code quantum computation in the IQR/PQS setting of~\cite{Borom:2025chrono}. The starting point is a full fourfold inter--modal correlator $\hat G_\Lambda$ and its ideal counterpart $\hat G^0_\Lambda$, defined on a QEC diagnostic realized reference configuration and a QEC--realized weave equipped with a Good--clock $C=(\hat T,U_t)$. The associated noise kernel $\Delta\hat G$ is required to lie in a Triadic--Fourfold Noise Class $\mathcal N_{\mathrm{tri\text{-}4F}}$ with correlational, vacuum, and spectral sectors satisfying suitable clustering and time--scale separation conditions~\cite{breuer2002theory,riera2012thermal}. From this data the analysis extracts triad--split local error rates $(p_{\mathrm{corr}},p_{\mathrm{vac}},p_{\mathrm{spec}})$, triad--resolved leakage parameters $\varepsilon_{\mathrm{ps}}^{(a)}$, and process differentials $\delta_a$ as explicit functionals of $\Delta\hat G$. The main Triadic--Fourfold Threshold Theorem shows that the \emph{standard} surface--code family on the emergent Twofold register still exhibits an exponential logical threshold controlled by the correlational error rate $p_{\mathrm{corr}}$, while vacuum and spectral contributions appear only through small, explicitly quantified correction terms $f_{\mathrm{vac}},f_{\mathrm{spec}}$. At the same time, a triadic process threshold bound ensures that, provided the global process differential $\delta_{\mathrm{tot}}$ is sufficiently small, all QEC schedules implementing a given logical circuit are holosymmetrically equivalent in the dual--history sense up to a prescribed accuracy. In particular, the noise may arise from a non--Markovian environment, understood here as an environment whose full dynamics is not memoryless or semigroup--like, but whose fast component can still be isolated and treated in a Markovian way for threshold purposes, with the slow, history--carrying components systematically accounted for by the triadic decomposition rather than being ignored. The result is therefore not a new code, but a strictly more general and physically faithful threshold theorem for the usual surface--code architecture: it remains valid in curved, slowly drifting, non--Markovian environments, is formulated directly in terms of field--theoretic correlators, and simultaneously controls both logical correctness and process--level robustness of the computation.

DOI
10.5281/zenodo.17905905

Related papers

Detrimental non-Markovian errors for surface code memory

John F Kam, Spiro Gicev, Kavan Kishore Modi +2 more

Abstract The realization of fault-tolerant quantum computers hinges on effective quantum error correction (QEC) protocols, whose performance significantly relies on the nature of the underlying noise. In this work, we directly study the structure of non-Markovian correlated errors and their impact on surface code memory performance. Specifically, we compare surface code performance under non-Markovian noise and independent circuit-level noise, while keeping marginal error rates constant. Our analysis shows that while not all temporally correlated structures are detrimental, certain structures, particularly multi-time ‘streaky’ correlations affecting syndrome qubits and two-qubit gates, can severely degrade logical error rate scaling. Furthermore, we discuss our results in the context of recent QEC experiments on physical devices. These findings underscore the importance of understanding and mitigating non-Markovian noise toward achieving practical, fault-tolerant quantum computing.

arXiv:2410.23779•Quantum Science and Technology•Jul 3, 2025•8 citations

Spatiotemporal Pauli processes: Quantum combs for modeling correlated noise in quantum error correction

John F Kam, Angus Southwell, Spiro Gicev +2 more

Correlated noise is a critical failure mode in quantum error correction (QEC), yet a gap remains between the stochastic Pauli models used for scalable QEC analyses and the microscopic, non-Markovian descriptions of noise in physical devices. We bridge this gap by introducing Spatiotemporal Pauli Processes (SPPs): the natural multi-time generalization of Pauli channels, joint probability distributions over Pauli faults across space and time, obtained exactly from any noise process, however non-Markovian, under standard Pauli-frame randomization. SPPs thereby provide a single language in which correlated noise can be recast, compared, and extended, compatible with both microscopic open systems modeling and the stabilizer workflow of QEC design and analysis. Our central result is constructive: the multi-time Pauli twirl acts by local contractions on a process tensor network, yielding an explicit classical tensor network whose virtual bonds encode memory, bounded by the environment's Liouville-space dimension. Transfer operator diagnostics link memory spectra to correlation decay, and hidden Markov representations enable efficient sampling of correlated Pauli fault trajectories, mapping microscopically derived noise directly into circuit-level QEC simulation. We demonstrate this with surface code memory and stability benchmarks up to distance $19$. A temporal "storm" model with tunable correlation time shows that memory alone, at strictly fixed marginal error rates, systematically erodes the exponential error suppression expected from code distance. A genuinely spatiotemporal quantum cellular automaton bath maps exactly, under system twirling, to a nonlinear probabilistic cellular automaton; tuning its coherent interactions drives the noise into a pseudo-critical regime with critical slowing down and macroscopic error avalanches that reverse surface code distance scaling.

quant-pharXiv:2603.05474•Mar 6, 2026•0 citations

Experimental Quantum Error Correction below the Surface Code Threshold via All-Microwave Leakage Suppression

Tan He, W. W. Lin, Rui Wang +97 more

Quantum error correction (QEC) enables practical quantum computing by encoding logical qubits in many physical qubits, which can exponentially suppress the logical error rate with increasing code size provided that the physical error rate is below a critical threshold. However, the leakage of quantum information from the computational subspace presents a critical challenge to the development of scalable QEC, which creates long-lived, correlated errors that spread across space and time. Here, we demonstrate a quantum memory operating below the threshold by implementing an all-microwave leakage suppression architecture on a distance-7 surface code. We achieve a logical error suppression factor of Λ=1.40(6), definitively reversing the above-threshold scaling (Λ<1) caused by unmitigated leakage. This scheme integrates a hardware-efficient leakage reduction unit for data qubits with a fast, unconditional reset for ancilla qubits, suppressing the average leakage population after 40 cycles by a factor of 72 to 6.4(5)×10^{-4}. Our results demonstrate the viability of all-microwave control architectures for suppressing critical errors at scale, paving the way for more advanced quantum error correction implementations.

Physical Review Letters•Dec 22, 2025•14 citations

Quantum Decoherence of the Surface Code: A Generalized Caldeira-Leggett Approach

E. Novais, A. H. Castro-Neto

Abstract Standard quantum error correction (QEC) models typically assume discrete, Markovian noise. This assumption obscures the continuous quantum nature of physical environments. We investigate the fundamental limits of an actively corrected surface code coupled to a continuous, un-reset quantum environment at zero and finite temperature. Using the generalized Caldeira-Leggett framework, we map the long-time evolution of the logical qubit to a boundary conformal field theory, establishing an exact equivalence to the anisotropic Kondo model. We evaluate computational times for a finite code distance L for all spatial and temporal correlations. Our analysis reveals that a true thermodynamic threshold exists strictly for short-range environments ( $$z>1/(s+1)$$ ), where z is the dynamical exponent of the environment and s is the exponent of the spectral density. In critical or long-range regimes, the macroscopic footprint of the code amplifies the continuous bath, hindering the topological protection.

Brazilian Journal of Physics•Jun 27, 2026•0 citations

Local Quantum Fault Tolerance Without Expansion

David Ponarovsky

We study fault-tolerant quantum computation using a fixed, local error-correction rule and a geometrically simple code: the cubical $(d,d')$-Toric code with $d',d-d'\geq 2$, including the 4D Toric code. Under sufficiently weak local-stochastic Pauli noise, our construction uses noiseless, bounded-depth classical processing per physical time step. Its correction cycle acts only on the current syndrome, has constant depth, and is repeated unchanged during idle logical computation; it requires neither multiscale decoder states nor scale-dependent communication delays. Our proof treats errors and syndromes as chains in a cubical complex, combining geometric shrinking under the sweep rule with a space--time explanation-tree argument inspired by Toom's theorem. It does not rely on expansion. We establish three results: 1.Explicit higher-dimensional sweep rule. We give a local algorithm for choosing sweep corrections on cubical $(d,d')$-Toric complexes, resolving the local-existence question of Kubica and Preskill. 2. Fault-tolerant computation. We prove a circuit-level threshold theorem for noisy sweep cycles interleaved with logical gates. In particular, the 4D Toric code admits a fixed, constant-depth syndrome-based correction cycle without a multiscale decoder or expansion-based encoding. We do not claim constant total-depth overhead. 3. Ideal decoding under local-stochastic noise. For an initial local-stochastic Pauli error of rate $p$ below threshold, $n^{d+1}$ noiseless sweep cycles recover the encoded state on a side-length-$n$ $(d,d')$-Toric code with probability at least $1-O(\operatorname{poly}(n))p^{Ω(n)}$, extending earlier guarantees for independent errors.

quant-pharXiv:2610.38847•Oct 30, 2026•0 citations

Simulating Quantum Error Correction beyond Pauli Stochastic Errors

Jordan Hines, Corey Ostrove, Kenneth Rudinger +4 more

Quantum error correction (QEC), the lynchpin of fault-tolerant quantum computing (FTQC), is designed and validated against well-behaved Pauli stochastic error models. But in real-world deployment, QEC protocols encounter a vast array of other errors -- coherent and non-Pauli errors -- whose impacts on quantum circuits are vastly different than those of stochastic Pauli errors. The impacts of these errors on QEC and FTQC protocols have been largely unpredictable to date due to exponential classical simulation cost. Here, we show how to accurately and efficiently model the effects of coherent and non-Pauli errors on FTQC, and we study the effects of such errors on syndrome extraction for surface and bivariate bicycle codes, and on magic state cultivation. Our analysis suggests that coherent error can shift fault-tolerance thresholds, increase the space-time cost of magic state cultivation, and can increase logical error rates by an order of magnitude compared to equivalent stochastic errors. These analyses are enabled by a new technique for mapping any Markovian circuit-level error model with sufficiently small error rates onto a detector error model (DEM) for an FTQC circuit. The resulting DEM enables Monte Carlo estimation of logical error rates and noise-adapted decoding, and its parameters can be analytically related to the underlying physical noise parameters to enable approximate strong simulation.

quant-pharXiv:2603.18457•Mar 20, 2026•0 citations
Surface--code threshold theorems traditionally assume an abstract local noise model, typically an i.i.d.\ or weakly correlated Pauli channel on a flat hardware lattice, and establish exponential suppression of logical error below a critical physical error rate~\cite{dennis2002topological,aharonov2008fault,aliferis2006quantum,fowler2012surface,terhal2015quantum}. In this setting the surface code functions primarily as a quantum memory architecture, with fault--tolerant computation obtained by supplementing the code with transversal gates and magic--state distillation under the same phenomenological noise assumptions~\cite{nielsen2010quantum,watrous2018theory}. Such analyses, however, do not natively accommodate curved or slowly drifting chronogeometries, structured vacuum or spectral noise, or process--level equivalence between distinct QEC schedules. This work develops a triadic--Fourfold fault--tolerance framework for surface--code quantum computation in the IQR/PQS setting of~\cite{Borom:2025chrono}. The starting point is a full fourfold inter--modal correlator G^Λ\hat G_\LambdaG^Λ​ and its ideal counterpart G^Λ0\hat G^0_\LambdaG^Λ0​, defined on a QEC diagnostic realized reference configuration and a QEC--realized weave equipped with a Good--clock C=(T^,Ut)C=(\hat T,U_t)C=(T^,Ut​). The associated noise kernel ΔG^\Delta\hat GΔG^ is required to lie in a Triadic--Fourfold Noise Class Ntri-4F\mathcal N_{\mathrm{tri\text{-}4F}}Ntri-4F​ with correlational, vacuum, and spectral sectors satisfying suitable clustering and time--scale separation conditions~\cite{breuer2002theory,riera2012thermal}. From this data the analysis extracts triad--split local error rates (pcorr,pvac,pspec)(p_{\mathrm{corr}},p_{\mathrm{vac}},p_{\mathrm{spec}})(pcorr​,pvac​,pspec​), triad--resolved leakage parameters εps(a)\varepsilon_{\mathrm{ps}}^{(a)}εps(a)​, and process differentials δa\delta_aδa​ as explicit functionals of ΔG^\Delta\hat GΔG^. The main Triadic--Fourfold Threshold Theorem shows that the \emph{standard} surface--code family on the emergent Twofold register still exhibits an exponential logical threshold controlled by the correlational error rate pcorrp_{\mathrm{corr}}pcorr​, while vacuum and spectral contributions appear only through small, explicitly quantified correction terms fvac,fspecf_{\mathrm{vac}},f_{\mathrm{spec}}fvac​,fspec​. At the same time, a triadic process threshold bound ensures that, provided the global process differential δtot\delta_{\mathrm{tot}}δtot​ is sufficiently small, all QEC schedules implementing a given logical circuit are holosymmetrically equivalent in the dual--history sense up to a prescribed accuracy. In particular, the noise may arise from a non--Markovian environment, understood here as an environment whose full dynamics is not memoryless or semigroup--like, but whose fast component can still be isolated and treated in a Markovian way for threshold purposes, with the slow, history--carrying components systematically accounted for by the triadic decomposition rather than being ignored. The result is therefore not a new code, but a strictly more general and physically faithful threshold theorem for the usual surface--code architecture: it remains valid in curved, slowly drifting, non--Markovian environments, is formulated directly in terms of field--theoretic correlators, and simultaneously controls both logical correctness and process--level robustness of the computation.
Abstract The realization of fault-tolerant quantum computers hinges on effective quantum error correction (QEC) protocols, whose performance significantly relies on the nature of the underlying noise. In this work, we directly study the structure of non-Markovian correlated errors and their impact on surface code memory performance. Specifically, we compare surface code performance under non-Markovian noise and independent circuit-level noise, while keeping marginal error rates constant. Our analysis shows that while not all temporally correlated structures are detrimental, certain structures, particularly multi-time ‘streaky’ correlations affecting syndrome qubits and two-qubit gates, can severely degrade logical error rate scaling. Furthermore, we discuss our results in the context of recent QEC experiments on physical devices. These findings underscore the importance of understanding and mitigating non-Markovian noise toward achieving practical, fault-tolerant quantum computing.
Correlated noise is a critical failure mode in quantum error correction (QEC), yet a gap remains between the stochastic Pauli models used for scalable QEC analyses and the microscopic, non-Markovian descriptions of noise in physical devices. We bridge this gap by introducing Spatiotemporal Pauli Processes (SPPs): the natural multi-time generalization of Pauli channels, joint probability distributions over Pauli faults across space and time, obtained exactly from any noise process, however non-Markovian, under standard Pauli-frame randomization. SPPs thereby provide a single language in which correlated noise can be recast, compared, and extended, compatible with both microscopic open systems modeling and the stabilizer workflow of QEC design and analysis. Our central result is constructive: the multi-time Pauli twirl acts by local contractions on a process tensor network, yielding an explicit classical tensor network whose virtual bonds encode memory, bounded by the environment's Liouville-space dimension. Transfer operator diagnostics link memory spectra to correlation decay, and hidden Markov representations enable efficient sampling of correlated Pauli fault trajectories, mapping microscopically derived noise directly into circuit-level QEC simulation. We demonstrate this with surface code memory and stability benchmarks up to distance 191919. A temporal "storm" model with tunable correlation time shows that memory alone, at strictly fixed marginal error rates, systematically erodes the exponential error suppression expected from code distance. A genuinely spatiotemporal quantum cellular automaton bath maps exactly, under system twirling, to a nonlinear probabilistic cellular automaton; tuning its coherent interactions drives the noise into a pseudo-critical regime with critical slowing down and macroscopic error avalanches that reverse surface code distance scaling.
Quantum error correction (QEC) enables practical quantum computing by encoding logical qubits in many physical qubits, which can exponentially suppress the logical error rate with increasing code size provided that the physical error rate is below a critical threshold. However, the leakage of quantum information from the computational subspace presents a critical challenge to the development of scalable QEC, which creates long-lived, correlated errors that spread across space and time. Here, we demonstrate a quantum memory operating below the threshold by implementing an all-microwave leakage suppression architecture on a distance-7 surface code. We achieve a logical error suppression factor of Λ=1.40(6), definitively reversing the above-threshold scaling (Λ<1) caused by unmitigated leakage. This scheme integrates a hardware-efficient leakage reduction unit for data qubits with a fast, unconditional reset for ancilla qubits, suppressing the average leakage population after 40 cycles by a factor of 72 to 6.4(5)×10^{-4}. Our results demonstrate the viability of all-microwave control architectures for suppressing critical errors at scale, paving the way for more advanced quantum error correction implementations.
Abstract Standard quantum error correction (QEC) models typically assume discrete, Markovian noise. This assumption obscures the continuous quantum nature of physical environments. We investigate the fundamental limits of an actively corrected surface code coupled to a continuous, un-reset quantum environment at zero and finite temperature. Using the generalized Caldeira-Leggett framework, we map the long-time evolution of the logical qubit to a boundary conformal field theory, establishing an exact equivalence to the anisotropic Kondo model. We evaluate computational times for a finite code distance L for all spatial and temporal correlations. Our analysis reveals that a true thermodynamic threshold exists strictly for short-range environments ( z>1/(s+1)z>1/(s+1)z>1/(s+1) ), where z is the dynamical exponent of the environment and s is the exponent of the spectral density. In critical or long-range regimes, the macroscopic footprint of the code amplifies the continuous bath, hindering the topological protection.
We study fault-tolerant quantum computation using a fixed, local error-correction rule and a geometrically simple code: the cubical (d,d′)(d,d')(d,d′)-Toric code with d′,d−d′≥2d',d-d'\geq 2d′,d−d′≥2, including the 4D Toric code. Under sufficiently weak local-stochastic Pauli noise, our construction uses noiseless, bounded-depth classical processing per physical time step. Its correction cycle acts only on the current syndrome, has constant depth, and is repeated unchanged during idle logical computation; it requires neither multiscale decoder states nor scale-dependent communication delays. Our proof treats errors and syndromes as chains in a cubical complex, combining geometric shrinking under the sweep rule with a space--time explanation-tree argument inspired by Toom's theorem. It does not rely on expansion. We establish three results: 1.Explicit higher-dimensional sweep rule. We give a local algorithm for choosing sweep corrections on cubical (d,d′)(d,d')(d,d′)-Toric complexes, resolving the local-existence question of Kubica and Preskill. 2. Fault-tolerant computation. We prove a circuit-level threshold theorem for noisy sweep cycles interleaved with logical gates. In particular, the 4D Toric code admits a fixed, constant-depth syndrome-based correction cycle without a multiscale decoder or expansion-based encoding. We do not claim constant total-depth overhead. 3. Ideal decoding under local-stochastic noise. For an initial local-stochastic Pauli error of rate ppp below threshold, nd+1n^{d+1}nd+1 noiseless sweep cycles recover the encoded state on a side-length-nnn (d,d′)(d,d')(d,d′)-Toric code with probability at least 1−O(poly⁡(n))pΩ(n)1-O(\operatorname{poly}(n))p^{Ω(n)}1−O(poly(n))pΩ(n), extending earlier guarantees for independent errors.
Quantum error correction (QEC), the lynchpin of fault-tolerant quantum computing (FTQC), is designed and validated against well-behaved Pauli stochastic error models. But in real-world deployment, QEC protocols encounter a vast array of other errors -- coherent and non-Pauli errors -- whose impacts on quantum circuits are vastly different than those of stochastic Pauli errors. The impacts of these errors on QEC and FTQC protocols have been largely unpredictable to date due to exponential classical simulation cost. Here, we show how to accurately and efficiently model the effects of coherent and non-Pauli errors on FTQC, and we study the effects of such errors on syndrome extraction for surface and bivariate bicycle codes, and on magic state cultivation. Our analysis suggests that coherent error can shift fault-tolerance thresholds, increase the space-time cost of magic state cultivation, and can increase logical error rates by an order of magnitude compared to equivalent stochastic errors. These analyses are enabled by a new technique for mapping any Markovian circuit-level error model with sufficiently small error rates onto a detector error model (DEM) for an FTQC circuit. The resulting DEM enables Monte Carlo estimation of logical error rates and noise-adapted decoding, and its parameters can be analytically related to the underlying physical noise parameters to enable approximate strong simulation.