Corpus ID: 235417381

# On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids

@article{Carvalho2021OnAT,
title={On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids},
author={J. Carvalho and L. Souza and F. M. P. Neto and T. Ferreira},
journal={ArXiv},
year={2021},
volume={abs/2106.06274}
}
Quantum computing holds the promise of improving the information processing power to levels unreachable by classical computation. Quantum walks are heading the development of quantum algorithms for searching information on graphs more efficiently than their classical counterparts. A quantum-walk-based algorithm that is standing out in the literature is the lackadaisical quantum walk. The lackadaisical quantum walk is an algorithm developed to search two-dimensional grids whose vertices have a… Expand
1 Citations

#### Figures and Tables from this paper

A template for the arxiv style
While deep learning models have greatly improved the performance of most artificial intelligence tasks, they are often criticized to be untrustworthy due to the black-box problem. Consequently, manyExpand

#### References

SHOWING 1-10 OF 47 REFERENCES
Impacts of Multiple Solutions on the Lackadaisical Quantum Walk Search Algorithm
• Computer Science
• BRACIS
• 2020
The impacts of multiple solutions on the final results achieved by the lackadaisical quantum walk are analyzed and it is demonstrated that the success probability is inversely proportional to the density of vertices marked as solutions and directly proportional toThe relative distance between solutions. Expand
Lackadaisical quantum walk for spatial search
• Physics
• 2018
Lackadaisical quantum walk(LQW) has been an efficient technique in searching a target state from a database which is distributed on a two-dimensional lattice. We numerically study the quantum searchExpand
Grover Search with Lackadaisical Quantum Walks
The lazy random walk, where the walker has some probability of staying put, is a useful tool in classical algorithms. We propose a quantum analogue, the lackadaisical quantum walk, where each vertexExpand
Quantum Walks and Search Algorithms
This book addresses an interesting area of quantum computation called quantum walks, which play an important role in building quantum algorithms, in particular search algorithms. Quantum walks areExpand
Spatial search by quantum walk
• Physics
• 2004
Grover's quantum search algorithm provides a way to speed up combinatorial search, but is not directly applicable to searching a physical database. Nevertheless, Aaronson and Ambainis showed that aExpand
Lackadaisical quantum walks on 2D grids with multiple marked vertices
• Physics
• 2021
Lackadaisical quantum walk (LQW) is a quantum analog of a classical lazy walk, where each vertex has a self-loop of weight l. For a regular N×N 2D grid LQW can find a single marked vertex with O(1)Expand
Quantum search of spatial regions
• Mathematics, Computer Science
• 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
• 2003
An 0(/spl radic/n)-qubit communication protocol for the disjointness problem is given, which improves an upper bound of Hoyer and de Wolf and matches a lower bound of Razborov. Expand
Quantum search on the two-dimensional lattice using the staggered model with Hamiltonians
• Physics, Mathematics
• 2017
Quantum search on the two-dimensional lattice with one marked vertex and cyclic boundary conditions is an important problem in the context of quantum algorithms with an interesting unfolding. ItExpand
Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations
• Mathematics, Physics
• SOFSEM
• 2016
This paper presents two placements of k marked locations for which the number of steps of the algorithm differs by a factor of $$\varOmega \sqrt{k}$$ and presents two configurations of k and marked locations having the same number of Steps and probability to find a marked location. Expand
Quantum random-walk search algorithm
• Physics, Computer Science
• 2003
It will be shown that this algorithm performs an oracle search on a database of N items with $O(\sqrt{N})$ calls to the oracle, yielding a speedup similar to other quantum search algorithms. Expand