Related papers: Construction of Reversible Lattice Molecular Autom…
Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in…
Lattice Gas Automata (LGA) is a classical method for simulating physical phenomena, including Computational Fluid Dynamics (CFD). Quantum LGA (QLGA) is the family of methods that implement LGA schemes on quantum computers. In recent years,…
The emergence of complex behaviors in cellular automata is an area that has been widely developed in recent years with the intention to generate and analyze automata that produce space-moving patterns or gliders that interact in a periodic…
We review the class of cellular automata known as lattice gases, and their applications to problems in physics and materials science. The presentation is self-contained, and assumes very little prior knowledge of the subject. Hydrodynamic…
We focus on a family of one-dimensional probabilistic cellular automata with memory two: the dynamics is such that the value of a given cell at time $t+1$ is drawn according to a distribution which is a function of the states of its two…
Amphiphilic molecules spontaneously form self-assembled structures of various shapes depending on their molecular structures, the temperature, and other physical conditions. The functionalities of these structures are dictated by their…
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…
Large language models (LLMs) are beginning to reshape how chemists plan and run reactions in organic synthesis. Trained on millions of reported transformations, these text-based models can propose synthetic routes, forecast reaction…
This study presents a theoretical model for a self-replicating mechanical system inspired by biological processes within living cells and supported by computer simulations. The model decomposes self-replication into core components, each of…
Cellular automata are arrays of finite state machines that can exist in a finite number of states. These machines update their states simultaneously based on specific local rules that govern their interactions. This framework provides a…
We present a preliminary study of a new class of two-input cellular automata called eventually number-conserving cellular automata characterized by the property of evolving after a finite number of time steps to states whose number of…
Quantum cellular automata (QCAs) are automorphisms of tensor product algebras that preserve locality, with local quantum circuits as a simple example. We study approximate QCAs, where the locality condition is only satisfied up to a small…
Causal Graph Dynamics extend Cellular Automata to arbitrary, bounded-degree, time-varying graphs. The whole graph evolves in discrete time steps, and this global evolution is required to have a number of physics-like symmetries:…
Cellular automata (CA) is an important modelling paradigm for complex systems. In the design of cellular automata, the most difficult task is to find the transformation rules that describe the temporal evolution or pattern of a modelled…
We describe a class of cellular automata (CAs) that are end-to-end differentiable. DCAs interpolate the behavior of ordinary CAs through rules that act on distributions of states. The gradient of a DCA with respect to its parameters can be…
Large Language Models (LLMs) are known for their expensive and time-consuming training. Thus, oftentimes, LLMs are fine-tuned to address a specific task, given the pretrained weights of a pre-trained LLM considered a foundation model. In…
Cellular automata (CA) have been utilized for decades as discrete models of many physical, mathematical, chemical, biological, and computing systems. The most widely known form of CA, the elementary cellular automaton (ECA), has been…
Commonly studied cellular automata are memoryless and have fixed topology of connections between cells. However by allowing updates of links and short-term memory in cells we may potentially discover novel complex regimes of spatio-temporal…
This paper investigates reversibility properties of 1-dimensional 3-neighborhood d-state finite cellular automata (CAs) of length n under periodic boundary condition. A tool named reachability tree has been developed from de Bruijn graph…
Monte Carlo (MC) simulations of lattice models are a widely used way to compute thermodynamic properties of substitutional alloys. A limitation to their more widespread use is the difficulty of driving a MC simulation in order to obtain the…