• 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={Jonathan H. A. de Carvalho and Luciano S. de Souza and Fernando Maciano de Paula Neto and Tiago Alessandro Esp{\'i}nola 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… 
3 Citations

Figures and Tables from this paper

Lackadaisical Quantum Walk in the Hypercube to Search for Multiple Marked Vertices

TLDR
The results found show that the self-loop value for the quantum walk in the hypercube to search for several marked vertices is l = (n/N) · k, and it is shown that, in the case where neighbors are marked, if there is at least one non-adjacent marked vertex, the probability of success increases to close to 1.

Faster search of clustered marked states with lackadaisical quantum walks

Nature of quantum walk in presence of multiple marked state has been studied by Nahimovs and Rivosh. They have shown that if the marked states are arranged in a $\sqrt{k} \times \sqrt{k}$ cluster in

A template for the arxiv style

TLDR
The proposed Transformer-based model can improve the performance of machinery fault analysis and diagnostic processes and leverage companies to a new era of the Industry 4.0.

References

SHOWING 1-10 OF 47 REFERENCES

Impacts of Multiple Solutions on the Lackadaisical Quantum Walk Search Algorithm

TLDR
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.

Lackadaisical quantum walk for spatial search

TLDR
It is observed that specific values of the self-loop weight at each vertex of the graph is responsible for such a speedup of the quantum search algorithm based on the lackadaisical quantum walk in one and two dimensions.

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 vertex

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 are

Spatial search by quantum walk

TLDR
This work considers an alternative search algorithm based on a continuous-time quantum walk on a graph and shows that full {radical}(N) speedup can be achieved on a d-dimensional periodic lattice for d>4.

Lackadaisical quantum walks on 2D grids with multiple marked vertices

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)

Quantum search of spatial regions

  • S. AaronsonA. Ambainis
  • Computer Science
    44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
  • 2003
TLDR
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.

Quantum Walks on Two-Dimensional Grids with Multiple Marked Locations

TLDR
This paper proves two results showing the importance of how the marked locations are arranged and presents two placements of marked locations for which the number of steps of the algorithm differs by a factor of [Formula].

Quantum search on the two-dimensional lattice using the staggered model with Hamiltonians

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. It

Search on vertex-transitive graphs by lackadaisical quantum walk

TLDR
It is proposed that when there is a unique marked vertex, the optimal weight of the self-loop equals the degree of the loopless graph divided by the total number of vertices, and this holds for all vertex-transitive graphs with aunique marked vertex.