Related papers: Directed percolation in non-unitary quantum cellul…
We study self-similarity in one-dimensional probabilistic cellular automata (PCA) using the renormalization technique. We introduce a general framework for algebraic construction of renormalization groups (RG) on cellular automata and apply…
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…
We present a quantum cellular automaton model in one space-dimension which has the Dirac equation as emergent. This model, a discrete-time and causal unitary evolution of a lattice of quantum systems, is derived from the assumptions of…
In this paper we use the cellular automaton (CA) approach to model one-dimensional binary diffusion in solids. Employing a very simple state change rule we define an asynchronous CA model and take its continuum limit to obtain the governing…
Central to the field of quantum machine learning is the design of quantum perceptrons and neural network architectures. A key question in this regard is the impact of quantum effects on the way in which such models process information.…
Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classically, CA are run on a regular lattice and with perfect…
We describe a simple n-dimensional quantum cellular automaton (QCA) capable of simulating all others, in that the initial configuration and the forward evolution of any n-dimensional QCA can be encoded within the initial configuration of…
A Quantum Cellular Automaton (QCA) is essentially an operator driving the evolution of particles on a lattice, through local unitaries. Because $\Delta_t=\Delta_x = \epsilon$, QCAs constitute a privileged framework to cast the digital…
We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any one-dimensional QCA can be encoded within the initial…
This paper introduces a new formalism for quantum cellular automata (QCAs), based on evolving tensor products of qubits using local unitary operators. It subsequently uses this formalism to analyze and validate several conjectures, stemming…
Probabilistic cellular automata provide a simple framework for the exploration of classical nonequilibrium processes. Recently, quantum cellular automata have been proposed that rely on the propagation of a one-dimensional quantum state…
This study presents a unitary quantum cellular automaton (QCA) that, in the continuum limit, converges to the (1+1)-dimensional Generalized Dirac Equation (GDE). We outline the construction of the unitary, discrete-time evolution and derive…
Probabilistic cellular automata (PCA) are used to model a variety of discrete spatially extended systems undergoing parallel-updating. We propose an embedding of a number of classical nonequilibrium concepts in the PCA-world. We start from…
Three cellular automaton (CA) models of increasing complexity are introduced to model driven diffusive systems related to the generalized Frenkel-Kontorova (FK) models recently proposed by Braun [Phys.Rev.E58, 1311 (1998)]. The models are…
A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown that the…
Classical reversible cellular automata (CAs), which describe the discrete-time dynamics of classical degrees of freedom in a finite state-space, can exhibit exact, nonthermal quantum eigenstates despite being classically chaotic. We show…
We perform a principal component analysis (PCA) of two one-dimensional lattice models belonging to distinct nonequilibrium universality classes - directed bond percolation and branching and annihilating random walks with even number of…
Starting from integrable cellular automata we present a novel form of Painlev\'e equations. These equations are discrete in both the independent variable and the dependent one. We show that they capture the essence of the behavior of the…
Quantum cellular automata are important tools in understanding quantum dynamics, thanks to their simple and effective list of rules. Here we investigate explicitly how coherence is built and lost in the evolution of one-dimensional automata…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…