English
Related papers

Related papers: Cellular automaton for spinor gravity in four dime…

200 papers

A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e.…

Discrete Mathematics · Computer Science 2011-08-25 Pierre Guillon , Gaétan Richard

A simple mechanism for the emergence of complexity in cellular automata out of predictable dynamics is described. This leads to unfold the concept of conditional predictability for systems whose trajectory can only be piecewise known. The…

Cellular Automata and Lattice Gases · Physics 2015-06-17 Vladimir Garcia-Morales

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…

Quantum Physics · Physics 2009-10-30 David A. Meyer

We provide algebraic criteria for the unitarity of linear quantum cellular automata, i.e. one dimensional quantum cellular automata. We derive these both by direct combinatorial arguments, and by adding constraints into the model which do…

Quantum Physics · Physics 2017-08-29 Pablo Arrighi

We study locally interacting processes in discrete time, often called probabilistic cellular automata, indexed by locally finite graphs. For infinite regular trees and certain generalized Galton-Watson trees, we show that the marginal…

Probability · Mathematics 2025-10-28 Daniel Lacker , Kavita Ramanan , Ruoyu Wu

We propose a model of an electrically charged fermion as a regular localized solution of electromagnetic and spinor fields interacting with a physical vacuum, which is phenomenologically described as a logarithmic superfluid. We…

High Energy Physics - Theory · Physics 2018-07-09 Vladimir Dzhunushaliev , Arislan Makhmudov , Konstantin G. Zloshchastiev

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,…

Dynamical Systems · Mathematics 2009-09-29 Marcus Pivato

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…

Quantum Physics · Physics 2007-05-23 B. Schumacher , R. F. Werner

Let L:=Z^D be a D-dimensional lattice. Let A^L be the Cantor space of L-indexed configurations in a finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F:A^L-->A^L. An…

Dynamical Systems · Mathematics 2009-09-29 Marcus Pivato

In constrast to discretized space-time approximations to continuum quantum field theories, discretized velocity space approximations to continuum quantum field theories are investigated. A four-momentum operator is given in terms of bare…

Nuclear Theory · Physics 2008-01-29 W. H. Klink

Quantum walks on lattices can give rise to one-particle relativistic wave equations in the long-wavelength limit. In going to multiple particles, quantum cellular automata (QCA) are natural generalizations of quantum walks. In one spatial…

Quantum Physics · Physics 2021-01-04 Todd A. Brun , Leonard Mlodinow

We extend Cellular Automata to time-varying discrete geometries. In other words we formalize, and prove theorems about, the intuitive idea of a discrete manifold which evolves in time, subject to two natural constraints: the evolution does…

Discrete Mathematics · Computer Science 2018-07-17 Pablo Arrighi , Clément Chouteau , Stefano Facchini , Simon Martiel

Quantum Cellular Automaton (QCA) is a model for universal quantum computation and a natural candidate for digital quantum simulation of relativistic quantum fields. Here we introduce the first photonic platform for implementing…

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…

Quantum Physics · Physics 2019-09-09 Pablo Arrighi

In this paper, we consider fermionic systems in discrete spacetime evolving with a strict notion of causality, meaning they evolve unitarily and with a bounded propagation speed. First, we show that the evolution of these systems has a…

Quantum Physics · Physics 2014-01-08 Terence C. Farrelly , Anthony J. Short

A quantum cellular automaton (QCA) is an abstract model consisting of an array of finite-dimensional quantum systems that evolves in discrete time by local unitary operations. Here we propose a simple coarse-graining map, where the spatial…

Quantum Physics · Physics 2021-08-03 Pedro C. S. Costa

We study the solutions of the interacting Fermionic cellular automaton introduced in Ref. [Phys Rev A 97, 032132 (2018)]. The automaton is the analogue of the Thirring model with both space and time discrete. We present a derivation of the…

A free quantum field theory with Lorentz symmetry is derived for spin-half symplectic fermions in 2+1 dimensions. In particular, we show that fermionic spin-half fields may be canonically quantized in a free theory with a Klein-Gordon…

High Energy Physics - Theory · Physics 2010-01-07 Dean J. Robinson , Eliot Kapit , Andre LeClair

In this paper we consider an axial torsion to build metric-compatible connections in conformal gravity, with gauge potentials; the geometric background is filled with Dirac spinors: scalar fields with suitable potentials are added…

General Relativity and Quantum Cosmology · Physics 2014-03-12 Luca Fabbri

Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…

Formal Languages and Automata Theory · Computer Science 2014-02-18 Alex Borello , Julien Cervelle , Pascal Vanier