When is a quantum cellular automaton (QCA) a quantum lattice gas automaton (QLGA)?
From MaRDI portal
Publication:5409667
DOI10.1063/1.4821640zbMATH Open1288.81028arXiv1209.5367OpenAlexW2090397268MaRDI QIDQ5409667FDOQ5409667
Authors: Asif Shakeel, Peter J. Love 
Publication date: 14 April 2014
Published in: Journal of Mathematical Physics (Search for Journal in Brave)
Abstract: 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 Quantum Cellular Automata (QCA) (finitely many active cells in a quiescent background) to be Quantum Lattice Gas Automata (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.
Full work available at URL: https://arxiv.org/abs/1209.5367
Recommendations
- From quantum cellular automata to quantum lattice gases
- Intrinsically universal \(n\)-dimensional quantum cellular automata
- Quantum mechanics of lattice gas automata: boundary conditions and other inhomogeneities
- One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
- Partitioned quantum cellular automata are intrinsically universal
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lie groups. An approach through invariants and representations
- Simulating quantum mechanics on a quantum computer.
- Universal Quantum Simulators
- Simulating quantum systems on a quantum computer
- Cellular automaton fluids. I: Basic theory
- From quantum cellular automata to quantum lattice gases
- Symmetry, Representations, and Invariants
- Title not available (Why is that?)
- Title not available (Why is that?)
- A soluble relativistic field theory
- Title not available (Why is that?)
- On the absence of homogeneous scalar unitary cellular automata.
- An example of the difference between quantum and classical random walks
- Lattice Boltzmann equation for quantum mechanics
- Unitarity plus causality implies localizability
- Lattice-Gas Cellular Automata
- Title not available (Why is that?)
- Symmetric Hilbert spaces and related topics. Infinitely divisible positive definite functions, continuous products and tensor products, Gaussian and Poissonian stochastic processes
- Title not available (Why is that?)
- When-and how-can a cellular automaton be rewritten as a lattice gas?
- Locality and information transfer in quantum operations
- One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
- Quantum mechanics of lattice gas automata: boundary conditions and other inhomogeneities
- A decision procedure for well-formed linear quantum cellular automata
- Algebraic Characterizations of Unitary Linear Quantum Cellular Automata
- A three-dimensional lattice-gas model for amphiphilic fluid dynamics
- Title not available (Why is that?)
- Title not available (Why is that?)
- The challenge of quantum computer simulations of physical phenomena
- From gauge transformations to topology computation in quantum lattice gas automata
- An exact energy conservation property of the quantum lattice Boltzmann algorithm
- Convergence of a three-dimensional quantum lattice Boltzmann scheme towards solutions of the Dirac equation
- Title not available (Why is that?)
- A decision procedure for unitary linear quantum cellular automata
Cited In (10)
- From gauge transformations to topology computation in quantum lattice gas automata
- One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
- An overview of quantum cellular automata
- History dependent quantum random walks as quantum lattice gas automata
- Gaussian quantum cellular automata
- The quantum cellular automaton as a Markov process
- Efficient and scalable quantum walk algorithms via the quantum Fourier transform
- Quantum cellular automaton in 1-\(D\)
- Quantum-to-classical transition via quantum cellular automata
- Classification of quantum cellular automata
This page was built for publication: When is a quantum cellular automaton (QCA) a quantum lattice gas automaton (QLGA)?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5409667)
