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 in Θ(n 3/2) in the matrix model and in \(\Theta(\sqrt{nm})\) in the array model, while the complexity of Connectivity is also in Θ(n 3/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.
This paper subsumes manuscripts on arxiv.org quant-ph/9607014, quant-ph/0303131, quant-ph/0303169. We are grateful to Yaohui Lei for his permission to include results presented in quant-ph/0303169 in this paper.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aharonov, A., Ambainis, A., Kempe, J., Vazirani, U.: Quantum walks on graphs. In: Proceedings of 33th Annual ACM Symposium on Theory of Computing (STOC), pp. 50–59 (2001)
Ambainis, A.: Quantum lower bounds by quantum arguments. Journal of Computer and System Sciences 64, 750–767 (2002)
Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM Journal on Computing 26(5), 1510–1523 (1997)
Berzina, A., Dubrovsky, A., Freivalds, R., Lace, L., Scegulnaja, O.: Quantum Query Complexity for Some Graph Problems. In: Van Emde Boas, P., Pokorný, J., Bieliková, M., Štuller, J. (eds.) SOFSEM 2004. LNCS, vol. 2932, pp. 140–150. Springer, Heidelberg (2004)
Borůvka, O.: O jistem problemu minimaln im. Prace Mor. Prrodove Spol. v Brne (Acta Societ. Scient. Natur. Moravicae) 3, 37–58 (1926)
Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte Der Physik 46(4-5), 493–505 (1998)
Brassard, G., Høyer, P.: An exact quantum polynomial-time algorithm for Simon’s problem. In: Proceedings of Fifth Israeli Symposium on Theory of Computing and Systems (ISTCS), pp. 12–23 (1997)
Brassard, G., Høyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In: Quantum Computation and Quantum Information: A Millennium Volume. AMS Contemporary Mathematics Series
Buhrman, H., Cleve, R., de Wolf, R.: Ch. Zalka, Bounds for Small-Error and Zero-Error Quantum Algorithms. In: 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 358–368 (1999)
Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.A.: Exponential algorithmic speedup by quantum walk. In: Proceedings of 35th Annual ACM Symposium on Theory of Computing (STOC), pp. 59–68 (2003)
Dürr, C., Høyer, P.: A quantum algorithm for finding the minimum. quantph/9607014 (1996)
Fahri, E., Goldstone, J., Gutmann, S., Sipser, M.: A limit on the speed of quantum computation in determining parity. quant-ph/9802045 (1998)
Grover, L.: A fast mechanical algorithm for database search. In: Proceedings of 28th Annual ACM Symposium on Theory of Computing (STOC), pp. 212–219 (1996)
Henzinger, M.R., Fredman, M.L.: Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica 22, 351–362 (1998)
Kempe, J.: Quantum random walks—an introductory overview. Contemporary Physics 44(4), 307–327 (2003)
Kozen, D.: The Design and Analysis of Algorithms. Springer, Heidelberg (1991)
Kruskal Jr., J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society (1956)
Nayak, A.: Lower Bounds for Quantum Computation and Communication, PhD from the University of California, Berkeley (1999)
Nayak, A., Wu, F.: The quantum query complexity of approximating the median and related statistics. In: Proceedings of 31th Annual ACM Symposium on Theory of Computing (STOC), pp. 384–393 (1999)
Nesetril, J., Milková, E., Nesetrilová, H.: Otakar Borůvka on Minimum Spanning Tree Problem: translation of both the 1926 papers, comments, history. Discrete Mathematics 233, 3–36 (2001)
Prim, R.: Shortest connecting networks and some generalizations. Bell Syst. Tech. J (1957)
Watrous, J.: Quantum simulations of classical random walks and undirected graph connectivity. Journal of Computer and System Sciences 62(2), 376–391 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dürr, C., Heiligman, M., Høyer, P., Mhalla, M. (2004). Quantum Query Complexity of Some Graph Problems. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds) Automata, Languages and Programming. ICALP 2004. Lecture Notes in Computer Science, vol 3142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27836-8_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-27836-8_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22849-3
Online ISBN: 978-3-540-27836-8
eBook Packages: Springer Book Archive