Sciweavers

Share
ICALP
2004
Springer

Quantum Query Complexity of Some Graph Problems

9 years 3 months ago
Quantum Query Complexity of Some Graph Problems
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity of Connectivity, Strong Connectivity, Minimum Spanning Tree, and Single Source Shortest Paths. For example we show that the query complexity of Minimum Spanning Tree is in Θ(n3/2) in the matrix model and in Θ( √ nm) in the array model, while the complexity of Connectivity is also in Θ(n3/2) in the matrix model, but in Θ(n) in the array model. The upper bounds utilize search procedures for finding minima of functions under various conditions. Keywords. graph theory, quantum algorithm, lower bound, connectivity, minimum spanning tree, single source shortest paths
Christoph Dürr, Mark Heiligman, Peter H&oslas
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where ICALP
Authors Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla
Comments (0)
books