Finding a marked node on any graph by continuous time quantum walk

07/16/2018
by   Shantanav Chakraborty, et al.
0

We provide a new spatial search algorithm by continuous time quantum walk which can find a marked node on any ergodic, reversible Markov chain P, in a time that is quadratically faster than the corresponding classical random walk on P. In the scenario where multiple nodes are marked, the running time of our algorithm scales as the square root of a quantity known as the extended hitting time. This solves an open problem concerning the difference between the running time of spatial search by discrete-time and continuous time quantum walk. We also show that the widely used Childs and Goldstone algorithm for spatial search by continuous time quantum walk is quite restrictive: we identify limitations in its applicability whenever P is not state-transitive. We subsequently improve and extend this algorithm to be applicable for any P. Our generalizations imply that most hitherto published results on the performance of quantum spatial search in the Childs and Goldstone framework on specific graphs are particular cases of our result. However, we prove that the running time of the Childs and Goldstone algorithm and its subsequent improvement is suboptimal: our spatial search algorithm outperforms it. Our results can be adapted to a number of Markov chain-based quantum algorithms and will lead to exploring other connections between discrete-time and continuous time quantum walks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/23/2021

Quadratic speedup for spatial search by continuous-time quantum walk

Continuous-time quantum walks provide a natural framework to tackle the ...
research
07/24/2020

Lackadaisical quantum walks on triangular and honeycomb 2D grids

In the typical model, a discrete-time coined quantum walk search has the...
research
09/26/2022

How to Sample From The Limiting Distribution of a Continuous-Time Quantum Walk

We introduce ε-projectors, using which we can sample from limiting distr...
research
07/09/2019

On the relationships between Z-, C-, and H-local unitaries

Quantum walk algorithms can speed up search of physical regions of space...
research
05/12/2022

Faster quantum mixing of Markov chains in non-regular graph with fewer qubits

Sampling from the stationary distribution is one of the fundamental task...
research
03/06/2020

Generalized Parallel Tempering on Bayesian Inverse Problems

In the current work we present two generalizations of the Parallel Tempe...
research
06/07/2022

Walking on Vertices and Edges by Continuous-Time Quantum Walk

The quantum walk dynamics obey the laws of quantum mechanics with an ext...

Please sign up or login with your details

Forgot password? Click here to reset