Quantum query complexity of minor-closed graph properties

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 9, Issue , 2011, Pages 661-672

  Childs, Andrew M ^a   Kothari, Robin ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Graph minors; Graph properties; Lower bounds; Quantum algorithms; Quatum query complexity

Indexed keywords

GRAPH MINORS; GRAPH PROPERTIES; LOWER BOUNDS; QUANTUM ALGORITHMS; QUERY COMPLEXITY;

COMPUTER SCIENCE; QUANTUM THEORY;

GRAPH THEORY;

EID: 84880297376     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2011.661     Document Type: Conference Paper

References (39)

1. S. Aaronson. Lower bounds for local search by quantum arguments. SIAM Journal on Computing, 35(4):804-824, 2006.
2. Preliminary version In STOC 2004.
3. A. Ambainis. Quantum lower bounds by quantum arguments. Journal of Computer and System Sciences, 64(4):750-767, 2002.
4. Preliminary version In STOC 2000.
5. A. Ambainis. Quantum walk algorithm for element distinctness. SIAM Journal on Computing, 37(1):210-239, 2007.
6. Preliminary version In FOCS 2004.
7. A. Ambainis. A new quantum lower bound method, with an application to strong direct product theorem for quantum search. Theory of Computing, 6(1):1-25, 2010.
8. A. Ambainis, K. Iwama, M. Nakanishi, H. Nishimura, R. Raymond, S. Tani, and S. Ya-mashita. Quantum query complexity of boolean functions with small on-sets. In Proceedings of the 19th International Symposium on Algorithms and Computation, pages 907-918, 2008.
9. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. Journal of the ACM, 48(4):778-797, 2001.
10. Preliminary version In FOCS 1998.
11. A. Berzina, A. Dubrovsky, R. Freivalds, L. Lace, and O. Scegulnaja. Quantum query complexity for some graph problems. In SOFSEM 2004: Theory and Practice of Computer Science, Volume 2932, pages 1-11, 2004.
12. J. A. Bondy and M. Simonovits. Cycles of even length in graphs. Journal of Combinatorial Theory, Series B, 16(2):97-105, 1974.
13. G. Brassard, P. Høyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation. In Quantum computation and information, Volume 305 of Contemporary Mathematics, pages 53-74. AMS, 2002.
14. H. Buhrman, C. Dürr, M. Heiligman, P. Høyer, F. Magniez, M. Santha, and R. de Wolf. Quantum algorithms for element distinctness. SIAM Journal on Computing, 34(6):1324-1330, 2005.
15. Preliminary version In CCC 2000.
16. A. Chakrabarti and S. Khot. Improved lower bounds on the randomized complexity of graph properties. Random Structures and Algorithms, 30(3):427-440, 2007.
17. Preliminary version In ICALP 2001.
18. C. Dürr, M. Heiligman, P. Høyer, and M. Mhalla. Quantum query complexity of some graph problems. SIAM Journal on Computing, 35(6):1310-1328, 2006.
19. L. K. Grover. Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters, 79(2):325-328, 1997.
20. Preliminary version In STOC 1996.
21. P. Høyer, T. Lee, and R. Spalek. Negative weights make adversaries stronger. In STOC '07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pages 526-535, 2007.
22. J. Kahn, M. Saks, and D. Sturtevant. A topological approach to evasiveness. In SFCS '83: Proceedings of the 24th Annual Symposium on Foundations of Computer Science, pages 31-33, 1983.
23. T. Kövari, V. T. Sós, and P. Turán. On a problem of K. Zarankiewicz. Colloquium Mathematicum, 3:50-57, 1954.
24. W. Mader. Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Mathematische Annalen, 174:265-268, 1967.
25. F. Magniez, A. Nayak, J. Roland, and M. Santha. Search via quantum walk. In STOC '07: Proceedings of the 39th ACM Symposium on Theory of Computing, pages 575-584, 2007.
26. F. Magniez, M. Santha, and M. Szegedy. Quantum algorithms for the triangle problem. SIAM Journal on Computing, 37(2):413-424, 2007.
27. Preliminary version In SODA 2005.
28. R. L. Rivest and J. Vuillemin. A generalization and proof of the Aanderaa-Rosenberg conjecture. In STOC '75: Proceedings of the 7th Annual ACM Symposium on Theory of Computing, pages 6-11, 1975.
29. N. Robertson and P. D. Seymour. Graph minors. VIII. A Kuratowski theorem for general surfaces. Journal of Combinatorial Theory, Series B, 48(2):255-288, 1990.
30. N. Robertson and P. D. Seymour. Graph minors. XX. Wagner's conjecture. Journal of Combinatorial Theory, Series B, 92(2):325-357, 2004.
31. A. L. Rosenberg. On the time required to recognize properties of graphs: a problem. SIGACT News, 5(4):15-16, 1973.
32. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5):1484-1509, 1997.
33. Preliminary version In FOCS 1994.
34. R. Špalek and M. Szegedy. All quantum adversary methods are equivalent. Theory of Computing, 2(1):1-18, 2006.
35. Preliminary version In ICALP 2005.
36. X. Sun, A. C. Yao, and S. Zhang. Graph properties and circular functions: How low can quantum query complexity go? In CCC '04: Proceedings of the 19th Annual IEEE Conference on Computational Complexity, pages 286-293, 2004.
37. M. Szegedy. Quantum speed-up of Markov chain based algorithms. In FOCS '04: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pages 32-41, 2004.
38. S. Zhang. On the power of Ambainis lower bounds. Theoretical Computer Science, 339(2):241-256, 2005.
39. Preliminary version In ICALP 2004.