We study a quantum cellular automaton (QCA) whose time evolution is defined using the global transition function of a classical cellular automaton (CA). In order to investigate natural transformations from CAs to QCAs, the present QCA includes the CA with Wolfram's rules 150 and 105 as special cases. We first compute the time evolution of the QCA and examine its statistical properties. As a basic statistical value, the probability of finding an active cell averaged over spatial-temporal space is introduced, and the difference between the CA and QCA is considered. In addition, it is shown that statistical properties in QCAs are related to the classical trajectory in configuration space.
We study a quantum cellular automaton (QCA) whose time evolution is defined using the global transition function of a classical cellular automaton (CA). In order to investigate natural transformations from CAs to QCAs, the present QCA includes the CA with Wolfram's rules 150 and 105 as special cases. We first compute the time evolution of the QCA and examine its statistical properties. As a basic statistical value, the probability of finding an active cell averaged over spatial-temporal space is introduced, and the difference between the CA and QCA is considered. In addition, it is shown that statistical properties in QCAs are related to the classical trajectory in configuration space.
A quantum cellular automaton (QCA) is a unitary discrete-time evolution of a quantum many-body system, which can be described as a dynamics system , where A is any matrix and is a unitary operator representing the global evolution of QCA. And QCAs are characterized by locality (or causality). Among them, quantum circuits are the special classes of QCAs, which use unitary operators to control and transform the initial quantum state of qubit into a final quantum state, quantum circuits are special and widely studied in quantum information. A group is a set of elements combined with an operation, which satisfies associativity, identity and invertibility. This article shows that group theory provides the right language for studying the relation between QCAs and quantum circuits among them.
We propose that a quantum particle in a potential in one space dimension can be described by a probabilistic cellular automaton. While the simple updating rule of the automaton is deterministic, the probabilistic description is introduced by a probability distribution over initial conditions. The proposed automaton involves right- and left-movers, jumping from one cell to a neighboring one. They change their direction of motion at each randomly distributed disorder or scattering point. The continuum limit of an infinite number of cells yields a Dirac equation, and in the non-relativistic limit the familiar Schrödinger equation, with potential determined by the spacetime-distribution of scattering points. These equations describe the time evolution of the probabilistic information for the position of the particle. All quantum rules for observables, both for discrete possible measurement values and continuous expectation values, follow from the classical statistical laws.
A quantum cellular automaton, which is extended from a classical cellular automaton with Wolfram's rule 150, is studied. In contrast to the classical cellular automaton, all possible configurations exist in a quantum superposition before measurement. We show that measuring the state of only one qubit significantly aeffects the time evolution in the quantum cellular automaton. In particular, we demonstrate that, occasionally, repeating the measurement enhances the appearance of the configurations found in the classical cellular automaton. The occurrence of this enhancement is primarily determined by the results of the measurement in the early time steps, and it is sustained by a feedback mechanism.
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the r esult could actually make sense physically, as a valid quantum evolution; but do es it make sense as a quantum cellular automaton? That is the main question we a ddress in this paper. In every model with discrete time and space, two things ar e required in order to qualify as a cellular automaton: invariance by translatio n and locality. We prove that this locality condition is so restrictive in the q uantum case that every quantum cellular automaton constructed in this way - i. e., by linearization of a classical one - must be reversible. We also discuss some subtleties about the extent of nonlocality that can be encountered in the o ne-dimensional case; we show that, even when the quantized version is non local, still, under some conditions, we may be unable to use this nonlocality to trans mit information nonlocally.
We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions this allows us to give an explicit characterization of all local rules generating such automata. The same local rules also generate the global time step for automata with periodic boundary conditions. Our main structure theorem asserts that any quantum cellular automaton is structurally reversible, i.e., that it can be obtained by applying two blockwise unitary operations in a generalized Margolus partitioning scheme. This implies that, in contrast to the classical case, the inverse of a nearest neighbor quantum cellular automaton is again a nearest neighbor automaton. We present several construction methods for quantum cellular automata, based on unitaries commuting with their translates, on the quantization of (arbitrary) reversible classical cellular automata, on quantum circuits, and on Clifford transformations with respect to a description of the single cells by finite Weyl systems. Moreover, we indicate how quantum random walks can be considered as special cases of cellular automata, namely by restricting a quantum lattice gas automaton with local particle number conservation to the single particle sector.
Quantum cellular automata (QCA) are models of quantum computation of particular interest from the point of view of quantum simulation. Quantum lattice gas automata (QLGA - equivalently partitioned quantum cellular automata) represent an interesting subclass of QCA. QLGA have been more deeply analyzed than QCA, whereas general QCA are likely to capture a wider range of quantum behavior. Discriminating between QLGA and QCA is therefore an important question. In spite of much prior work, classifying which QCA are QLGA has remained an open problem. In the present paper we establish necessary and sufficient conditions for unbounded, finite QCA (finitely many active cells in a quiescent background) to be QLGA. We define a local condition that classifies those QCA that are QLGA, and we show that there are QCA that are not QLGA. We use a number of tools from functional analysis of separable Hilbert spaces and representation theory of associative algebras that enable us to treat QCA on finite but unbounded configurations in full detail.