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

Fault tolerant dynamical decoders for topological quantum memories

Michael Herold, Michael J. Kastoryano, Earl T. Campbell, Jens Eisert

Published Nov 17, 2015• 6 citations
OpenAlex

Abstract

Active error correction of topological quantum codes - in particular the toric code - remains one of the most viable routes to large scale quantum information processing. In this work, we introduce the concept of a dynamical decoder as a promising route for achieving fault-tolerant quantum memories. We analyze a specific dynamical decoder based on a discrete time cellular automaton decoder and provide evidence of a threshold above 0.05% with measurement errors. Without measurement errors, the threshold increases by a factor of roughly 1.5. We stress that (asynchronous) dynamical decoding gives rise to a Markovian dissipative process, hence equating cellular automaton decoding to a fully dissipative topological quantum memory, which removes errors continuously. Finally, we analyze the required resources, and speculate about an ideal constant resource dynamical decoder.

Related papers

Cellular automaton decoders of topological quantum memories in the fault tolerant setting

Michael Herold, Michael J. Kastoryano, Earl T. Campbell +1 more

Active error decoding and correction of topological quantum codes—in particular the toric code—remains one of the most viable routes to large scale quantum information processing. In contrast, passive error correction relies on the natural physical dynamics of a system to protect encoded quantum information. However, the search is ongoing for a completely satisfactory passive scheme applicable to locally interacting two-dimensional systems. Here, we investigate dynamical decoders that provide passive error correction by embedding the decoding process into local dynamics. We propose a specific discrete time cellular-automaton decoder in the fault tolerant setting and provide numerical evidence showing that the logical qubit has a survival time extended by several orders of magnitude over that of a bare unencoded qubit. We stress that (asynchronous) dynamical decoding gives rise to a Markovian dissipative process. We hence equate cellular-automaton decoding to a fully dissipative topological quantum memory, which removes errors continuously. In this sense, uncontrolled and unwanted local noise can be corrected for by a controlled local dissipative process. We analyze the required resources, commenting on additional polylogarithmic factors beyond those incurred by an ideal constant resource dynamical decoder.

arXiv:1511.05579•New Journal of Physics•Jun 6, 2017•44 citations

Self-correction phase transition in the dissipative toric code

Sanjeev Kumar, Hendrik Weimer

We analyze a time-continuous version of a cellular automaton decoder for the toric code in the form of a Lindblad master equation. In this setting, a self-correcting quantum memory becomes a thermodynamical phase of the steady state, which manifests itself through the steady state being topologically ordered. We compute the steady state phase diagram, finding a competition between the error correction rate and the update rate for the classical field of the cellular automaton. Strikingly, we find that self-correction of errors is possible even in situations where conventional quantum error correction does not have a finite threshold.

quant-pharXiv:2602.19288•Feb 24, 2026•3 citations

Cellular-automaton decoders for topological quantum memories

Michael Herold, Earl T. Campbell, Jens Eisert +1 more

We introduce a new framework for constructing topological quantum memories, by recasting error recovery as a dynamical process on a field generating cellular automaton. We envisage quantum systems controlled by a classical hardware composed of small local memories, communicating with neighbours and repeatedly performing identical simple update rules. This approach does not require any global operations or complex decoding algorithms. Our cellular automata draw inspiration from classical field theories, with a Coulomb-like potential naturally emerging from the local dynamics. For a 3D automaton coupled to a 2D toric code, we present evidence of an error correction threshold above 6.1% for uncorrelated noise. A 2D automaton equipped with a more complex update rule yields a threshold above 8.2%. Our framework provides decisive new tools in the quest for realising a passive dissipative quantum memory. A new error correction method for quantum computing memories is based on local computing elements. Michael Herold from the Freie Universität Berlin in Germany, with colleagues in Germany, Denmark and the UK, sought to address the challenge of maintaining information stored in topological quantum memories. Without a stable memory, delicate quantum states can decay quickly, introducing errors in stored information. Error correction is an important process in stabilizing topological memories, but was previously conceived as a system-wide process. The proposed practical error correction mechanism relies on parallel cellular operations within the topological quantum memory, so that the local operations replace the need for a complex system-wide scheme. The concept has the further benefit of being compatible with classical hardware, and it is easily scalable.

arXiv:1406.2338•npj Quantum Information•Oct 26, 2015•78 citations

Local decoders for fault-tolerant quantum computation and translation-invariant stabilizer codes

Nathaniel Selub, Aditya Bhardwaj, Ethan Lake

We construct the first fully spatially local fault-tolerant quantum computer based on topological codes in fewer than four spatial dimensions. Our construction is a two-dimensional architecture that uses only geometrically local quantum and classical operations, bounded-speed classical communication and computation, and a constant density of quantum and classical resources. The core component is a new time-translation-invariant cellular-automaton decoder for the surface code. This decoder preserves logical information for a time stretched-exponential in the code distance and operates continuously during state injection, stabilizer-state preparation, lattice surgery, and transversal readout. We also prove that every translation-invariant topological Pauli stabilizer code is locally decodable under phenomenological noise.

quant-pharXiv:2609.11457•Sep 11, 2026•3 citations

Quantum Memory and Autonomous Computation in Two Dimensions

Gesa Dünnweber, Georgios Styliaris, Rahul Trivedi

Quantum error correction (QEC) normally requires active maintenance using measurements, classical processing and externally controlled correction schedules. Passive QEC, by contrast, was previously established only in unphysical spatial dimensions. Here, we give an explicit scheme for autonomous quantum error correction and computation in two dimensions, formulated as a dissipative quantum cellular automaton with a fixed, local and translation-invariant update rule. The construction uses hierarchical, self-simulating control elements based on ideas from the seminal classical results of Gács (1986, 1989) together with a measurement-free concatenated quantum code. We prove the existence of a nonzero noise threshold under a local noise model. Below this threshold, logical errors on encoded initial states are suppressed exponentially with increasing system size and the memory lifetime diverges in the thermodynamic limit. As an extension, we outline how this mechanism can also be implemented in continuous time by a time-independent, translation-invariant local Lindbladian. Quantum circuits can moreover be encoded in the automaton's initial state and executed fault-tolerantly with polylogarithmic overhead under the same circuit-independent rule. Our scheme thus realizes a self-correcting quantum computer capable of universal computation.

quant-pharXiv:2601.20818•Jan 29, 2026•10 citations

Strictly local one-dimensional topological quantum error correction with symmetry-constrained cellular automata

Nicolai Lang, Hans Peter Büchler

Active quantum error correction on topological codes is one of the most promising routes to long-term qubit storage. In view of future applications, the scalability of the used decoding algorithms in physical implementations is crucial. In this work, we focus on the one-dimensional Majorana chain and construct a strictly local decoder based on a self-dual cellular automaton. We study numerically and analytically its performance and exploit these results to contrive a scalable decoder with exponentially growing decoherence times in the presence of noise. Our results pave the way for scalable and modular designs of actively corrected one-dimensional topological quantum memories.

arXiv:1711.08196•SciPost Physics•Jan 31, 2018•10 citations
Active error correction of topological quantum codes - in particular the toric code - remains one of the most viable routes to large scale quantum information processing. In this work, we introduce the concept of a dynamical decoder as a promising route for achieving fault-tolerant quantum memories. We analyze a specific dynamical decoder based on a discrete time cellular automaton decoder and provide evidence of a threshold above 0.05% with measurement errors. Without measurement errors, the threshold increases by a factor of roughly 1.5. We stress that (asynchronous) dynamical decoding gives rise to a Markovian dissipative process, hence equating cellular automaton decoding to a fully dissipative topological quantum memory, which removes errors continuously. Finally, we analyze the required resources, and speculate about an ideal constant resource dynamical decoder.
Active error decoding and correction of topological quantum codes—in particular the toric code—remains one of the most viable routes to large scale quantum information processing. In contrast, passive error correction relies on the natural physical dynamics of a system to protect encoded quantum information. However, the search is ongoing for a completely satisfactory passive scheme applicable to locally interacting two-dimensional systems. Here, we investigate dynamical decoders that provide passive error correction by embedding the decoding process into local dynamics. We propose a specific discrete time cellular-automaton decoder in the fault tolerant setting and provide numerical evidence showing that the logical qubit has a survival time extended by several orders of magnitude over that of a bare unencoded qubit. We stress that (asynchronous) dynamical decoding gives rise to a Markovian dissipative process. We hence equate cellular-automaton decoding to a fully dissipative topological quantum memory, which removes errors continuously. In this sense, uncontrolled and unwanted local noise can be corrected for by a controlled local dissipative process. We analyze the required resources, commenting on additional polylogarithmic factors beyond those incurred by an ideal constant resource dynamical decoder.
We analyze a time-continuous version of a cellular automaton decoder for the toric code in the form of a Lindblad master equation. In this setting, a self-correcting quantum memory becomes a thermodynamical phase of the steady state, which manifests itself through the steady state being topologically ordered. We compute the steady state phase diagram, finding a competition between the error correction rate and the update rate for the classical field of the cellular automaton. Strikingly, we find that self-correction of errors is possible even in situations where conventional quantum error correction does not have a finite threshold.
We introduce a new framework for constructing topological quantum memories, by recasting error recovery as a dynamical process on a field generating cellular automaton. We envisage quantum systems controlled by a classical hardware composed of small local memories, communicating with neighbours and repeatedly performing identical simple update rules. This approach does not require any global operations or complex decoding algorithms. Our cellular automata draw inspiration from classical field theories, with a Coulomb-like potential naturally emerging from the local dynamics. For a 3D automaton coupled to a 2D toric code, we present evidence of an error correction threshold above 6.1% for uncorrelated noise. A 2D automaton equipped with a more complex update rule yields a threshold above 8.2%. Our framework provides decisive new tools in the quest for realising a passive dissipative quantum memory. A new error correction method for quantum computing memories is based on local computing elements. Michael Herold from the Freie Universität Berlin in Germany, with colleagues in Germany, Denmark and the UK, sought to address the challenge of maintaining information stored in topological quantum memories. Without a stable memory, delicate quantum states can decay quickly, introducing errors in stored information. Error correction is an important process in stabilizing topological memories, but was previously conceived as a system-wide process. The proposed practical error correction mechanism relies on parallel cellular operations within the topological quantum memory, so that the local operations replace the need for a complex system-wide scheme. The concept has the further benefit of being compatible with classical hardware, and it is easily scalable.
We construct the first fully spatially local fault-tolerant quantum computer based on topological codes in fewer than four spatial dimensions. Our construction is a two-dimensional architecture that uses only geometrically local quantum and classical operations, bounded-speed classical communication and computation, and a constant density of quantum and classical resources. The core component is a new time-translation-invariant cellular-automaton decoder for the surface code. This decoder preserves logical information for a time stretched-exponential in the code distance and operates continuously during state injection, stabilizer-state preparation, lattice surgery, and transversal readout. We also prove that every translation-invariant topological Pauli stabilizer code is locally decodable under phenomenological noise.
Quantum error correction (QEC) normally requires active maintenance using measurements, classical processing and externally controlled correction schedules. Passive QEC, by contrast, was previously established only in unphysical spatial dimensions. Here, we give an explicit scheme for autonomous quantum error correction and computation in two dimensions, formulated as a dissipative quantum cellular automaton with a fixed, local and translation-invariant update rule. The construction uses hierarchical, self-simulating control elements based on ideas from the seminal classical results of Gács (1986, 1989) together with a measurement-free concatenated quantum code. We prove the existence of a nonzero noise threshold under a local noise model. Below this threshold, logical errors on encoded initial states are suppressed exponentially with increasing system size and the memory lifetime diverges in the thermodynamic limit. As an extension, we outline how this mechanism can also be implemented in continuous time by a time-independent, translation-invariant local Lindbladian. Quantum circuits can moreover be encoded in the automaton's initial state and executed fault-tolerantly with polylogarithmic overhead under the same circuit-independent rule. Our scheme thus realizes a self-correcting quantum computer capable of universal computation.
Active quantum error correction on topological codes is one of the most promising routes to long-term qubit storage. In view of future applications, the scalability of the used decoding algorithms in physical implementations is crucial. In this work, we focus on the one-dimensional Majorana chain and construct a strictly local decoder based on a self-dual cellular automaton. We study numerically and analytically its performance and exploit these results to contrive a scalable decoder with exponentially growing decoherence times in the presence of noise. Our results pave the way for scalable and modular designs of actively corrected one-dimensional topological quantum memories.