Related papers: From quantum cellular automata to quantum lattice …
We propose an architecture based on Quantum cellular Automata which allows the use of only one type of quantum gates per computational step in order to perform nearest neighbor interactions. The model is built in partial steps, each one of…
This study presents a novel quantum algorithm for lattice gas automata simulation with a single time step, demonstrating logarithmic complexity in terms of $CX$ gates. The algorithm is composed of three main steps: collision, mapping, and…
A class of fermionic quantum field theories with interactions is shown to be equivalent to probabilistic cellular automata, namely cellular automata with a probability distribution for the initial states. Probabilistic cellular automata on…
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…
Number-conserving (or {\em conservative}) cellular automata have been used in several contexts, in particular traffic models, where it is natural to think about them as systems of interacting particles. In this article we consider several…
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…
In this paper, the author aims to establish a mathematical model for a mimic computer. To this end, a novel automaton is proposed. First, a one-dimensional cellular automaton is used for expressing some dynamic changes in the structure of a…
The one particle sector of the simplest one dimensional quantum lattice gas automaton has been observed to simulate both the (relativistic) Dirac and (nonrelativistic) Schroedinger equations, in different continuum limits. By analyzing the…
We consider a graph with a single quantum system at each node. The entire compound system evolves in discrete time steps by iterating a global evolution $U$. We require that this global evolution $U$ be unitary, in accordance with quantum…
A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e.…
We study a coarse-graining procedure for quantum cellular automata on hypercubic lattices that consists in grouping neighboring cells into tiles and selecting a subspace within each tile. This is done in such a way that multiple evolution…
We introduce cellular automata whose cell spaces are left homogeneous spaces and prove a uniform as well as a topological variant of the Curtis-Hedlund-Lyndon theorem. Examples of left homogeneous spaces are spheres, Euclidean spaces, as…
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:…
We consider a general class of discrete unitary dynamical models on the lattice. We show that generically such models give rise to a wavefunction satisfying a Schroedinger equation in the continuum limit, in any number of dimensions. There…
Probabilistic cellular automata (CA) provides a classic framework for studying non-equilibrium statistical physics on a lattices. A notable example is the Domany-Kinzel CA, which has been used to investigate the process of directed…
Quantum Information and the new informational paradigm are entering the domain of quantum field theory and gravity, suggesting the quantum automata framework. The quantum automaton is the minimal-assumption extension to the Planck and…
A classical local cellular automaton can describe an interacting quantum field theory for fermions. We construct a simple classical automaton for a particular version of the Thirring model with imaginary coupling. This interacting fermionic…
In this paper we study the space evolution in the Rule 54 reversible cellular automaton, which is a paradigmatic example of a deterministic interacting lattice gas. We show that the spatial translation of time configurations of the…
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…
Quantum Cellular Automaton (QCA) is a model for universal quantum computation and a natural candidate for digital quantum simulation of relativistic quantum fields. Here we introduce the first photonic platform for implementing…