Related papers: On two non-ergodic reversible cellular automata, o…
We discuss the action principle and resulting Hamiltonian equations of motion for a class of integer-valued cellular automata introduced recently [1]. Employing sampling theory, these deterministic finite-difference equations are mapped…
The one-dimensional dynamics of identical discrete elements that combine the properties of newtonian mechanical particles and cellular automata are investigated. It is shown that the motion of a cluster of combined discrete elements, which…
A simple relation of the order of $n$ abstract objects generates an $n-2$ dimensional basis of three dimensional vectors. A cellular automaton-like model of evolution of this system is postulated. During this evolution, some quantities…
We present some computer simulations run on a stochastic CA (cellular automaton). The CA simulates a gas of particles which are in a channel, the interval $[1,L]$ in $\mathbb Z$, but also in "reservoirs" $\mathcal R_1$ and $\mathcal R_2$.…
Several proposed schemes for the physical realization of a quantum computer consist of qubits arranged in a cellular array. In the quantum circuit model of quantum computation, an often complex series of two-qubit gate operations is…
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…
We consider discrete and integer-valued cellular automata (CA). A particular class of which comprises "Hamiltonian CA" with equations of motion that bear similarities to Hamilton's equations, while they present discrete updating rules. The…
We propose a physical realization of quantum cellular automata (QCA) using arrays of ultracold atoms excited to Rydberg states. The key ingredient is the use of programmable multifrequency couplings which generalize the Rydberg blockade and…
A model for 1D traffic flow is developed, which is discrete in space and time. Like the cellular automaton model by Nagel and Schreckenberg [J. Phys. I France 2, 2221 (1992)], it is simple, fast, and can describe stop-and-go traffic. Due to…
This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial…
We introduce and describe a class of simple facilitated quantum spin models in which the dynamics is due to the repeated application of unitary gates. The gates are applied periodically in time, so their combined action constitutes a…
Dynamical systems can display a plethora of ergodic and ergodicity breaking behaviors, ranging from simple periodicity to ergodicity and chaos. Here we report an unusual type of non-ergodic behavior in a many-body discrete-time dynamical…
A nonrelativistic equation for the system of two interacting particles within the framework of a model with noncommuting operators of coordinates and momenta of different particles is proposed, and a self-consistent system of equations for…
Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…
Certain fermionic quantum field theories are equivalent to probabilistic cellular automata, with fermionic occupation numbers associated to bits. We construct an automaton that represents a discrete model of spinor gravity in four…
As quantum devices scale to larger and larger sizes, a significant challenge emerges in scaling their coherent controls accordingly. Quantum cellular automata (QCAs) constitute a promising framework that bypasses this control problem:…
Quantum link models are extensions of Wilson-type lattice gauge theories which realize exact gauge invariance with finite-dimensional Hilbert spaces. Quantum link models not only reproduce the standard features of Wilson's lattice gauge…
Bijections between sets may be seen as discrete (or crisp) unitary transformations used in quantum computations. So discrete quantum cellular automata are cellular automata with reversible transition functions. This note studies on 1d…
Quantum cellular automata (QCA) constitute space and time homogeneous discrete models for quantum field theories (QFTs). Although QFTs are defined without reference to particles, computations are done in terms of Feynman diagrams, which are…
A necessary and sufficient condition for a one-dimensional q-state n-input cellular automaton rule to be number-conserving is established. Two different forms of simpler and more visual representations of these rules are given, and their…