History dependent quantum random walks as quantum lattice gas automata

  title={History dependent quantum random walks as quantum lattice gas automata},
  author={Asif Shakeel and David A. Meyer and Peter J. Love},
  journal={Journal of Mathematical Physics},
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… 

Figures from this paper

Neighborhood-history quantum walk

History dependent discrete time quantum walks (QWs) are often studied for their lattice traversal properties. A particular model in the literature uses the state of a memory qubit at each site to

Quantum control using quantum memory

A new quantum numerical scheme to control the dynamics of a quantum walker in a two dimensional space–time grid is proposed, and analytically how to encode in the initial state any arbitrary walker’s mean trajectory and variance is proved.

Control dynamics using quantum memory

A new quantum numerical scheme to control the dynamics of a quantum walker in a two dimensional space-time grid is proposed, and analytically how to encode in the initial state any arbitrary walker's mean trajectory and variance is proved.

Collider events on a quantum computer

This paper presents a novel approach to synthesising parton showers using the Discrete QCD method and uses the ibm_algiers device to sample parton shower configurations and generate data that is compared against measurements taken at the ALEPH, DELPHI and OPAL experiments.

A Complete Bibliography of Publications in the Journal of Mathematical Physics: 2005{2009

(2 < p < 4) [200]. (Uq(∫u(1, 1)), oq1/2(2n)) [92]. 1 [273, 79, 304, 119]. 1 + 1 [252]. 2 [352, 318, 226, 40, 233, 157, 299, 60]. 2× 2 [185]. 3 [456, 363, 58, 18, 351]. ∗ [238]. 2 [277]. 3 [350]. p



Quantum walks driven by many coins

Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum

Universal Computation by Multiparticle Quantum Walk

The construction of a scalable quantum computer architecture based on multiple interacting quantum walkers could, in principle, be used as an architecture for building a scaled quantum computer with no need for time-dependent control.

Quantum to classical transition for random walks.

The position variance is used as an indicator of classical behavior and it is seen that the multicoin walk retains the "quantum" quadratic growth of the variance except in the limit of a new coin for every step, while the walk with decoherence exhibits "classical" linear growth ofThe variance even for weakDecoherence.

Quantum random-walk search algorithm

It will be shown that this algorithm performs an oracle search on a database of N items with $O(\sqrt{N})$ calls to the oracle, yielding a speedup similar to other quantum search algorithms.

From quantum cellular automata to quantum lattice gases

A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, we begin an investigation of exactly unitary cellular automata. After

Self-avoiding quantum walks

Quantum walks exhibit many unique characteristics compared to classical random walks. In the classical setting, self-avoiding random walks have been studied as a variation on the usual classical

Quantum walks with tuneable self-avoidance in one dimension

A quantum walk in one dimension with tunable levels of self-avoidance is complemented with a memory register that records where the walker has previously resided and can be made to reproduce ideal quantum or classical random walk statistics, or a plethora of more elaborate diffusive phenomena.

One-dimensional quantum walks

A quantum analog of the symmetric random walk, which the authors call the Hadamard walk, is analyzed, which has position that is nearly uniformly distributed in the range after steps, in sharp contrast to the classical random walk.

Quantum walks with memory provided by recycled coins and a memory of the coin-flip history

Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model

Quantum Snake Walk on Graphs

I introduce a continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First, I analyze the quantum