Related papers: Spin models from nonlinear cellular automata
A quantum cellular automaton (QCA) or a causal unitary is by definition an automorphism of local operator algebra, by which local operators are mapped to local operators. Quantum circuits of small depth, local Hamiltonian evolutions for…
Classical $(1+1)D$ cellular automata, as for instance Domany-Kinzel cellular automata, are paradigmatic systems for the study of non-equilibrium phenomena. Such systems evolve in discrete time-steps, and are thus free of time-discretisation…
We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions…
In this paper we present a systematic view of Quantum Cellular Automata (QCA), a mathematical formalism of quantum computation. First we give a general mathematical framework with which to study QCA models. Then we present four different…
We use spin coherent states to compare classical and quantum evolution of a simple paradigmatic, discrete-time quantum dynamical system exhibiting chaotic behavior in the classical limit. The spin coherent states are employed to define a…
There exists algorithms to detect reversibility of cellular automaton (CA) for both finite and infinite lattices taking quadratic time. But, can we identify a $d$-state CA rule in constant time that is always reversible for every lattice…
Classical Cellular Automata (CCAs) are a powerful computational framework for modeling global spatio-temporal dynamics with local interactions. While CCAs have been applied across numerous scientific fields, identifying the local rule that…
A universal map is derived for all deterministic 1D cellular automata (CA) containing no freely adjustable parameters. The map can be extended to an arbitrary number of dimensions and topologies and its invariances allow to classify all CA…
Cellular automata have been useful artificial models for exploring how relatively simple rules combined with spatial memory can give rise to complex emergent patterns. Moreover, studying the dynamics of how rules emerge under artificial…
We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…
Every transitive cellular automaton (CA) is sensitive to initial conditions. We study this implication in the more general context of non-uniform cellular automata (NUCA) with finitely many different local update rules assigned to cells. We…
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…
This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the…
Viewed as approximations to quantum mechanics, classical evolutions can violate the positive-semidefiniteness of the density matrix. The nature of this violation suggests a classification of dynamical systems based on classical-quantum…
The Thirring Quantum Cellular Automaton (QCA) describes the discrete time dynamics of local fermionic modes that evolve according to one step of the Dirac cellular automaton followed by the most general on-site number-preserving…
Quantum devices featuring mid-circuit measurement and reset capabilities, such as quantum computers and dual-species Rydberg quantum simulators, enable the realization of quantum cellular automata. These systems evolve in discrete time…
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…
This article presents a new characterization of controllability and regional controllability of Deterministic Cellular Automata (CA for short). It focuses on analyzing these problems within the framework of control theory, which have been…
A new kind of cellular automaton (CA) for the study of the dynamics of urban systems is proposed. The state of a cell is not described using a finite set, but by means of continuum variables. A population sector is included, taking into…
We explore some aspects of phase transitions in cellular automata. We start recalling the standard formulation of statistical mechanics of discrete systems (Ising model), illustrating the Monte Carlo approach as Markov chains and stochastic…