Related papers: A Yang-Baxter integrable cellular automaton with a…
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…
The Quantum Inverse Scattering Method is a scheme for solving integrable models in $1+1$ dimensions, building on an $R$-matrix that satisfies the Yang--Baxter equation and in terms of which one constructs a commuting family of transfer…
We define integrability preserving Yang-Baxter deformations of symmetric space sigma models with non-semi-simple symmetry group, in particular the flat space string, using only the essential structures of a symmetric space sigma model. For…
We introduce classical many-body dynamics on a one-dimensional lattice comprising local two-body maps arranged on discrete space-time mesh that serve as discretizations of Hamiltonian dynamics with arbitrarily time-varying coupling…
Here I describe a view of the evolution of cellular automata that allows to operate on larger structures. Instead of calculating the next state of all cells in one step, the method here developed uses a time slice that can proceed at…
This paper studies three classes of cellular automata from a computational point of view: freezing cellular automata where the state of a cell can only decrease according to some order on states, cellular automata where each cell only makes…
Probabilistic cellular automata with deterministic updating are quantum systems. We employ the quantum formalism for an investigation of random probabilistic cellular automata, which start with a probability distribution over initial…
We consider a class of noisy, one-dimensional quantum cellular automata that allow one to shift from unitary dynamics to completely positive maps, and investigate the notion of reversibility in such a setting. To this aim, we associate an…
We consider transformations between attractor basins of binary cylindrical cellular automata resulting from mutations. A t-point mutation of a state consists in toggling t sites in that state. Results of such mutations are described by a…
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…
This paper considers aspects of a Kagome lattice system with states classified by plane partitions. Using two sets of free fermions, we rewrite the lattice in terms of two families of spin chains. In this formalism, the quantum crystals…
We derive a novel two-field four-dimensional integrable field theory (IFT) from 6d holomorphic Chern-Simons theory on twistor space. The four-dimensional IFT depends on a skew-symmetric linear operator acting on a Lie algebra, and when this…
Matrix-product operators (MPOs) appear throughout the study of integrable lattice models, notably as the transfer matrices. They can also be used as transformations to construct dualities between such models, both invertible (including…
We study non-equilibrium defect accumulation dynamics on a cellular automaton trajectory: a branching walk process in which a defect creates a successor on any neighborhood site whose update it affects. On an infinite lattice, defects…
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…
Commonly studied cellular automata are memoryless and have fixed topology of connections between cells. However by allowing updates of links and short-term memory in cells we may potentially discover novel complex regimes of spatio-temporal…
One-dimensional quantum cellular automata (QCA) consist in a line of identical, finite dimensional quantum systems. These evolve in discrete time steps according to a local, shift-invariant unitary evolution. By local we mean that no…
We focus on a family of one-dimensional probabilistic cellular automata with memory two: the dynamics is such that the value of a given cell at time $t+1$ is drawn according to a distribution which is a function of the states of its two…
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…
We study integrability properties of a reversible deterministic cellular automaton (the rule 54 of [Bobenko et al., Commun. Math. Phys. 158, 127 (1993)]) and present a bulk algebraic relation and its inhomogeneous extension which allow for…