Quadratic speedup for finding marked vertices by quantum walks

by   Andris Ambainis, et al.

A quantum walk algorithm can detect the presence of a marked vertex on a graph quadratically faster than the corresponding random walk algorithm (Szegedy, FOCS 2004). However, quantum algorithms that actually find a marked element quadratically faster than a classical random walk were only known for the special case when the marked set consists of just a single vertex, or in the case of some specific graphs. We present a new quantum algorithm for finding a marked vertex in any graph, with any set of marked vertices, that is (up to a log factor) quadratically faster than the corresponding classical random walk.


Quantum walk-based search algorithms with multiple marked vertices

The quantum walk is a powerful tool to develop quantum algorithms, which...

Detecting quantum speedup by quantum walk with convolutional neural networks

Quantum walks are at the heart of modern quantum technologies. They allo...

Quantum Walk Sampling by Growing Seed Sets

This work describes a new algorithm for creating a superposition over th...

Upperbounds on the probability of finding marked connected components using quantum walks

Finding a marked vertex in a graph can be a complicated task when using ...

Random Walks: A Review of Algorithms and Applications

A random walk is known as a random process which describes a path includ...

The Elephant Quantum Walk

We explore the impact of long-range memory on the properties of a family...

Delving Into Deep Walkers: A Convergence Analysis of Random-Walk-Based Vertex Embeddings

Graph vertex embeddings based on random walks have become increasingly i...