Quantum Search Algorithms on Hierarchical Networks
Quantum Physics
2012-05-18 v1 Disordered Systems and Neural Networks
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.
Cite
@article{arxiv.1205.0529,
title = {Quantum Search Algorithms on Hierarchical Networks},
author = {F. L. Marquezino and R. Portugal and S. Boettcher},
journal= {arXiv preprint arXiv:1205.0529},
year = {2012}
}
Comments
IEEE Information Theory Workshop 2011