5,288 research outputs found
On the structure of Clifford quantum cellular automata
We study reversible quantum cellular automata with the restriction that these
are also Clifford operations. This means that tensor products of Pauli
operators (or discrete Weyl operators) are mapped to tensor products of Pauli
operators. Therefore Clifford quantum cellular automata are induced by
symplectic cellular automata in phase space. We characterize these symplectic
cellular automata and find that all possible local rules must be, up to some
global shift, reflection invariant with respect to the origin. In the one
dimensional case we also find that every uniquely determined and
translationally invariant stabilizer state can be prepared from a product state
by a single Clifford cellular automaton timestep, thereby characterizing these
class of stabilizer states, and we show that all 1D Clifford quantum cellular
automata are generated by a few elementary operations. We also show that the
correspondence between translationally invariant stabilizer states and
translationally invariant Clifford operations holds for periodic boundary
conditions.Comment: 28 pages, 2 figures, LaTe
Cellular automaton supercolliders
Gliders in one-dimensional cellular automata are compact groups of
non-quiescent and non-ether patterns (ether represents a periodic background)
translating along automaton lattice. They are cellular-automaton analogous of
localizations or quasi-local collective excitations travelling in a spatially
extended non-linear medium. They can be considered as binary strings or symbols
travelling along a one-dimensional ring, interacting with each other and
changing their states, or symbolic values, as a result of interactions. We
analyse what types of interaction occur between gliders travelling on a
cellular automaton `cyclotron' and build a catalog of the most common
reactions. We demonstrate that collisions between gliders emulate the basic
types of interaction that occur between localizations in non-linear media:
fusion, elastic collision, and soliton-like collision. Computational outcomes
of a swarm of gliders circling on a one-dimensional torus are analysed via
implementation of cyclic tag systems
Boolean Delay Equations: A simple way of looking at complex systems
Boolean Delay Equations (BDEs) are semi-discrete dynamical models with
Boolean-valued variables that evolve in continuous time. Systems of BDEs can be
classified into conservative or dissipative, in a manner that parallels the
classification of ordinary or partial differential equations. Solutions to
certain conservative BDEs exhibit growth of complexity in time. They represent
therewith metaphors for biological evolution or human history. Dissipative BDEs
are structurally stable and exhibit multiple equilibria and limit cycles, as
well as more complex, fractal solution sets, such as Devil's staircases and
``fractal sunbursts``. All known solutions of dissipative BDEs have stationary
variance. BDE systems of this type, both free and forced, have been used as
highly idealized models of climate change on interannual, interdecadal and
paleoclimatic time scales. BDEs are also being used as flexible, highly
efficient models of colliding cascades in earthquake modeling and prediction,
as well as in genetics. In this paper we review the theory of systems of BDEs
and illustrate their applications to climatic and solid earth problems. The
former have used small systems of BDEs, while the latter have used large
networks of BDEs. We moreover introduce BDEs with an infinite number of
variables distributed in space (``partial BDEs``) and discuss connections with
other types of dynamical systems, including cellular automata and Boolean
networks. This research-and-review paper concludes with a set of open
questions.Comment: Latex, 67 pages with 15 eps figures. Revised version, in particular
the discussion on partial BDEs is updated and enlarge
- …