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

by   Adam Glos, et al.
Institute of Theoretical and Applied Informatics
Kazan State University
University of Latvia

Finding a marked vertex in a graph can be a complicated task when using quantum walks. Recent results show that for two or more adjacent marked vertices search by quantum walk with Grover's coin may have no speed-up over classical exhaustive search. In this paper, we analyze the probability of finding a marked vertex and prove several upper bounds for various sets of marked vertices. All upper bounds are given in explicit form.


page 1

page 2

page 3

page 4


Quadratic speedup for finding marked vertices by quantum walks

A quantum walk algorithm can detect the presence of a marked vertex on a...

Quantum Subroutine Composition

An important tool in algorithm design is the ability to build algorithms...

Improved quantum backtracking algorithms through effective resistance estimates

We investigate quantum backtracking algorithms of a type previously intr...

The Lovász Local Lemma is Not About Probability

Given a collection of independent events each of which has strictly posi...

Spatial Search on Johnson Graphs by Discrete-Time Quantum Walk

The spatial search problem aims to find a marked vertex of a finite grap...

Please sign up or login with your details

Forgot password? Click here to reset