The evolution of a quantum lattice gas automaton (QLGA) for a single charged particle is invariant under multiplication of the wave function by a global phase. Requiring invariance under the corresponding local gauge transformations determines the rule for minimal coupling to an arbitrary external electromagnetic field. We develop the Aharonov–Bohm effect in the resulting model into a constant time algorithm to distinguish a one-dimensional periodic lattice from one with boundaries; any classical deterministic lattice gas automaton (LGA) algorithm distinguishing these two spatial topologies would have expected running time on the order of the cardinality of the lattice.
The evolution of a quantum lattice gas automaton (QLGA) for a single charged particle is invariant under multiplication of the wave function by a global phase. Requiring invariance under the corresponding local gauge transformations determines the rule for minimal coupling to an arbitrary external electromagnetic field. We develop the Aharonov–Bohm effect in the resulting model into a constant time algorithm to distinguish a one-dimensional periodic lattice from one with boundaries; any classical deterministic lattice gas automaton (LGA) algorithm distinguishing these two spatial topologies would have expected running time on the order of the cardinality of the lattice.
We continue our analysis of the physics of quantum lattice gas automata (QLGA). Previous work has been restricted to periodic or infinite lattices; simulation of more realistic physical situations requires finite sizes and nonperiodic boundary conditions. Furthermore, envisioning a QLGA as a nanoscale computer architecture motivates consideration of inhomogeneities in the `substrate'; this translates into inhomogeneities in the local evolution rules. Concentrating on the one-particle sector of the model, we determine the various boundary conditions and rule inhomogeneities which are consistent with unitary global evolution. We analyse the reflection of plane waves from boundaries, simulate wavepacket refraction across inhomogeneities, and conclude by discussing the extension of these results to multiple particles.
The quantum lattice-gas automata (QLGA) have been studied to simulate the time-dependent Schrodinger equation. It is particularly well suited to implementation on a quantum computer; the many-body quantum system can be simulated very efficiently. On the other hand, its emulation on a classical computer would also have an advantage, because its unitarity might lead better behavior than standard finite-difference methods. In this study, we apply the QLGA method to the analysis of the one-particle quantum wave propagation in nanoscale devices. To this end, we develop a new algorithm to implement the open boundary condition into the QLGA method. In the QLGA simulation, the space is discretized and qubits are assigned to each node of the lattice. The each qubit contains the probability amplitude of whether the lattice node is occupied or not by the simulated particles. We have assigned the qubit array outside the simulation region to store the information about the particles which have flown out across the boundary. Then it becomes possible to simulate the open systems with the QLGA simulation.
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.
A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, in this paper we begin an investigation of exactly unitary cellular automata. After proving that there can be no nontrivial, homogeneous, local, unitary, scalar cellular automaton in one dimension, we weaken the homogeneity condition and show that there are nontrivial, exactly unitary, partitioning cellular automata. We find a one parameter family of evolution rules which are best interpreted as those for a one particle quantum automaton. This model is naturally reformulated as a two component cellular automaton which we demonstrate to limit to the Dirac equation. We describe two generalizations of this automaton, the second of which, to multiple interacting particles, is the correct definition of a quantum lattice gas. KEY WORDS: quantum cellular automaton; quantum lattice gas; quantum computation. to appear in J. Stat. Phys.
Gauge invariance is one of the more important concepts in physics. We discuss this concept in connection with the unitary evolution of discrete-time quantum walks in one and two spatial dimensions, when they include the interaction with synthetic, external electromagnetic fields. One introduces this interaction as additional phases that play the role of gauge fields. Here, we present a way to incorporate those phases, which differs from previous works. Our proposal allows the discrete derivatives, that appear under a gauge transformation, to treat time and space on the same footing, in a way which is similar to standard lattice gauge theories. By considering two steps of the evolution, we define a density current which is gauge invariant and conserved. In the continuum limit, the dynamics of the particle, under a suitable choice of the parameters, becomes the Dirac equation and the conserved current satisfies the corresponding conservation equation.