Quantum Search Algorithms on Hierarchical Networks
arXiv:1205.0529 · doi:10.1109/ITW.2011.6089429
Abstract
The "abstract search algorithm" is a well known quantum method to find a marked vertex in a graph. It has been applied with success to searching algorithms for the hypercube and the two-dimensional grid. In this work we provide an example for which that method fails to provide the best algorithm in terms of time complexity. We analyze search algorithms in degree-3 hierarchical networks using quantum walks driven by non-groverian coins. Our conclusions are based on numerical simulations, but the hierarchical structures of the graphs seems to allow analytical results.
arXiv commentIEEE Information Theory Workshop 2011
References in corpus (9)
- 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
- Quantum transport on small-world networks: A continuous-time quantum walk approach
- Quantum computing of delocalization in small-world networks
- Quantum search algorithms on a regular lattice
- Spatial search in a honeycomb network
- Anomalous Diffusion on the Hanoi Networks
- Quantum Transport through Hierarchical Structures