Paper Info
Title
Quantum Search Algorithms On Hierarchical 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.
Year
DOI
Venue
2011
10.1109/ITW.2011.6089429
2011 IEEE INFORMATION THEORY WORKSHOP (ITW)
Keywords
Field
DocType
information theory,search algorithm,computational complexity,numerical analysis,quantum physics,time complexity,graph theory,numerical simulation,algorithm design,quantum walk,quantum computing,quantum computer,robots,quantum communication,algorithm design and analysis
Graph theory,Discrete mathematics,Algorithm design,Search algorithm,Computer science,Quantum computer,Algorithm,Theoretical computer science,Quantum walk,Quantum information science,Time complexity,Computational complexity theory
Conference
Citations 
PageRank 
References 
0
0.34
2
Authors
3
Name
Order
Citations
PageRank
F. L. Marquezino1196.66
Renato Portugal25210.01
Stefan Boettcher316714.57