Related papers: From quantum cellular automata to quantum lattice …
This research describes a three dimensional quantum cellular automaton (QCA) which can simulate all other 3D QCA. This intrinsically universal QCA belongs to the simplest subclass of QCA: Partitioned QCA (PQCA). PQCA are QCA of a particular…
Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in…
Methods developed in a previous paper are employed to define an exact correspondence between the states of a deterministic cellular automaton in 1+1 dimensions and those of a bosonic quantum field theory. The result may be used to argue…
We study a two-dimensional semi-totalistic binary cell-state cellular automaton, which imitates a reversible precipitation in an abstract chemical medium. The systems exhibits a non-trivial growth and nucleation. We demonstrate how basic…
We introduce a quantum cellular automaton that achieves approximate phase-covariant cloning of qubits. The automaton is optimized for 1-to-2N economical cloning. The use of the automaton for cloning allows us to exploit different foliations…
Lattice gas algorithms (LGA) are a class of algorithms including, in chronological order, binary lattice gas cellular automata (LGCA), integer lattice gas algorithms (ILGA) and lattice Boltzmann method (LBM). They are largely used for…
Recent developments in quantum computing suggest that it could be possible to make conditional changes to the state of a quantum mechanical system without resorting to classical observation. It is accomplished through collective response of…
The properties of two-state nearest-neighbour cellular automata (CA) that are capable of density classification are discussed. It is shown that these CA actually conserve the total density, rather than merely classifying it. This is also…
The information flow in a quantum system is a fundamental feature of its dynamics. An important class of dynamics are quantum cellular automata (QCA), systems with discrete updates invariant in time and space, for which an index theory has…
Presented are several example quantum computing representations of quantum systems with a relativistic energy relation. Basic unitary representations of free Dirac particles and BCS superconductivity are given. Then, these are combined into…
Quantum groups lead to an algebraic structure that can be realized on quantum spaces. These are noncommutative spaces that inherit a well defined mathematical structure from the quantum group symmetry. In turn such quantum spaces can be…
A minimalistic model for chimera states is presented. The model is a cellular automaton (CA) which depends on only one adjustable parameter, the range of the nonlocal coupling, and is built from elementary cellular automata and the majority…
Nielsen, et al. [1, 2] proposed a view of quantum computation where determining optimal algorithms is equivalent to extremizing a geodesic length or cost functional. This view of optimization is highly suggestive of an action principle of…
Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…
The complexity of cellular automata is traditionally measured by their computational capacity. However, it is difficult to choose a challenging set of computational tasks suitable for the parallel nature of such systems. We study the…
A deterministic reformulation of quantum mechanics can bypass the usual philosophical interpretations of probability and stochasticity that are found in the literature. This can be obtained with the ontological formulation of quantum…
A formalism is presented in which quantum particle dynamics can be developed on its own rather than `quantization' of an underlying classical theory. It is proposed that the unification of probability and dynamics should be considered as…
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 von Neumann in 1950s, it has attracted the attention of…
In a series of recent papers it has been shown how free quantum field theory can be derived without using mechanical primitives (including space-time, special relativity, quantization rules, etc.), but only considering the easiest quantum…
We present an economical dynamical control scheme to perform quantum computation on a one dimensional optical lattice, where each atom encodes one qubit. The model is based on atom tunneling transitions between neighboring sites of the…