Quantum algorithms for the triangle problem

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 1109-1117

  Magniez, Frédéric ^a   Santha, Miklos ^a   Szegedy, Mario ^b  

^a CNRS   (France)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NODE REGISTERS; QUANTUM ALGORITHMS; QUANTUM COMPUTING; QUANTUM WALKS;

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DATABASE SYSTEMS; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; QUANTUM THEORY; QUERY LANGUAGES; SET THEORY;

ALGORITHMS;

EID: 20744440802     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. S. Aaronson. Quantum lower bound for the collision problem. In Proceedings of the 34th ACM Symposium on Theory of Computing, pages 635-642, 2002.
2. D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani. Quantum walks on graphs. In Proceedings of the 33th ACM Symposium on Theory of Computing, pages 50-59, 2001.
3. N. Alon, R. Yuster, and U. Zwick. Finding and counting given length cycles. Algorithmica, 17(3):209-223, 1997.
4. A. Ambainis. Quantum lower bounds by quantum arguments. Journal of Computer and System Sciences, 64:750-767, 2002.
5. A. Ambainis. Polynomial degree vs. quantum query complexity. In Proceedings of 44th IEEE Symposium on Foundations of Computer Science, pages 230-239, 2003.
6. A. Ambainis. Quantum walk algorithm for element distinctness. In 45th IEEE Symposium on Foundations of Computer Science, 2004. To appear.
7. A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous. One-dimensional quantum walks. In Proceedings of the 33th ACM Symposium on Theory of Computing, pages 60-69, 2001.
8. H. Barnum, M. Saks, and M. Szegedy. Quantum decision trees and semidefinite programming. In Proceedings of the 18th IEEE Conference on Computational Complexity, pages 179-193, 2003.
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. G. Brassard, P. Høyer, M. Mosca, and A. Tapp. Quantum amplitude amplification and estimation. In Quantum Computation and Quantum Information: A Millennium Volume, volume 305. AMS Contemporary Mathematics Series, 2002.
11. H. Buhrman, R. Cleve, R. de Wolf, and C. Zalka. Bounds for small-error and zero-error quantum algorithms. In Proceedings of 40th Symposium on Foundations of Computer Science, pages 358-368, 1999.
12. H. Buhrman, C. Dürr, M. Heiligman, P. Høyer, F. Magniez, M. Santha, and R. de Wolf. Quantum algorithms for element distinctness. In Proceedings of 15th IEEE Conference on Computational Complexity, pages 131-137, 2001.
13. A. Chakrabarti and S. Khot. Improved lower bounds on the randomized complexity of graph properties. In Proceedings of 28th International Colloquium on Automata, Languages and Programming, pages 285-296, 2001.
14. A. Childs and J. Eisenberg. Quantum algorithms for subset finding. Technical Report quant-ph/0311038, arXiv, 2003.
15. D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. In Proceedings of the Royal Society of London A, volume 400, pages 97-117, 1985.
16. D. Deutsch and R. Jozsa. Rapid solution of problems by quantum computation. In Proceedings of the Royal Society A, volume 439, 1992.
17. M. Ettinger, P. Høyer, and E. Knill. Hidden subgroup states are almost orthogonal. Technical Report quant-ph/9901034, arXiv, 1999.
18. L. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of 28th ACM Symposium on Theory of Computing, pages 212-219, 1996.
19. 4/3 lower bound on the randomized complexity of graph properties. Combinatorica, 11:131-143, 1991.
20. A. Kitaev, A. Shen, and M. Vyalyi. Classical and quantum computation. In Graduate Studies in Mathematics, volume 47. AMS, 2002.
21. S. Laplante and F. Magniez. Lower bounds for randomized and quantum query complexity using Kolmogorov arguments. In Proceedings of 19th IEEE Conference on Computational Complexity, pages 214-304, 2004.
22. M. Nielsen and I. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
23. R. Rivest and J. Vuillemin. On recognizing graph properties from adjacency matrices. Theoretical Computer Science, 3:371-384, 1976.
24. A. Rosenberg. On the time required to recognize properties of graphs: A problem. SIGACT News, 5(4):15-16, 1973.
25. Y. Shi. Quantum lower bounds for the collision and the element distinctness problems. In Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pages 513-519, 2002.
26. D. Simon. On the power of quantum computation. SIAM Journal on Computing, 26(5):1474-1483, 1997.
27. M. Szegedy. On the quantum query complexity of detecting triangles in graphs. Technical Report quant-ph/0310107, arXiv archive, 2003.
28. E. Szemerédi. Regular partitions of graphs. Colloques Internationaux du CNRS, 260 - Problèmes combinatoires et théorie des graphes:399-401, 1976.
29. J. Watrous. Quantum simulations of classical random walks and undirected graph connectivity. Journal of Computer and System Sciences, 62(2):376-391, 2001.
30. A. Yao. Lower bounds to randomized algorithms for graph properties. In Proceedings of 28th IEEE Symposium on Foundations of Computer Science, pages 393-400, 1987.
31. A. Yao. Personal communication, 2003.
32. S. Zhang. On the power of Ambainis's lower bounds. In Proceedings of 31st International Colloquium on Automata, Languages and Programming, 2004. To appear.