Related papers: Factorization, reduction and embedding in integrab…
In terms of the crystal base of a quantum affine algebra $U_q(\mathfrak{g})$, we study a soliton cellular automaton (SCA) associated with the exceptional affine Lie algebra $\mathfrak{g}=D_4^{(3)}$. The solitons therein are labeled by the…
We introduce and describe a class of simple facilitated quantum spin models in which the dynamics is due to the repeated application of unitary gates. The gates are applied periodically in time, so their combined action constitutes a…
Fermionic formulas in combinatorial Bethe ansatz consist of sums of products of q-binomial coefficients. There exist refinements without a sum that are known to yield partition functions of box-ball systems with a prescribed soliton…
We study an integrable vertex model with a periodic boundary condition associated with U_q(A_n^{(1)}) at the crystallizing point q=0. It is an (n+1)-state cellular automaton describing the factorized scattering of solitons. The dynamics…
We investigate dynamical many-body systems capable of universal computation, which leads to their properties being unpredictable unless the dynamics is simulated from the beginning to the end. Unpredictable behavior can be quantitatively…
A set of action-angle variables for a soliton cellular automaton is obtained. It is identified with the rigged configuration, a well-known object in Bethe ansatz. Regarding it as the set of scattering data an inverse scattering method to…
Motivated by recent progress in the experimental development of quantum simulators based on Rydberg atoms, we introduce and investigate the dynamics of a class of $(1+1)$-dimensional quantum cellular automata. These non-equilibrium…
Building on the seminal work of Gromov on endomorphisms of symbolic algebraic varieties [10], we introduce a notion of cellular automata over schemes which generalize affine algebraic cellular automata in [7]. We extend known results to…
The one-dimensional dynamics of identical discrete elements that combine the properties of newtonian mechanical particles and cellular automata are investigated. It is shown that the motion of a cluster of combined discrete elements, which…
A class of one dimensional classical systems is characterized from an algebraic point of view. The Hamiltonians of these systems are factorized in terms of two functions that together with the Hamiltonian itself close a Poisson algebra.…
A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, in this paper we begin an investigation of exactly unitary cellular automata. After proving that there can be…
Cellular automata are fully-discrete, spatially-extended dynamical systems that evolve by simultaneously applying a local update function. Despite their simplicity, the induced global dynamic produces a stunning array of richly-structured,…
We introduce and study cellular automata whose cell spaces are left-homogeneous spaces. Examples of left-homogeneous spaces are spheres, Euclidean spaces, as well as hyperbolic spaces acted on by isometries; uniform tilings acted on by…
Let L:= Z^D be the D-dimensional lattice and let A^L be the Cantor space of L-indexed configurations in some finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F of A^L,…
We present a new classification of elementary cellular automata. It is based on the structure of the network of states, connected with the transitions between them; the latter are determined by the automaton rule. Recently an algorithm has…
We study sources of isomorphisms of additive cellular automata on finite groups (called index-group). It is shown that many isomorphisms (called regular) of automata are reducible to the isomorphisms of underlying algebraic structures (such…
In cellular automata with memory, the unchanged maps of the conventional cellular automata are applied to cells endowed with memory of their past states in some specified interval. We implement Rule 30 automata with a majority memory and…
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…
A number-conserving cellular automaton is a simplified model for a system of interacting particles. This paper contains two related constructions by which one can find all one-dimensional number-conserving cellular automata with one kind of…
We consider quantum cellular automata for one-dimensional chains of Fermionic modes and study their implementability as finite depth quantum circuits. Fermionic automata have been classified in terms of an index modulo circuits and the…