arXiv · 2304.03240
Protecting information via probabilistic cellular automata
Abstract
Probabilistic cellular automata describe the dynamics of classical spin models, which, for sufficiently small temperature $T$, can serve as classical memory capable of storing information even in the presence of nonzero external magnetic field $h$. In this article, we study a recently-introduced probabilistic cellular automaton, the sweep rule, and map out a region of two coexisting stable phases in the $(T,h)$ plane. We also find that the sweep rule belongs to the weak two-dimensional Ising universality class. Our work is a step towards understanding how simple geometrically-local error-correction strategies can protect information encoded into complex noisy systems, such as topological quantum error-correcting codes.
Explore related subjects
Keep this discovery
Annie Ray, Raymond Laflamme, Aleksander Kubica. 2023-04-06. Protecting information via probabilistic cellular automata. https://doi.org/10.1103/physreve.109.044141
Cite the original work for its findings. Save a collection to share your selection of sources.