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

A Computational Toy Model of Non-Local Information Storage in a Quantum Cellular Automaton

Rowan Brad Quni-Gudzinas

Published Jan 8, 2026• 0 citations
Publisher

Abstract

Can local, unitary dynamics generate the non-local information storage that holographic quantum error correction requires? This corrected version of the toy model answers with a fully reproducible exact state-vector simulation of a twelve-qubit quantum cellular automaton under the Fredkin gate. Two structural facts frame the work: standard product-state initializations are fixed points of permutation gates, and endpoint mutual information is exactly invariant under erasure of the qubits between the probes. With a documented symmetry-breaking initialization, the Fredkin dynamics generate substantial entanglement and, after erasure of up to two-thirds of the chain, retain residual segment correlations that a swap-gate control loses exactly and immediately. The simulation source ships with the paper; every reported number is reproducible. Claims are bounded by the twelve-qubit scale and by the proxy status of the diagnostics: local conditional dynamics can delocalize information across a chain in a way that pure transport cannot, measurably, before any decoder is designed.

DOI
10.5281/zenodo.18183774

Related papers

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•0 citations

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•36 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•7 citations

Local Measurement Theory for Quantum Cellular Automata

Tommaso Brambilla, Alessandro Tosini, Paolo Perinotti

The formulation of quantum measurements compatible with relativistic causality is obstructed by the tension between the locality of observable algebras and the dynamical state transformations induced by measurement processes. We develop a local measurement theory for quantum cellular automata, lattices of finite-dimensional quantum systems with a causal reversible dynamics evolving in discrete time steps. Measurement processes are described by localized completely positive maps and organized into operational measurement protocols, finite non-adaptive sequences of local instruments distributed across the causal cone induced by the automaton local dynamics. Each protocol induces an effective measurement on the initial time slice, whose support is constrained by the causal structure generated by the automaton. Non-local measurement effects therefore arise through causal propagation and composition of local operations, rather than from primitive non-local interventions or instantaneous collapse prescriptions. We establish the corresponding spatial support bounds and characterize the resulting measurement architecture. As an explicit example, we construct a two-step protocol for a one-dimensional nearest-neighbour qubit automaton which, for suitable automaton parameters, realizes a Bell-basis projective measurement on two neighbouring sites after coarse-graining of the local outcomes. Away from this point, the same protocol generates a continuous family of deformed Bell measurements whose entanglement and stabilizer Rényi non-classicality can be quantified explicitly. The framework thus provides a causally consistent operator-algebraic mechanism for synthesizing spatially extended quantum measurements from strictly local operations.

quant-pharXiv:2610.26587•Oct 20, 2026•0 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•63 citations

Quantization of Cellular Automata

Pablo J. Arrighi, Vincent Nesme

Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the r esult could actually make sense physically, as a valid quantum evolution; but do es it make sense as a quantum cellular automaton? That is the main question we a ddress in this paper. In every model with discrete time and space, two things ar e required in order to qualify as a cellular automaton: invariance by translatio n and locality. We prove that this locality condition is so restrictive in the q uantum case that every quantum cellular automaton constructed in this way - i. e., by linearization of a classical one - must be reversible. We also discuss some subtleties about the extent of nonlocality that can be encountered in the o ne-dimensional case; we show that, even when the quantized version is non local, still, under some conditions, we may be unable to use this nonlocality to trans mit information nonlocally.

arXiv:0903.0258•Mar 2, 2009•1 citation
Can local, unitary dynamics generate the non-local information storage that holographic quantum error correction requires? This corrected version of the toy model answers with a fully reproducible exact state-vector simulation of a twelve-qubit quantum cellular automaton under the Fredkin gate. Two structural facts frame the work: standard product-state initializations are fixed points of permutation gates, and endpoint mutual information is exactly invariant under erasure of the qubits between the probes. With a documented symmetry-breaking initialization, the Fredkin dynamics generate substantial entanglement and, after erasure of up to two-thirds of the chain, retain residual segment correlations that a swap-gate control loses exactly and immediately. The simulation source ships with the paper; every reported number is reproducible. Claims are bounded by the twelve-qubit scale and by the proxy status of the diagnostics: local conditional dynamics can delocalize information across a chain in a way that pure transport cannot, measurably, before any decoder is designed.
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 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.
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.
The formulation of quantum measurements compatible with relativistic causality is obstructed by the tension between the locality of observable algebras and the dynamical state transformations induced by measurement processes. We develop a local measurement theory for quantum cellular automata, lattices of finite-dimensional quantum systems with a causal reversible dynamics evolving in discrete time steps. Measurement processes are described by localized completely positive maps and organized into operational measurement protocols, finite non-adaptive sequences of local instruments distributed across the causal cone induced by the automaton local dynamics. Each protocol induces an effective measurement on the initial time slice, whose support is constrained by the causal structure generated by the automaton. Non-local measurement effects therefore arise through causal propagation and composition of local operations, rather than from primitive non-local interventions or instantaneous collapse prescriptions. We establish the corresponding spatial support bounds and characterize the resulting measurement architecture. As an explicit example, we construct a two-step protocol for a one-dimensional nearest-neighbour qubit automaton which, for suitable automaton parameters, realizes a Bell-basis projective measurement on two neighbouring sites after coarse-graining of the local outcomes. Away from this point, the same protocol generates a continuous family of deformed Bell measurements whose entanglement and stabilizer Rényi non-classicality can be quantified explicitly. The framework thus provides a causally consistent operator-algebraic mechanism for synthesizing spatially extended quantum measurements from strictly local operations.
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.
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the r esult could actually make sense physically, as a valid quantum evolution; but do es it make sense as a quantum cellular automaton? That is the main question we a ddress in this paper. In every model with discrete time and space, two things ar e required in order to qualify as a cellular automaton: invariance by translatio n and locality. We prove that this locality condition is so restrictive in the q uantum case that every quantum cellular automaton constructed in this way - i. e., by linearization of a classical one - must be reversible. We also discuss some subtleties about the extent of nonlocality that can be encountered in the o ne-dimensional case; we show that, even when the quantized version is non local, still, under some conditions, we may be unable to use this nonlocality to trans mit information nonlocally.