zbMATH — the first resource for mathematics

Quantum query complexity of some graph problems. (English) Zbl 1099.68640
Díaz, Josep (ed.) et al., Automata, languages and programming. 31st international colloquium, ICALP 2004, Turku, Finland, July 12–16, 2004. Proceedings. Berlin: Springer (ISBN 3-540-22849-7/pbk). Lecture Notes in Computer Science 3142, 481-493 (2004).
Summary: 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 \(\Theta (n^{3/2})\) in the matrix model and in \(\Theta(\sqrt{nm})\) in the array model, while the complexity of Connectivity is also in \(\Theta (n^{3/2})\) in the matrix model, but in \(\Theta (n)\) in the array model. The upper bounds utilize search procedures for finding minima of functions under various conditions.
For the entire collection see [Zbl 1056.68007].

68Q25 Analysis of algorithms and problem complexity
05C85 Graph algorithms (graph-theoretic aspects)
81P68 Quantum computation
Full Text: DOI