Related papers: Renormalisation of Quantum Cellular Automata
We show that a behaviour analogous to degenerate hyperbolicity can occur in nearest-neighbour cellular automata (CA) with three states. We construct a 3-state rule by "lifting" elementary CA rule 140. Such "lifted" rule is equivalent to…
Extracting the Hamiltonian of interacting quantum-information processing systems is a keystone problem in the realization of complex phenomena and large-scale quantum computers. The remarkable growth of the field increasingly requires…
We apply the dinamically driven renormalization group to study the critical properties of the Domany-Kinzel probabilistic cellular automaton. To preserve the absorbing state clusters with at least one site occupied are renormalized into a…
Evaluation of likelihood functions for cosmological large scale structure data sets (including CMB, galaxy redshift surveys, etc.) naturally involves marginalization, i.e., integration, over an unknown underlying random signal field.…
In this brief article I show how the notion of coarse graining and the Renormalization Group enter naturally in the dynamics of genetic systems, in particular in the presence of recombination. I show how the latter induces a dynamics…
The spin-1 Ising (BEG) model with the nearest-neighbour bilinear and biquadratic interactions and single-ion anisotropy is simulated on a cellular automaton which improved from the Creutz cellular automaton(CCA) for a simple cubic lattice.…
Real-Space renormalization group techniques are developed for tackling large curvature fluctuations in quantum gravity. Within cells of invariant volume $a^4$, only certain types of fluctuations are allowed. Normal coordinates are used to…
We study a two-dimensional semi-totalistic binary cell-state cellular automaton, which imitates a reversible precipitation in an abstract chemical medium. The systems exhibits a non-trivial growth and nucleation. We demonstrate how basic…
We continue our analysis of the physics of quantum lattice gas automata (QLGA). Previous work has been restricted to periodic or infinite lattices; simulation of more realistic physical situations requires finite sizes and non-periodic…
Spontaneous stratification of granular mixtures has been reported by Makse et al. [Nature 386, 379 (1997)] when a mixture of grains differing in size and shape is poured in a quasi-two-dimensional heap. We study this phenomenon using two…
Cellular automata provide models of parallel computation based on cells, whose connectivity is given by an action of a monoid on the cells. At each step in the computation, every cell is decorated with a state that evolves in discrete steps…
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…
Quantum machine learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure…
The complexity of cellular automata is traditionally measured by their computational capacity. However, it is difficult to choose a challenging set of computational tasks suitable for the parallel nature of such systems. We study the…
A short survey of the renormalization problem in QCD and its non-perturbative solution by means of numerical simulations on the lattice is given. Most emphasis is on scale dependent renormalizations, which can be reliably addressed via a…
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…
We introduce a coarse-graining transformation for tensor networks that can be applied to study both the partition function of a classical statistical system and the Euclidean path integral of a quantum many-body system. The scheme is based…
A Genetic Algorithm (GA) is proposed in which each member of the population can change schemata only with its neighbors according to a rule. The rule methodology and the neighborhood structure employ elements from the Cellular Automata (CA)…
We develop a renormalization group (RG) description of the localization properties of onedimensional (1D) quasiperiodic lattice models. The RG flow is induced by increasing the unit cell of subsequent commensurate approximants. Phases of…
In this paper, in order to investigate natural transformations from discrete CA to QCA, we introduce a new formulation of finite cyclic QCA and generalized notion of partitioned QCA. According to the formulations, we demonstrate the…