Quantum query complexity of some graph problems

SIAM Journal on Computing

Volumn 35, Issue 6, 2006, Pages 1310-1328

  Dürr, Christoph ^a   Heiligman, Mark ^b   Høyer, Peter ^c   Mhalla, Mehdi ^d  

^a ÉCOLE POLYTECHNIQUE   (France)

^b NATIONAL SECURITY AGENCY   (United States)

^c UNIVERSITY OF CALGARY   (Canada)

^d CNRS   (France)

Author keywords

Connectivity; Graph theory; Lower bound; Minimum spanning tree; Quantum algorithm; Single source shortest paths

Indexed keywords

LOWER BOUND; MINIMUM SPANNING TREE; QUANTUM ALGORITHM; SINGLE SOURCE SHORTEST PATHS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MATRIX ALGEBRA; QUANTUM THEORY; QUERY LANGUAGES;

GRAPH THEORY;

EID: 33845581284     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/050644719     Document Type: Article

References (22)

1. A. AHARONOV, A. AMBAINIS, J. KEMPE, AND U. VAZIRANI, Quantum walks on graphs, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 2001, pp. 50-59.
2. A. AMBAINIS, Quantum lower bounds by quantum arguments, J. Comput. System Sci., 64 (2002), pp. 750-767.
3. C. H. BENNETT, E. BERNSTEIN, G. BRASSARD, AND U. VAZIRANI, Strengths and weaknesses of quantum computing, SIAM J. Comput., 26 (1997), pp. 1510-1523.
4. A. BERZINA, A. DUBROVSKY, R. FREIVALDS, L. LACE, AND O. SCEGULNAJA, Quantum query complexity for some graph problems, in Proceedings of the 30th Annual Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM), Merin, Czech Republic, 2004, pp. 140-150.
5. O. BORŮVKA, O jistém problému minimální m, Práce Mor. Přírodově d. spol. v Brně (Acta Societ. Scient. Natur. Moravicae), 3 (1926), pp. 37-58.
6. M. BOYER, G. BRASSARD, P. HØYER, AND A. TAPP, Tight bounds on quontum searching, Fortschr. Phys., 46 (1998), pp. 493-505.
7. G. BRASSARD AND P. HØYER, An exact quantum polynomial-time algorithm for Simon's problem, in Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems (ISTCS), Ramat-Gan, Israel, 1997, pp. 12-23.
8. G. BRASSARD, P. HØYER, M. MOSCA, AND A. TAPP, Quantum amplitude amplification and estimation, in Quantum Computation and Quantum Information: A Millennium Volume, Contemp. Math. 305, AMS, Providence, RI, 2002, pp. 53-74.
9. H. BUHRMAN, R. CLEVE, R. DE WOLF, AND CH. ZALKA, Bounds for small-error and zero-error quantum algorithms, in Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society, Los Alamitos, CA, 1999, pp. 358-368.
10. A. M. CHILDS, R. CLEVE, E. DEOTTO, E. FARHI, S. GUTMANN, AND D. A. SPIELMAN, Exponential algorithmic speedup by quantum walk, in Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 2003, pp. 59-68.
11. CH. DÜRR AND P. HøYER, A quantum algorithm for finding the minimum, quant-ph/9607014, 1996.
12. E. FARHI, J. GOLDSTONE, S. GUTMANN, AND M. SIPSER, A limit on the speed of quantum computation in determining parity, quant-ph/9802045, 1998.
13. L. GROVER, A fast mechanical algorithm for database search, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 1996, pp. 212-219.
14. M. R. HENZINGER AND M. L. FREDMAN, Lower bounds for fully dynamic connectivity problems in graphs, Algorithmica, 22 (1998), pp. 351-362.
15. J. KEMPE, Quantum random walks - an introductory overview, Contemporary Physics, 44 (2003), pp. 307-327.
16. D. KOZEN, The Design and Analysis of Algorithms, Springer-Verlag, New York, 1991.
17. J. B. KRUSKAL, JR., On the shortest spanning subtree of a graph and the traveling salesman problem, in Proc. Amer. Math. Soc., 7 (1956), pp. 48-50.
18. A. NAYAK, Lower Bounds for Quantum Computation and Communication, Ph.D. thesis, The University of California, Berkeley, CA, 1999.
19. A. NAYAK AND F. WU, The quantum query complexity of approximating the median and related statistics, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC), ACM, New York, 1999, pp. 384-393.
20. J. NEŠETŘIL, E. MILKOVÁ, AND H. NEŠETŘ ILOVÁ, Otakar Borůvka on minimum spanning tree problem: Translation of both the 1926 papers, comments, history, Discrete Math., 233 (2001), pp. 3-36.
21. R. PRIM, Shortest connecting networks and some generalizations, Bell System Technical Journal, 36 (1957), pp. 1389-1401.
22. J. WATROUS, Quantum simulations of classical random walks and undirected graph connectivity, J. Comput. System Sci., 62 (2001), pp. 376-391.