Quantum clustering algorithms

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 1-8

  Aïmeur, Esma ^a   Brassard, Gilles ^a   Gambs, Sébastien ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; LEARNING SYSTEMS; QUANTUM THEORY;

NEIGHBOURHOOD GRAPHS; QUANTUM ALGORITHMS;

CLUSTERING ALGORITHMS;

EID: 34547996993     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273497     Document Type: Conference Paper

References (27)

1. Aïmeur, E., Brassard, G. & Gambs, S. (2006). Machine learning in a quantum world. Proceedings of Canadian AI 2006 (pp. 433-444).
2. Ambainis, A. (2003). Quantum walks and their algorithmic applications. International Journal of Quantum Information, 1, 507-518.
3. Angluin, D. (1988). Queries and concept learning. Machine Learning, 2, 319-342.
4. Bell, J. (1964). On the Einstein-Podolsky-Rosen paradox. Physics, 1(3), 195-200.
5. Bennett, C. H. & Brassard, G. (1984). Quantum cryptography: Public key distribution and coin tossing. Proceedings of the IEEE Conference on Computers, Systems and Signal Processing, Bangalore, India (pp. 175-179).
6. Bentley, J. L. (1975). Multidimensional binary search trees used for associative searching. Communications of the ACM, 18(9), 509-517.
7. Bonner, R. & Freivalds, R. (2002). A survey of quantum learning. Proceedings of the Workshop on Quantum Computation and Learning (pp. 106-119).
8. Borůvka, O. (1926). O jistém problému minimálním. Práce Moravské Př irodovědecké Společnosti, 3, 37-58.
9. Boyer, M., Brassard, G., Høyer, P. & Tapp, A. (1998). Tight bounds on quantum searching. Fortschritte Der Physik, 46, 493-505.
10. Brassard, G., Høyer, P., Mosca, M. & Tapp, A. (2002). Quantum amplitude amplification and estimation. Contemporary Mathematics, 305, 53-74.
11. Dürr, C., Heiligman, M., Høyer, P. & Mhalla, M. (2004). Quantum query complexity of some graph problems. Proceedings of the International Conference on Automata, Languages and Programming: ICALP'04 (pp. 481-493).
12. Dürr, C. & Høyer, P. (1996). A quantum algorithm for finding the minimum. Available on http://arxiv.org/quant-ph/9607014.
13. Einstein, A., Podolsky, B. & Rosen, N. (1935). Can quantum mechanical description of physical reality be considered complete? Physical Review, 47, 777-780.
14. Grover, L. K. (1997). Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters, 79(2), 325-328.
15. Grover, L. K. (1998). A framework for fast quantum mechanical algorithms. Proceedings of the 30th ACM Symposium on Theory of Computing: STOC'98 (pp. 53-62).
16. Harel, D. & Koren, Y. (2001). On clustering using random walks. Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS'01 (pp. 18-41).
17. Horn, D. & Gottlieb, A. (2001). The method of quantum clustering. Proceedings of the Neural Information Processing Systems: NIPS'01 (pp. 769-776).
18. Horn, D. & Gottlieb, A. (2002). Algorithm for data clustering in pattern recognition problems based on quantum mechanics. Physical Review Letters, 88(1).
19. 1-Norm and Related Methods, Y. Dodge (editor), North-Holland, Amsterdam (pp. 405-416).
20. Mishra, N., Oblinger, D. & Pitt, L. (2001). Sub-linear time approximate clustering. Proceedings of 12th ACM-SIAM Symposium on Discrete Algorithms: SODA'01 (pp. 439-447).
21. Nayak, A. & Wu, F. (1999). The quantum query complexity of approximating the median and related statistics. Proceedings of the 31st ACM Symposium, on Theory of Computing: STOC'99 (pp. 384-393).
22. Nielsen, M. & Chuang, I. (Eds.). (2000). Quantum Computation and Quantum, Information. Cambridge University Press.
23. Servedio, R. (2001). Separating quantum and classical learning. Proceedings of the International Conference on Automata, Languages and Programming: ICALP'01 (pp. 1065-1080).
24. Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal of Computing, 26, 1484-1509.
25. Small, C. G. (1990). A survey of multidimensional medians. International Statistical Review, 58(3), 263-277.
26. Szegedy, M. (2004). Quantum speed-up of Markov chain based algorithms. Proceedings of 45th IEEE Symposium on Foundations of Computer Science: FOCS'04 (pp. 32-41).
27. Tenenbaum, J. B., de Silva, V. & Langford, J. C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290, 2319-2323.