One-dimensional quantum walks

  title={One-dimensional quantum walks},
  author={Andris Ambainis and Eric Bach and Ashwin Nayak and Ashvin Vishwanath and John Watrous},
  booktitle={STOC '01},
We define and analyze quantum computational variants of random walks on one-dimensional lattices. In particular, we analyze a quantum analog of the symmetric random walk, which we call the <italic>Hadamard walk</italic>. Several striking differences between the quantum and classical cases are observed. For example, when unrestricted in either direction, the Hadamard walk has position that is nearly uniformly distributed in the range <italic>[-t/\sqrt 2, t/\sqrt 2]</italic> after <italic>t… 

Figures from this paper

Asymptotic evolution of quantum walks with random coin
We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary
Coined quantum walks on percolation graphs
Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry.
Random walk replicating discrete time quantum walk on one dimension
A quantum walk exhibits quite different properties compared to a classical random walk, such as linear spreading and localization. While quantum superposition provides these interesting properties,
Discrete-time quantum walks on one-dimensional lattices
Abstract. In this paper, we study discrete-time quantum walks on one-dimensional lattices. We find that the coherent dynamics depends on the initial states and coin parameters. For infinite size of
Properties of long quantum walks in one and two dimensions
This work performs a detailed numerical study of discrete-time quantum walks, characterized the properties of both walks, demonstrating maximal speed-up and emerging semi-classical behavior in the maximally entangled QW.
One-dimensional Hadamard Quantum Walk on a Cycle with Rotational Implementation
The paper explores two implementations of the quantum walk as a quantum circuit: the first one consists of generalised controlled inversions, as introduced in EffWalk, whereas the second one tries to replace them with rotation operators around the basis states.
Interference-induced localization in quantum random walk on clean cyclic graph
We quantitatively differentiate between the spreads of discrete-time quantum and classical random walks on a cyclic graph. Due to the closed nature of any cyclic graph, there is additional
Continuous-Time Quantum Walk on the Line
Quantum walks have recently been introduced and investigated, with the hope that they may be useful in constructing new efficient quantum algorithms. For reviews of quantum walks, see Refs. [4, 16,
Invariance in Quantum Walks
In this Chapter, we present some interesting properties of quantum walks on the line. We concentrate our attention in the emergence of invariance and provide some insights into the ultimate origin of
Directivity of quantum walk via its random walk replica
Quantum walks (QWs) exhibit different properties compared with classical random walks (RWs), most notably by linear spreading and localization. In the meantime, random walks that replicate quantum


Quantum walks on graphs
A lower bound on the possible speed up by quantum walks for general graphs is given, showing that quantum walks can be at most polynomially faster than their classical counterparts.
Quantum simulations of classical random walks and undirected graph connectivity
  • J. Watrous
  • Computer Science
    Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317)
  • 1999
This paper shows that space-bounded quantum Turing machines can efficiently simulate a limited class of random processes-random walks on undirected graphs-without relying on measurements during the computation, and demonstrates that the Undirected graph connectivity problem for regular graphs can be solved by one-sided error quantum Turing Machines that run in logspace and require a single measurement at the end of their computations.
An Example of the Difference Between Quantum and Classical Random Walks
A general definition of quantum random walks on graphs is discussed and with a simple graph the possibility of very different behavior between a classical random walk and its quantum analog is illustrated.
Quantum computation and decision trees
This work devise a quantum-mechanical algorithm that evolves a state, initially localized at the root, through the tree, and proves that if the classical strategy succeeds in reaching level $n$ in time polynomial in $n,$ then so does the quantum algorithm.
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
A fast quantum mechanical algorithm for database search
In early 1994, it was demonstrated that a quantum mechanical computer could efficiently solve a well-known problem for which there was no known efficient algorithm using classical computers, i.e. testing whether or not a given integer, N, is prime, in a time which is a finite power of o (logN) .
Faster mixing via average conductance
It is shown that in a convex body in IR, with diameter D, random walk with steps in a ball with radius δ mixes in O(nD/δ) time (if idle steps at the boundary are not counted).
Random walks, universal traversal sequences, and the complexity of maze problems
Results are derived suggesting that the undirected reachability problem is structurally different from, and easier than, the directed version of NSPACE(logn), an affirmative answer to a question of S. Cook.
The Markov chain Monte Carlo method: an approach to approximate counting and integration
The introduction of analytical tools with the aim of permitting the analysis of Monte Carlo algorithms for classical problems in statistical physics has spurred the development of new approximation algorithms for a wider class of problems in combinatorial enumeration and optimization.
A probabilistic analysis of multidimensional bin packing problems
Probabilistic analyses of two kinds of multidimensional bin packing problems: vector packing and rectangle packing are given and it is shown that the results can be extended to a wide class of distributions of the piece sizes.