Quantum search on Hanoi network
arXiv:1903.08020 · doi:10.1142/S0219749919500606
Abstract
Hanoi network 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 article, 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 Hanoi network of degree three and four we find that their running time for the regular quantum walks followed by amplitude amplification scales as and respectively. And for the search by lackadaisical quantum walks the running time scales as and respectively.
arXiv comment8 pages, 4 figures, accepted version
References in corpus (18)
- Quantum Mechanics helps in searching for a needle in a haystack
- Spatial search by quantum walk
- Faster quantum walk algorithm for the two dimensional spatial search
- Spatial search by quantum walk is optimal for almost all graphs
- Spatial search and the Dirac equation
- Grover Search with Lackadaisical Quantum Walks
- Connectivity is a Poor Indicator of Fast Quantum Search
- A Review on Quantum Search Algorithms
- Faster Search by Lackadaisical Quantum Walk
- Spatial search in a honeycomb network
- Coined Quantum Walks on Weighted Graphs
- Search on a Fractal Lattice using a Quantum Random Walk
- Anomalous Diffusion on the Hanoi Networks
- Lackadaisical quantum walk for spatial search
- Spatial quantum search in a triangular network
- Spatial Search Algorithms on Hanoi Networks
- Complexity Bounds on Quantum Search Algorithms in finite-dimensional Networks
- Quantum Search Algorithms on Hierarchical Networks