Quantum search on Hanoi network

  title={Quantum search on Hanoi network},
  author={Pulak Ranjan Giri and Vladimir E. Korepin},
  journal={International Journal of Quantum Information},
  • P. GiriV. Korepin
  • Published 19 March 2019
  • Physics
  • International Journal of Quantum Information
Hanoi network (HN) has a one-dimensional periodic lattice as its main structure with additional long-range edges, which allow having efficient quantum walk algorithm that can find a target state on the network faster than the exhaustive classical search. In this paper, we use regular quantum walks and lackadaisical quantum walks, respectively, to search for a target state. From the curve fitting of the numerical results for HN of degrees three and four, we find that their running time for the… 

Figures from this paper

Search by lackadaisical quantum walk with symmetry breaking

The lackadaisical quantum walk is a lazy version of a discrete-time, coined quantum walk, where each vertex has a weighted self-loop that permits the walker to stay put. They have been used to speed



Lackadaisical quantum walk for spatial search

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.

Spatial quantum search in a triangular network†

A quantum algorithm for the spatial search problem on a triangular lattice with N sites and torus-like boundary conditions is proposed and it is shown that the time complexity of the quantum search on the triangular lattices is $O(\sqrt{N \log N})$.

Quantum search algorithms on hierarchical networks

This work analyzes search algorithms in degree-3 hierarchical networks using quantum walks driven by non-groverian coins and concludes that the hierarchical structures of the graphs seems to allow analytical results.

Coined quantum walks on weighted graphs

We define a discrete-time, coined quantum walk on weighted graphs that is inspired by Szegedy’s quantum walk. Using this, we prove that many lackadaisical quantum walks, where each vertex has l

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

Connectivity is a poor indicator of fast quantum search.

This Letter shows intuition that graph connectivity is an indicator of fast quantum search on complete graphs, strongly regular graphs, and hypercubes to be false by giving two examples of graphs for which the opposite holds true: one with low connectivity but fast search, and one with high connectivity but slow search.

Spatial search by quantum walk

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.

Spatial Search by Quantum Walk is Optimal for Almost all Graphs.

It is proved that for Erdös-Renyi random graphs, i.e., graphs of n vertices where each edge exists with probability p, search by CTQW is almost surely optimal as long as p≥log^{3/2}(n)/n, and that quantum spatial search is in fact optimal for almost all graphs.

Complexity bounds on quantum search algorithms in finite-dimensional networks

A lower bound concerning the computational complexity of Grover's algorithms on fractal networks is established and a fundamental criterion, derived from quantum transport properties, is yielded for the improvement a quantum search algorithm achieves over the corresponding classical search in a network based solely on its spectral dimension.

Spatial search algorithms on Hanoi networks

We use the abstract search algorithm and its extension due to Tulsi to analyze a spatial quantum search algorithm that finds a marked vertex in Hanoi networks of degree 4 faster than classical