Quantum query complexity of some graph problems
Preprint
Abstract
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 asymtotically n^{3/2} in the matrix model and (nm)^{1/2} in the array model, while the complexity of Connectivity is also asymptotically n^{3/2} in the matrix model, but asymptotically linear in n in the array model. The upper bounds utilize search procedures for finding minima of functions under various conditions.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Quantum random walks: An introductory overviewContemporary Physics, 2003
- Quantum Lower Bounds by Quantum ArgumentsJournal of Computer and System Sciences, 2002
- Otakar Borůvka on minimum spanning tree problem Translation of both the 1926 papers, comments, historyDiscrete Mathematics, 2001
- Quantum Simulations of Classical Random Walks and Undirected Graph ConnectivityJournal of Computer and System Sciences, 2001
- Lower Bounds for Fully Dynamic Connectivity Problems in GraphsAlgorithmica, 1998
- Strengths and Weaknesses of Quantum ComputingSIAM Journal on Computing, 1997
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957