The quantum walk search algorithm: factors affecting efficiency

  title={The quantum walk search algorithm: factors affecting efficiency},
  author={Neil B. Lovett and Matthew S. Everitt and Robert M. Heath and Viv Kendon},
  journal={Mathematical Structures in Computer Science},
  pages={389 - 429}
We carry out a numerical study of the quantum walk search algorithm of Shenvi, Kempe and Whaley Shenvi et al. (2003) and the factors that affect its efficiency in finding an individual state from an unsorted set. Previous work has focused purely on the effects of the dimensionality of the dataset to be searched. In the current paper we consider the effects of interpolating between dimensions, the connectivity of the dataset and the possibility of disorder in the underlying substrate: all these… 
Quantum search with hybrid adiabatic–quantum-walk algorithms and realistic noise
This work carries out a detailed examination of adiabatic and quantum-walk implementation of the quantum search algorithm, using the more physically realistic hypercube connectivity, rather than the complete graph, for the base Hamiltonian.
Finding spin glass ground states using quantum walks
This work investigates the performance of continuous-time quantum walks as a tool for finding spin glass ground states, a problem that serves as a useful model for realistic optimization problems and uncover significant ways in which solving spin glass problems differs from applying quantum walks to the search problem.
Decoherence on staggered quantum walks
Decoherence phenomenon has been widely studied in different types of quantum walks. In this work we show how to model decoherence inspired by percolation on staggered quantum walks. Two models of
Optimizing the spatial spread of a quantum walk
We devise a protocol to build 1D time-dependent quantum walks in 1D maximizing the spatial spread throughout the procedure. We allow only one of the physical parameters of the coin-tossing operator
J un 2 01 4 Discrete time quantum walks on percolation graphs
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of
Scattering quantum random walks on square grids and randomly generated mazes
This paper examines the Scattering Quantum Random Walk scheme's effectiveness at locating a specially marked vertex on square grid graphs, consisting of N$^2 nodes, and examines how this hybrid algorithm handles varying types of randomness in both location of the special vertex and later random obstacles placed throughout the geometry.
Dirac Spatial Search with Electric Fields
Electric Dirac quantum walks, which are a discretisation of the Dirac equation for a spinor coupled to an electric field, are revisited in order to perform spatial searches. The Coulomb electric
Classical Artificial Neural Network Training Using Quantum Walks as a Search Procedure
It is possible to use the quantum walk search procedure as an alternative to the backpropagation algorithm in a complete graph to find all synaptic weights of a classical artificial neural network.


Spatial search using the discrete time quantum walk
The numerical results agree with the expected scaling in 2D of $$O(\sqrt{N \log N})$$, and show how the prefactors display significant dependence on both the degree and symmetry of the graph, and see the prefactor of the time complexity dropping as the degree of the structure is increased.
Optimized quantum random-walk search algorithms on the hypercube
Improvements to the SKW algorithm are presented which yield a significant increase in success probability, and an improvement on query complexity such that the theoretical limit of a search algorithm succeeding with probability close to one is reached.
Search via quantum walk
The algorithm is based on a quantum walk à la Szegedy that is defined in terms of the Markov chain that is to apply quantum phase estimation to the quantumwalk in order to implement an approximate reflection operator that is then used in an amplitude amplification scheme.
Spatial search by quantum walk
This work considers an alternative search algorithm based on a continuous-time quantum walk on a graph and shows that full {radical}(N) speedup can be achieved on a d-dimensional periodic lattice for d>4.
Localization of two-dimensional quantum walks
The Grover walk, which is related to Grover's search algorithm on a quantum computer, is one of the typical discrete time quantum walks. However, a localization of the two-dimensional Grover walk
Search on a hypercubic lattice using a quantum random walk. II. d=2
A quantum random walk algorithm is constructed, based on discretization of the Dirac evolution operator inspired by staggered lattice fermions, which is used to investigate the spatial search problem, that is, to find a marked vertex on a d-dimensional hypercubic lattice.
Quantum speed-up of Markov chain based algorithms
  • M. Szegedy
  • Computer Science
    45th Annual IEEE Symposium on Foundations of Computer Science
  • 2004
It is shown that under certain conditions, the quantum version of the Markov chain gives rise to a quadratic speed-up, and that the quantum escape time, just like its classical version, depends on the spectral properties of the transition matrix with the marked rows and columns deleted.
Quantum search algorithms on the hypercube
We investigate a set of discrete-time quantum search algorithms on the n-dimensional hypercube following a proposal by Shenvi et al (2003 Phys. Rev. A 67 052307). We show that there exists a whole
Quantum search algorithms on a regular lattice
Quantum algorithms for searching for one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these
Decoherence can be useful in quantum walks
We present a study of the effects of decoherence in the operation of a discrete quantum walk on a line, cycle, and hypercube. We find high sensitivity to decoherence, increasing with the number of