Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2106.00696 · Journal of Physics A Mathematical and Theoretical

A Yang–Baxter integrable cellular automaton with a four site update rule

Balázs Pozsgay

Published Aug 16, 2021• 38 citations
arXivHTMLPDF

Abstract

Abstract We present a one dimensional reversible block cellular automaton, where the time evolution is dictated by a period 3 cycle of update rules. At each time step a subset of the cells is updated using a four site rule with two control bits and two action bits. The model displays rich dynamics. There are three types of stable particles, left movers, right movers and ‘frozen’ bound states that only move as an effect of scattering with the left and right movers. Multi-particle scattering in the system is factorized. We embed the model into the canonical framework of Yang–Baxter integrability by rigorously proving the existence of a commuting set of diagonal-to-diagonal transfer matrices. The construction involves a new type of Lax operator.

DOI
10.1088/1751-8121/ac1dbf

Related papers

On the integrability structure of the deformed rule-54 reversible cellular automaton

Chiara Paletta, Tomaž Prosen

We study quantum and stochastic deformations of the rule-54 reversible cellular automaton (RCA54) on a 1+1-dimensional spatiotemporal lattice, focusing on their integrability structures in two distinct settings. First, for the quantum deformation, which turns the model into an interaction-round-a-face brickwork quantum circuit (either on an infinite lattice or with periodic boundary conditions), we show that the shortest-range nontrivial conserved charge commuting with the discrete-time evolution operator has a density supported on six consecutive sites. By constructing the corresponding range-6 Lax operator, we prove that this charge belongs to an infinite tower of mutually commuting conserved charges generated by higher-order logarithmic derivatives of the transfer matrix. With the aid of an intertwining operator, we further prove that the transfer matrix commutes with the discrete-time evolution operator. Second, for the stochastic deformation, which renders the model into a Markov-chain circuit, we investigate open boundary conditions that couple the system at its edges to stochastic reservoirs. In this setting, we explicitly construct the non-equilibrium steady state (NESS) by means of a staggered patch matrix ansatz, a hybrid construction combining the previously used commutative patch-state ansatz for the undeformed RCA54 with the matrix-product ansatz. Finally, we propose a simple empirical criterion for detecting integrability or exact solvability in a given model setup, introducing the notion of digit complexity.

math-phCross-listedarXiv:2603.25424•Journal of Physics A Mathematical and Theoretical•Mar 27, 2026•3 citations

On Two Non-Ergodic Reversible Cellular Automata, One Classical, the Other Quantum

Tomaž Prosen

We propose and discuss two variants of kinetic particle models—cellular automata in 1 + 1 dimensions—that have some appeal due to their simplicity and intriguing properties, which could warrant further research and applications. The first model is a deterministic and reversible automaton describing two species of quasiparticles: stable massless matter particles moving with velocity ±1 and unstable standing (zero velocity) field particles. We discuss two distinct continuity equations for three conserved charges of the model. While the first two charges and the corresponding currents have support of three lattice sites and represent a lattice analogue of the conserved energy–momentum tensor, we find an additional conserved charge and current with support of nine sites, implying non-ergodic behaviour and potentially signalling integrability of the model with a highly nested R-matrix structure. The second model represents a quantum (or stochastic) deformation of a recently introduced and studied charged hardpoint lattice gas, where particles of different binary charge (±1) and binary velocity (±1) can nontrivially mix upon elastic collisional scattering. We show that while the unitary evolution rule of this model does not satisfy the full Yang–Baxter equation, it still satisfies an intriguing related identity which gives birth to an infinite set of local conserved operators, the so-called glider operators.

arXiv:2304.01130•Entropy•Apr 30, 2023•5 citations

Reversible quantum cellular automata

Benjamin W. Schumacher, Reinhard F. Werner

We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions this allows us to give an explicit characterization of all local rules generating such automata. The same local rules also generate the global time step for automata with periodic boundary conditions. Our main structure theorem asserts that any quantum cellular automaton is structurally reversible, i.e., that it can be obtained by applying two blockwise unitary operations in a generalized Margolus partitioning scheme. This implies that, in contrast to the classical case, the inverse of a nearest neighbor quantum cellular automaton is again a nearest neighbor automaton. We present several construction methods for quantum cellular automata, based on unitaries commuting with their translates, on the quantization of (arbitrary) reversible classical cellular automata, on quantum circuits, and on Clifford transformations with respect to a description of the single cells by finite Weyl systems. Moreover, we indicate how quantum random walks can be considered as special cases of cellular automata, namely by restricting a quantum lattice gas automaton with local particle number conservation to the single particle sector.

arXiv:quant-ph/0405174•May 28, 2004•239 citations

On two reversible cellular automata with two particle species

Katja Klobas, Tomaž Prosen

Abstract We introduce a pair of time-reversible models defined on the discrete space–time lattice with three states per site, specifically, a vacancy and a particle of two flavours (species). The local update rules reproduce the rule 54 reversible cellular automaton when only a single species of particles is present, and satisfy the requirements of flavour exchange ( C ), space-reversal ( P ), and time-reversal ( T ) symmetries. We find closed-form expressions for three local conserved charges and provide an explicit matrix product form of the grand canonical Gibbs states, which are identical for both models. For one of the models this family of Gibbs states seems to be a complete characterisation of equilibrium (i.e. space and time translation invariant) states, while for the other model we empirically find a sequence of local conserved charges, one for each support size larger than 2, hinting to its algebraic integrability. Finally, we numerically investigate the behaviour of spatio-temporal correlation functions of charge densities, and test the hydrodynamic prediction for the model with exactly three local charges. Surprisingly, the numerically observed ‘sound velocity’ does not match the hydrodynamic value. The deviations are either significant, or they decay extremely slowly with the simulation time, which leaves us with an open question for the mechanism of such a glassy behaviour in a deterministic locally interacting system.

arXiv:2109.01644•Journal of Physics A Mathematical and Theoretical•Nov 30, 2021•10 citations

Solutions of a Two-Particle Interacting Quantum Walk

Alessandro Bisio, Giacomo Mauro D’Ariano, Nicola Mosco +2 more

We study the solutions of an interacting Fermionic cellular automaton which is the analogue of the Thirring model with both space and time discrete. We present a derivation of the two-particle solutions of the automaton recently in the literature, which exploits the symmetries of the evolution operator. In the two-particle sector, the evolution operator is given by the sequence of two steps, the first one corresponding to a unitary interaction activated by two-particle excitation at the same site, and the second one to two independent one-dimensional Dirac quantum walks. The interaction step can be regarded as the discrete-time version of the interacting term of some Hamiltonian integrable system, such as the Hubbard or the Thirring model. The present automaton exhibits scattering solutions with nontrivial momentum transfer, jumping between different regions of the Brillouin zone that can be interpreted as Fermion-doubled particles, in stark contrast with the customary momentum-exchange of the one-dimensional Hamiltonian systems. A further difference compared to the Hamiltonian model is that there exist bound states for every value of the total momentum and of the coupling constant. Even in the special case of vanishing coupling, the walk manifests bound states, for finitely many isolated values of the total momentum. As a complement to the analytical derivations we show numerical simulations of the interacting evolution.

arXiv:1804.08508•Entropy•Jun 5, 2018•20 citations

The Cellular Automaton

Gerard ’t Hooft

A time-reversible cellular automaton can most easily be described by regarding its evolution law as a two-step process, for instance by first allowing the even sites to update, then the odd sites. The discrete Hamiltonian operator procedure of Chap. 19 may be used. Subsequently, we apply a perturbative algebra, starting from the Baker Campbell Hausdorff expansion. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Fundamental theories of physics•Jan 1, 2016•9 citations
Abstract We present a one dimensional reversible block cellular automaton, where the time evolution is dictated by a period 3 cycle of update rules. At each time step a subset of the cells is updated using a four site rule with two control bits and two action bits. The model displays rich dynamics. There are three types of stable particles, left movers, right movers and ‘frozen’ bound states that only move as an effect of scattering with the left and right movers. Multi-particle scattering in the system is factorized. We embed the model into the canonical framework of Yang–Baxter integrability by rigorously proving the existence of a commuting set of diagonal-to-diagonal transfer matrices. The construction involves a new type of Lax operator.
We study quantum and stochastic deformations of the rule-54 reversible cellular automaton (RCA54) on a 1+1-dimensional spatiotemporal lattice, focusing on their integrability structures in two distinct settings. First, for the quantum deformation, which turns the model into an interaction-round-a-face brickwork quantum circuit (either on an infinite lattice or with periodic boundary conditions), we show that the shortest-range nontrivial conserved charge commuting with the discrete-time evolution operator has a density supported on six consecutive sites. By constructing the corresponding range-6 Lax operator, we prove that this charge belongs to an infinite tower of mutually commuting conserved charges generated by higher-order logarithmic derivatives of the transfer matrix. With the aid of an intertwining operator, we further prove that the transfer matrix commutes with the discrete-time evolution operator. Second, for the stochastic deformation, which renders the model into a Markov-chain circuit, we investigate open boundary conditions that couple the system at its edges to stochastic reservoirs. In this setting, we explicitly construct the non-equilibrium steady state (NESS) by means of a staggered patch matrix ansatz, a hybrid construction combining the previously used commutative patch-state ansatz for the undeformed RCA54 with the matrix-product ansatz. Finally, we propose a simple empirical criterion for detecting integrability or exact solvability in a given model setup, introducing the notion of digit complexity.
We propose and discuss two variants of kinetic particle models—cellular automata in 1 + 1 dimensions—that have some appeal due to their simplicity and intriguing properties, which could warrant further research and applications. The first model is a deterministic and reversible automaton describing two species of quasiparticles: stable massless matter particles moving with velocity ±1 and unstable standing (zero velocity) field particles. We discuss two distinct continuity equations for three conserved charges of the model. While the first two charges and the corresponding currents have support of three lattice sites and represent a lattice analogue of the conserved energy–momentum tensor, we find an additional conserved charge and current with support of nine sites, implying non-ergodic behaviour and potentially signalling integrability of the model with a highly nested R-matrix structure. The second model represents a quantum (or stochastic) deformation of a recently introduced and studied charged hardpoint lattice gas, where particles of different binary charge (±1) and binary velocity (±1) can nontrivially mix upon elastic collisional scattering. We show that while the unitary evolution rule of this model does not satisfy the full Yang–Baxter equation, it still satisfies an intriguing related identity which gives birth to an infinite set of local conserved operators, the so-called glider operators.
We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions this allows us to give an explicit characterization of all local rules generating such automata. The same local rules also generate the global time step for automata with periodic boundary conditions. Our main structure theorem asserts that any quantum cellular automaton is structurally reversible, i.e., that it can be obtained by applying two blockwise unitary operations in a generalized Margolus partitioning scheme. This implies that, in contrast to the classical case, the inverse of a nearest neighbor quantum cellular automaton is again a nearest neighbor automaton. We present several construction methods for quantum cellular automata, based on unitaries commuting with their translates, on the quantization of (arbitrary) reversible classical cellular automata, on quantum circuits, and on Clifford transformations with respect to a description of the single cells by finite Weyl systems. Moreover, we indicate how quantum random walks can be considered as special cases of cellular automata, namely by restricting a quantum lattice gas automaton with local particle number conservation to the single particle sector.
Abstract We introduce a pair of time-reversible models defined on the discrete space–time lattice with three states per site, specifically, a vacancy and a particle of two flavours (species). The local update rules reproduce the rule 54 reversible cellular automaton when only a single species of particles is present, and satisfy the requirements of flavour exchange ( C ), space-reversal ( P ), and time-reversal ( T ) symmetries. We find closed-form expressions for three local conserved charges and provide an explicit matrix product form of the grand canonical Gibbs states, which are identical for both models. For one of the models this family of Gibbs states seems to be a complete characterisation of equilibrium (i.e. space and time translation invariant) states, while for the other model we empirically find a sequence of local conserved charges, one for each support size larger than 2, hinting to its algebraic integrability. Finally, we numerically investigate the behaviour of spatio-temporal correlation functions of charge densities, and test the hydrodynamic prediction for the model with exactly three local charges. Surprisingly, the numerically observed ‘sound velocity’ does not match the hydrodynamic value. The deviations are either significant, or they decay extremely slowly with the simulation time, which leaves us with an open question for the mechanism of such a glassy behaviour in a deterministic locally interacting system.
We study the solutions of an interacting Fermionic cellular automaton which is the analogue of the Thirring model with both space and time discrete. We present a derivation of the two-particle solutions of the automaton recently in the literature, which exploits the symmetries of the evolution operator. In the two-particle sector, the evolution operator is given by the sequence of two steps, the first one corresponding to a unitary interaction activated by two-particle excitation at the same site, and the second one to two independent one-dimensional Dirac quantum walks. The interaction step can be regarded as the discrete-time version of the interacting term of some Hamiltonian integrable system, such as the Hubbard or the Thirring model. The present automaton exhibits scattering solutions with nontrivial momentum transfer, jumping between different regions of the Brillouin zone that can be interpreted as Fermion-doubled particles, in stark contrast with the customary momentum-exchange of the one-dimensional Hamiltonian systems. A further difference compared to the Hamiltonian model is that there exist bound states for every value of the total momentum and of the coupling constant. Even in the special case of vanishing coupling, the walk manifests bound states, for finitely many isolated values of the total momentum. As a complement to the analytical derivations we show numerical simulations of the interacting evolution.
A time-reversible cellular automaton can most easily be described by regarding its evolution law as a two-step process, for instance by first allowing the even sites to update, then the odd sites. The discrete Hamiltonian operator procedure of Chap. 19 may be used. Subsequently, we apply a perturbative algebra, starting from the Baker Campbell Hausdorff expansion. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.