SearcharxivSearch

arXiv · 2203.14081

Fermion picture for cellular automata

Abstract

How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful methods exist for this type of problem. Indeed, many cellular automata admit an interpretation in terms of fermionic particles. Reversible automata on space-lattices with a local updating rule can be described by a partition function or Grassmann functional integral for interacting fermions moving in this space. We discuss large classes of automata that are equivalent to discretized fermionic quantum field theories with various types of interactions. Two-dimensional models include relativistic Thirring or Gross-Neveu type models with abelian or non-abelian continuous global symmetries, models with local gauge symmetries, and spinor gravity with local Lorentz symmetry as well as diffeomorphism invariance in the (naive) continuum limit. The limit of a very large number of cells needs a probabilistic description. Probabilistic cellular automata are characterized by a probability distribution over initial bit-configurations. They can be described by the quantum formalism with wave functions, density matrix and non-commuting operators associated to observables, which are the same for the automata and associated fermionic quantum theories. This formalism is crucial for a discussion of concepts as vacuum states, spontaneous symmetry breaking, coarse graining and the continuum limit for probabilistic cellular automata. In particular, we perform explicitly the continuum limit for an automaton that describes a quantum particle in a potential for one space dimension.

Explore related subjects

Keep this discovery

BibTeXRIS

C. Wetterich. 2022-03-26. Fermion picture for cellular automata. https://arxiv.org/abs/2203.14081

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Optical free space extreme learning machine for the implementation of emergent complex systems

Cellular automata conform a set of computational models which evolve with a reduced set of simple rules, yet still are able to show extremely complex emergent phenomena such as fractals and universal computation. Despite their apparent simplicity, they have shown great potential in simulating natural systems and solving challenging computational tasks such as classification and image generation. Instead of implementing cellular automata purely at the software level, it is desirable to design novel analog computing platforms that physically evolve following the automata's underlying rules, thereby reducing power requirements and latency. Here, we introduce an optical extreme learning machine for the simulation of a wide range of cellular automata. Our system operates in free space, and uses a spatial light modulator to encode the evolution rules of the system, while coherent wave propagation performs the corresponding computations. Our results demonstrate a simple, fully-programmable, cost and power efficient, and easy to build and align platform for the implementation of a wide range of complex computational systems such as elementary cellular automata, Conway's Game of Life, and two-dimensional Turing machines.

nlin.CG

The istr-graph: Interactive Visualisation of any Classic-Graph in DDLab

Any type of attractor basin (classic-graph) created in DDLab can now be visualised, manipulated, and deconstructed as a drag/drop ``interactive state transition graph'' (istr-graph). The new istr-graph applies to subtrees, single basins, the basin of attraction field, compression, and all other classic-graph parameters. This is an important update on the pre-existing ``interactive basin of attraction field graph'' (ibaf-graph) specific to just the complete uncompressed field, but the ibaf-graph is nevertheless retained for some of its unique attributes. These issues are discussed with a focus on the scope and implementation of the new istr-graph.

nlin.CG

Game of Life on Archimedean Lattices: Glider Guns and Phase Dynamics

I explore Conway's Game of Life (GoL) on six composite Archimedean lattices. On the Kagome lattice, on which small gliders and puffers appear particularly frequently across inputs, I use the output of a symmetry-constrained evolutionary search algorithm to construct a novel glider gun. The glider gun comprises four interacting bouncers and stably emits a small glider every 276th generation. Serving as an extension of classical GoL, I also propose cells with a phase degree of freedom and an associated local phase rule, which on the Kagome lattice is demonstrated to host phase-periodic gliders. This enables the possibility of phase-sensitive and interference-based computations.

nlin.CG