3,340 research outputs found
Quantum mechanics of lattice gas automata. I. One particle plane waves and potentials
Classical lattice gas automata effectively simulate physical processes such
as diffusion and fluid flow (in certain parameter regimes) despite their
simplicity at the microscale. Motivated by current interest in quantum
computation we recently defined quantum lattice gas automata; in this paper we
initiate a project to analyze which physical processes these models can
effectively simulate. Studying the single particle sector of a one dimensional
quantum lattice gas we find discrete analogues of plane waves and wave packets,
and then investigate their behaviour in the presence of inhomogeneous
potentials.Comment: 19 pages, plain TeX, 14 PostScript figures included with epsf.tex
(ignore the under/overfull \vbox error messages), two additional large
figures available upon reques
Computing Aggregate Properties of Preimages for 2D Cellular Automata
Computing properties of the set of precursors of a given configuration is a
common problem underlying many important questions about cellular automata.
Unfortunately, such computations quickly become intractable in dimension
greater than one. This paper presents an algorithm --- incremental aggregation
--- that can compute aggregate properties of the set of precursors
exponentially faster than na{\"i}ve approaches. The incremental aggregation
algorithm is demonstrated on two problems from the two-dimensional binary Game
of Life cellular automaton: precursor count distributions and higher-order mean
field theory coefficients. In both cases, incremental aggregation allows us to
obtain new results that were previously beyond reach
Lattice Gas Automata for Reactive Systems
Reactive lattice gas automata provide a microscopic approachto the dynamics
of spatially-distributed reacting systems. After introducing the subject within
the wider framework of lattice gas automata (LGA) as a microscopic approach to
the phenomenology of macroscopic systems, we describe the reactive LGA in terms
of a simple physical picture to show how an automaton can be constructed to
capture the essentials of a reactive molecular dynamics scheme. The statistical
mechanical theory of the automaton is then developed for diffusive transport
and for reactive processes, and a general algorithm is presented for reactive
LGA. The method is illustrated by considering applications to bistable and
excitable media, oscillatory behavior in reactive systems, chemical chaos and
pattern formation triggered by Turing bifurcations. The reactive lattice gas
scheme is contrasted with related cellular automaton methods and the paper
concludes with a discussion of future perspectives.Comment: to appear in PHYSICS REPORTS, 81 revtex pages; uuencoded gziped
postscript file; figures available from [email protected] or
[email protected]
From Dirac to Diffusion: Decoherence in Quantum Lattice Gases
We describe a model for the interaction of the internal (spin) degree of
freedom of a quantum lattice-gas particle with an environmental bath. We impose
the constraints that the particle-bath interaction be fixed, while the state of
the bath is random, and that the effect of the particle-bath interaction be
parity invariant. The condition of parity invariance defines a subgroup of the
unitary group of actions on the spin degree of freedom and the bath. We derive
a general constraint on the Lie algebra of the unitary group which defines this
subgroup, and hence guarantees parity invariance of the particle-bath
interaction. We show that generalizing the quantum lattice gas in this way
produces a model having both classical and quantum discrete random walks as
different limits. We present preliminary simulation results illustrating the
intermediate behavior in the presence of weak quantum noise.Comment: To appear in QI
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
A Max-Plus Model of Asynchronous Cellular Automata
This paper presents a new framework for asynchrony. This has its origins in
our attempts to better harness the internal decision making process of cellular
automata (CA). Thus, we show that a max-plus algebraic model of asynchrony
arises naturally from the CA requirement that a cell receives the state of each
neighbour before updating. The significant result is the existence of a
bijective mapping between the asynchronous system and the synchronous system
classically used to update cellular automata. Consequently, although the CA
outputs look qualitatively different, when surveyed on "contours" of real time,
the asynchronous CA replicates the synchronous CA. Moreover, this type of
asynchrony is simple - it is characterised by the underlying network structure
of the cells, and long-term behaviour is deterministic and periodic due to the
linearity of max-plus algebra. The findings lead us to proffer max-plus algebra
as: (i) a more accurate and efficient underlying timing mechanism for models of
patterns seen in nature, and (ii) a foundation for promising extensions and
applications.Comment: in Complex Systems (Complex Systems Publications Inc), Volume 23,
Issue 4, 201
A New Class of Cellular Automata for Reaction-Diffusion Systems
We introduce a new class of cellular automata to model reaction-diffusion
systems in a quantitatively correct way. The construction of the CA from the
reaction-diffusion equation relies on a moving average procedure to implement
diffusion, and a probabilistic table-lookup for the reactive part. The
applicability of the new CA is demonstrated using the Ginzburg-Landau equation.Comment: 4 pages, RevTeX 3.0 , 3 Figures 214972 bytes tar, compressed,
uuencode
Quasichemical Models of Multicomponent Nonlinear Diffusion
Diffusion preserves the positivity of concentrations, therefore,
multicomponent diffusion should be nonlinear if there exist non-diagonal terms.
The vast variety of nonlinear multicomponent diffusion equations should be
ordered and special tools are needed to provide the systematic construction of
the nonlinear diffusion equations for multicomponent mixtures with significant
interaction between components. We develop an approach to nonlinear
multicomponent diffusion based on the idea of the reaction mechanism borrowed
from chemical kinetics.
Chemical kinetics gave rise to very seminal tools for the modeling of
processes. This is the stoichiometric algebra supplemented by the simple
kinetic law. The results of this invention are now applied in many areas of
science, from particle physics to sociology. In our work we extend the area of
applications onto nonlinear multicomponent diffusion.
We demonstrate, how the mechanism based approach to multicomponent diffusion
can be included into the general thermodynamic framework, and prove the
corresponding dissipation inequalities. To satisfy thermodynamic restrictions,
the kinetic law of an elementary process cannot have an arbitrary form. For the
general kinetic law (the generalized Mass Action Law), additional conditions
are proved. The cell--jump formalism gives an intuitively clear representation
of the elementary transport processes and, at the same time, produces kinetic
finite elements, a tool for numerical simulation.Comment: 81 pages, Bibliography 118 references, a review paper (v4: the final
published version
- …