Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/9712052 · Journal of Physics A Mathematical and General

Quantum mechanics of lattice gas automata: boundary conditions and other inhomogeneities

David Meyer

Published Mar 13, 1998• 30 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/0305-4470/31/10/009

Related papers

Quantum lattice-gas automata simulation of electronic wave propagation in nanostructures

Sakai, Kamakura, Taniguchi

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.

•Jan 1, 2004•1 citation

Quantum mechanics of lattice gas automata: One-particle plane waves and potentials

David Meyer

Classical lattice gas automata effectively simulate physical processes, such as diffusion and fluid flow (in certain parameter regimes), despite their simplicity at the microscale. Motivated by current interest in quantum computation we recently defined quantum lattice gas automata; in this paper we initiate a project to analyze which physical processes these models can effectively simulate. Studying the single particle sector of a one-dimensional quantum lattice gas we find discrete analogs of plane waves and wave packets, and then investigate their behavior in the presence of inhomogeneous potentials.

arXiv:quant-ph/9611005•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•May 1, 1997•103 citations

From gauge transformations to topology computation in quantum lattice gas automata

David Meyer

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.

arXiv:quant-ph/0105087•Journal of Physics A Mathematical and General•Aug 24, 2001•10 citations

From Quantum Cellular Automata To Quantum Lattice Gases

David Meyer, From Qca, Qlga David +1 more

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.

•Apr 4, 1996•496 citations

Quantum Cellular Automata: Theory and Applications

Pérez Delgado, Carlos Alberto Conceição António

This thesis presents a model of Quantum Cellular Automata (QCA). The presented formalism is a natural quantization of the classical Cellular Automata (CA). It 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 model is to act as a theoretical model of quantum computation, similar to the quantum circuit model. The main advantage that QCA have over quantum circuits is that QCA make considerably fewer demands on the underlying hardware. In particular, as opposed to direct implementations of quantum circuits, the global evolution of the lattice in the QCA model does not assume independent control over individual \emph{qudits}. Rather, all qudits are to be addressed collectively in parallel. The QCA model is also shown to be an appropriate abstraction for space-homogeneous quantum phenomena, such as quantum lattice gases, spin chains and others. Some results that show the benefits of basing the model on local unitary operators are shown: computational universality, strong connections to the circuit model, simple implementation on quantum hardware, and a series of applications. A detailed discussion will be given on one particular application of QCA that lies outside either computation or simulation: single-spin measurement. This algorithm uses the techniques developed in this thesis to achieve a result normally considered hard in physics. It serves well as an example of why QCA are interesting in their own right.

•Sep 26, 2007•4 citations

Nonlocal computation in quantum cellular automata

Siegfried Fussy, Gerhard Grössing, Herbert Schwabl +1 more

Quantum cellular automata (QCA) have been introduced [G. Gr\"ossing and A. Zeilinger, Complex Syst. 2, 197 (1988); 2, 611 (1988)] as n-dimensional arrays of discrete sites characterized by a complex number whose absolute square lies between 0 and 1 such that each site represents a quantum-mechanical probability amplitude. The evolutions of one-dimensional QCA with a local (i.e., nearest-neighbor) interaction and with periodic boundary conditions have been studied in some detail. In this paper we present a thorough mathematical analysis of one-dimensional QCA, and we particularly emphasize the effects of what we term nonlocal computation: because of the conservation of the total probability for each time step, information of the global array spread out over generally nonlocal distances must be conveyed for each time step to each local site via the normalization procedure. With the aid of a mathematical description of QCA evolution the following, previously observed phenomena can be explained: (i) the asymptotic appearance of plane-wave patterns after a characteristic transient phase, (ii) the dependence of the period of the patterns on the input parameters for both small and large values of the couplings between the sites, and (iii) the role of the initial values of the cells. Finally, the effects of nonlocal computation are made visible with the simulation of a ``double-slit-like'' experiment on a QCA grid.

Physical Review A•Nov 1, 1993•24 citations
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.
Classical lattice gas automata effectively simulate physical processes, such as diffusion and fluid flow (in certain parameter regimes), despite their simplicity at the microscale. Motivated by current interest in quantum computation we recently defined quantum lattice gas automata; in this paper we initiate a project to analyze which physical processes these models can effectively simulate. Studying the single particle sector of a one-dimensional quantum lattice gas we find discrete analogs of plane waves and wave packets, and then investigate their behavior in the presence of inhomogeneous potentials.
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.
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.
This thesis presents a model of Quantum Cellular Automata (QCA). The presented formalism is a natural quantization of the classical Cellular Automata (CA). It 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 model is to act as a theoretical model of quantum computation, similar to the quantum circuit model. The main advantage that QCA have over quantum circuits is that QCA make considerably fewer demands on the underlying hardware. In particular, as opposed to direct implementations of quantum circuits, the global evolution of the lattice in the QCA model does not assume independent control over individual \emph{qudits}. Rather, all qudits are to be addressed collectively in parallel. The QCA model is also shown to be an appropriate abstraction for space-homogeneous quantum phenomena, such as quantum lattice gases, spin chains and others. Some results that show the benefits of basing the model on local unitary operators are shown: computational universality, strong connections to the circuit model, simple implementation on quantum hardware, and a series of applications. A detailed discussion will be given on one particular application of QCA that lies outside either computation or simulation: single-spin measurement. This algorithm uses the techniques developed in this thesis to achieve a result normally considered hard in physics. It serves well as an example of why QCA are interesting in their own right.
Quantum cellular automata (QCA) have been introduced [G. Gr\"ossing and A. Zeilinger, Complex Syst. 2, 197 (1988); 2, 611 (1988)] as n-dimensional arrays of discrete sites characterized by a complex number whose absolute square lies between 0 and 1 such that each site represents a quantum-mechanical probability amplitude. The evolutions of one-dimensional QCA with a local (i.e., nearest-neighbor) interaction and with periodic boundary conditions have been studied in some detail. In this paper we present a thorough mathematical analysis of one-dimensional QCA, and we particularly emphasize the effects of what we term nonlocal computation: because of the conservation of the total probability for each time step, information of the global array spread out over generally nonlocal distances must be conveyed for each time step to each local site via the normalization procedure. With the aid of a mathematical description of QCA evolution the following, previously observed phenomena can be explained: (i) the asymptotic appearance of plane-wave patterns after a characteristic transient phase, (ii) the dependence of the period of the patterns on the input parameters for both small and large values of the couplings between the sites, and (iii) the role of the initial values of the cells. Finally, the effects of nonlocal computation are made visible with the simulation of a ``double-slit-like'' experiment on a QCA grid.