Related papers: Quantum Cellular Automata from Lattice Field Theor…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…
In this paper we present a quantization of Cellular Automata. Our formalism is based on a lattice of qudits, and an update rule consisting of local unitary operators that commute with their own lattice translations. One purpose of this…
A class of fermionic quantum field theories with interactions is shown to be equivalent to probabilistic cellular automata, namely cellular automata with a probability distribution for the initial states. Probabilistic cellular automata on…
We consider quantum cellular automata for one-dimensional chains of Fermionic modes and study their implementability as finite depth quantum circuits. Fermionic automata have been classified in terms of an index modulo circuits and the…
Over an arbitrary commutative ring $R$, we develop a theory of quantum cellular automata. We then use algebraic K-theory to construct a space $\mathbf{Q}(X)$ of quantum cellular automata (QCA) on a given metric space $X$. In most cases of…
We classify quantum cellular automata whose cells are qubits, on hypercubic lattices $\mathbb Z^s$, with the von Neumann neighborhood scheme, in terms of realizability as finite-depth quantum circuits. We show the most general structure of…
A classical local cellular automaton can describe an interacting quantum field theory for fermions. We construct a simple classical automaton for a particular version of the Thirring model with imaginary coupling. This interacting fermionic…
There exists an index theory to classify strictly local quantum cellular automata in one dimension. We consider two classification questions. First, we study to what extent this index theory can be applied in higher dimensions via…
Ideas presented in two earlier papers are applied to string theory. It had been found that a deterministic cellular automaton in one space- and one time dimension can be mapped onto a bosonic quantum field theory on a 1+1 dimensional…
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…
Quantum walks on lattices can give rise to relativistic wave equations in the long-wavelength limit, but going beyond the single-particle case has proven challenging, especially in more than one spatial dimension. We construct quantum…
Discretizing spacetime is often a natural step towards modelling physical systems. For quantum systems, if we also demand a strict bound on the speed of information propagation, we get quantum cellular automata (QCAs). These originally…
Quantum computing is concerned with computer technology based on the principles of quantum mechanics, with operations performed at the quantum level. Quantum computational models make it possible to analyze the resources required for…
Models of areas of physics in terms of cellular automata have become increasingly popular. Cellular automata (CAs) support the modeling of systems with discrete state component values and enforce the comprehensive specification of the…
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…
Certain fermionic quantum field theories are equivalent to probabilistic cellular automata, with fermionic occupation numbers associated to bits. We construct an automaton that represents a discrete model of spinor gravity in four…
In this paper we present a systematic view of Quantum Cellular Automata (QCA), a mathematical formalism of quantum computation. First we give a general mathematical framework with which to study QCA models. Then we present four different…
In recent work [quant-ph/0405174] by Schumacher and Werner was discussed an abstract algebraic approach to a model of reversible quantum cellular automata (CA) on a lattice. It was used special model of CA based on partitioning scheme and…
A method of quantization of classical soliton cellular automata (QSCA) is put forward that provides a description of their time evolution operator by means of quantum circuits that involve quantum gates from which the associated Hamiltonian…
Quantum cellular automata (QCA) constitute space and time homogeneous discrete models for quantum field theories (QFTs). Although QFTs are defined without reference to particles, computations are done in terms of Feynman diagrams, which are…