Related papers: A weakly universal cellular automaton in the penta…
Quantum computation based on quantum cellular automata (QCA) can greatly reduce the control and precision necessary for experimental implementations of quantum information processing. A QCA system consists of a few species of qubits in…
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…
The spatial structure, fluctuations as well as all state probabilities of self-organized (steady) states of cellular automata can be found (almost) exactly and {\em explicitly} from their Markovian dynamics. The method is shown on an…
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…
Physical universality of a cellular automaton was defined by Janzing in 2010 as the ability to implement an arbitrary transformation of spatial patterns. In 2014, Schaeffer gave a construction of a two-dimensional physically universal…
The model of cellular automata is fascinating because very simple local rules can generate complex global behaviors. The relationship between local and global function is subject of many studies. We tackle this question by using results on…
The recent experimental results of LHCb collaboration suggested the existence of pentaquark states with charmonium. To understand the structure of the states, a dynamical calculation of 5-quark systems with quantum numbers…
We show that there exists a one-to-one correspondence between the set of number-conserving cellular automata (CA) with $q$ inputs and the set of balanced sequences with $q$ terms. This allows to enumerate number-conserving CA. We also show…
In this paper, we revisit a classic example of probabilistic cellular automaton (PCA) on {0, 1} Z , namely, addition modulo 2 of the states of the left-and right-neighbouring cells, followed by either preserving the result of the addition,…
Complexity has been a recurrent research topic in cellular automata because they represent systems where complex behaviors emerge from simple local interactions. A significant amount of previous research has been conducted proposing…
We analytically diagonalize a discrete-time on-site interacting fermionic cellular automaton in the two-particle sector. Important features of the solutions sensibly differ from those of analogous Hamiltonian models. In particular, we found…
For any group $G$ and set $A$, a cellular automaton over $G$ and $A$ is a transformation $\tau : A^G \to A^G$ defined via a finite neighborhood $S \subseteq G$ (called a memory set of $\tau$) and a local function $\mu : A^S \to A$. In this…
In this paper we present two interesting properties of stochastic cellular automata that can be helpful in analyzing the dynamical behavior of such automata. The first property allows for calculating cell-wise probability distributions over…
In the regime of weak nonlinearity we present two general feasible schemes. One is an entangler for generating any one of the $n$-photon Greenberger-Horne-Zeilinge (GHZ) states and Bell states. After the interactions with cross-Kerr…
We construct a one-dimensional uniquely ergodic cellular automaton which is not nilpotent. This automaton can perform asymptotically infinitely sparse computation, which nevertheless never disappears completely. The construction builds on…
Cellular Automata have been used since their introduction as a discrete tool of modelization. In many of the physical processes one may modelize thus (such as bootstrap percolation, forest fire or epidemic propagation models, life without…
The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce…
We propose a characteristic representation ofone-dimensional and 2-state, 3-neighbor cellular automaton rules, which describes an effective form of each rule after many time steps. Simulated results of the representation show that complex…
In this paper, we propose a new approach for building cellular automata to solve real-world segmentation problems. We design and train a cellular automaton that can successfully segment high-resolution images. We consider a colony that…
In this work, a planar phased array antenna was engineered with ultra-wideband (UWB) performance that covers portions of the L-, S-, and C-bands. The unit cell design contains a driven layer that is directly connected to a single coaxial…