Spatial search with multiple marked vertices is optimal for almost all queries and its quantum advantage is not always guaranteed

01/30/2022
by   Mathieu Roget, et al.
0

We contribute to fulfil the long-lasting gap in the understanding of the spatial search with multiple marked vertices. The theoretical framework is that of discrete-time quantum walks (QW), i.e. local unitary matrices that drive the evolution of a single particle on the lattice. QW based search algorithms are well understood when they have to tackle the fundamental problem of finding only one marked element in a d-dimensional grid and it has been proven they provide a quadratic advantage over classical searching protocols. However, once we consider to search more than one element, the behaviour of the algorithm may be affected by the spatial configuration of the marked elements, due to the quantum interference among themselves and even the quantum advantage is no longer granted. Here our main contribution is twofold : (i) we provide strong numerical evidence that spatial configurations are almost all optimal; and (ii) we analytically prove that the quantum advantage with respect to the classical counterpart is not always granted and it does depend on the proportion of searched elements over the total number of grid points τ. We finally providing a clear phase diagram for the QW search advantage with respect to the classical random algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/29/2019

The Grover search as a naturally occurring phenomenon

We provide the first evidence that under certain conditions, electrons m...
research
09/16/2020

Searching via nonlinear quantum walk on the 2D-grid

We provide numerical evidence that the nonlinear searching algorithm int...
research
02/17/2023

Quantum Hitting Time according to a given distribution

In this work we focus on the notion of quantum hitting time for discrete...
research
12/07/2021

Spatial Search on Johnson Graphs by Discrete-Time Quantum Walk

The spatial search problem aims to find a marked vertex of a finite grap...
research
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 ...
research
06/04/2021

Dissipative search of an unstructured database

The search of an unstructured database amounts to finding one element ha...
research
03/25/2011

Cooperative searching for stochastic targets

Spatial search problems abound in the real world, from locating hidden n...

Please sign up or login with your details

Forgot password? Click here to reset