Spatial Search Algorithms on Hanoi Networks
arXiv:1209.2871 · doi:10.1103/PhysRevA.87.012329
Abstract
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 algorithms. We also analyze the effect of using non-Groverian coins that take advantage of the small world structure of the Hanoi networks. We obtain the scaling of the total cost of the algorithm as a function of the number of vertices. We show that Tulsi's technique plays an important role to speed up the searching algorithm. We can improve the algorithm's efficiency by choosing a non-Groverian coin if we do not implement Tulsi's method. Our conclusion is based on numerical implementations.
arXiv comment6 pages, 6 figures
References in corpus (14)
- Quantum Mechanics helps in searching for a needle in a haystack
- Quantum random walks - an introductory overview
- Faster quantum walk algorithm for the two dimensional spatial search
- Google in a Quantum Network
- Quantum Navigation and Ranking in Complex Networks
- Adiabatic quantum algorithm for search engine ranking
- Quantum transport on small-world networks: A continuous-time quantum walk approach
- Quantum walk approach to search on fractal structures
- Quantum computing of delocalization in small-world networks
- Quantum search algorithms on a regular lattice
- Spatial search in a honeycomb network
- Search on a Fractal Lattice using a Quantum Random Walk
- Anomalous Diffusion on the Hanoi Networks
- Spatial quantum search in a triangular network
Cited by in corpus (7)
- Quantum Google in a Complex Network
- Faster Search by Lackadaisical Quantum Walk
- Lackadaisical quantum walk for spatial search
- Complexity Bounds on Quantum Search Algorithms in finite-dimensional Networks
- Quantum walk search on a two-dimensional grid with extra edges
- Quantum search on Hanoi network
- Quantum Ultra-Walks: Walks on a Line with Hierarchical Spatial Heterogeneity