History Dependent Quantum Random Walks as Quantum Lattice Gas Automata
arXiv:1405.0972 · doi:10.1063/1.4903977
Abstract
Quantum Random Walks (QRW) were first defined as one-particle sectors of Quantum Lattice Gas Automata (QLGA). Recently, they have been generalized to include history dependence, either on previous coin (internal, i.e., spin or velocity) states or on previous position states. These models have the goal of studying the transition to classicality, or more generally, changes in the performance of quantum walks in algorithmic applications. We show that several history dependent QRW can be identified as one-particle sectors of QLGA. This provides a unifying conceptual framework for these models in which the extra degrees of freedom required to store the history information arise naturally as geometrical degrees of freedom on the lattice.
arXiv comment18 pages, 3 figures
References in corpus (11)
- A Quantum Random Walk Search Algorithm
- Exponential algorithmic speedup by quantum walk
- From quantum cellular automata to quantum lattice gases
- Quantum Algorithms for Quantum Field Theories
- Universal computation by multi-particle quantum walk
- The quantum to classical transition for random walks
- Simulating quantum mechanics on a quantum computer
- Quantum walks with memory - goldfish, elephants and wise old men
- When is a Quantum Cellular Automaton (QCA) a Quantum Lattice Gas Automaton (QLGA)?
- Nonreversal and nonrepeating quantum walks
- Quantum Snake Walk on Graphs