This article surveys some theoretical aspects of cellular automata CA research. In particular,
we discuss classical and new results on reversibility, conservation laws, limit sets …

MIT Laboratory for Computer Science, Cambridge, MA 02139, USA 1.1. Preliminaries puter).
Invertible cellular automata (ICA) are Page 1 Physica D 45 (1990) 229-253 North-Holland …

Experimentally, secure quantum key distribution has been tested, using polarization or
phase of photons, for distance of 150 (200) km using standard optical fibres and for the …

A natural architecture for nanoscale quantum computation is that of a quantum cellular
automaton. Motivated by this observation, we begin an investigation of exactly unitary …

Cellular automata (CAs) are dynamical systems which exhibit complex global behavior from
simple local interaction and computation. Since the inception of cellular automaton (CA) by …

Since Richard Feynman introduced the notion of quantum computation in 1982, various
models of" quantum computers" have been proposed (R. Feynman, 1992). These models …

The principle of local activity is precisely the missing concept to explain the emergence of
complex patterns in a homogeneous medium. Leon O. Chua discovered and defined this …

Reversible computing is a paradigm where computing models are defined so that they
reflect physical reversibility, one of the fundamental microscopic physical property of Nature …

A cellular automaton is a dynamical system on an infinite array of cells defined by a local
update rule that is applied simultaneously at all cells. By carefully choosing the update rule …

Reversible computation allows computation to proceed not only in the standard, forward
direction, but also backward, recovering past states. While reversible computation has …