Quadratic speedup for finding marked vertices by quantum walks

03/18/2019
by   Andris Ambainis, et al.
0

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.

READ FULL TEXT
03/23/2021

Quantum walk-based search algorithms with multiple marked vertices

The quantum walk is a powerful tool to develop quantum algorithms, which...
01/30/2019

Detecting quantum speedup by quantum walk with convolutional neural networks

Quantum walks are at the heart of modern quantum technologies. They allo...
04/25/2019

Quantum Walk Sampling by Growing Seed Sets

This work describes a new algorithm for creating a superposition over th...
03/04/2019

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 ...
08/09/2020

Random Walks: A Review of Algorithms and Applications

A random walk is known as a random process which describes a path includ...
09/27/2017

The Elephant Quantum Walk

We explore the impact of long-range memory on the properties of a family...
07/21/2021

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

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