Quantum speed-up for unsupervised learning

Machine Learning

Volumn 90, Issue 2, 2013, Pages 261-287

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

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITÉ DE RENNES 1   (France)

Author keywords

Clustering; Grover's algorithm; Quantum information processing; Quantum learning; Unsupervised learning

Indexed keywords

CLUSTERING; GLOBAL COMMUNICATION; GROVER'S ALGORITHM; IMPROVE PERFORMANCE; MINIMUM SPANNING TREES; NEIGHBOURHOOD GRAPHS; QUANTUM LEARNING; QUANTUM-INFORMATION PROCESSING;

COMMUNICATION; LEARNING ALGORITHMS; QUANTUM THEORY; UNSUPERVISED LEARNING;

CLUSTERING ALGORITHMS;

EID: 84880558954     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-012-5316-5     Document Type: Article

References (69)

1. Aharonov, D., van Dam, W., Kempe, J., Landau, J., Lloyd, S., & Regev, O. (2004). Adiabatic quantum computation is equivalent to standard quantum computation. In Proceedings of 45th IEEE symposium on foundations of computer science (pp. 42-51).
2. Aïmeur, E., Brassard, G., & Gambs, S. (2006). Machine learning in a quantum world. In Proceedings of the 19th Canadian conference on artificial intelligence (pp. 433-444).
3. Aïmeur, E., Brassard, G., & Gambs, S. (2007). Quantum clustering algorithms. In Proceedings of the 24th international conference on machine learning (pp. 1-8).
4. Ambainis, A. (2003). Quantum walks and their algorithmic applications. International Journal of Quantum Information, 1(4), 507-518.
5. Angiulli, F., & Pizzuti, C. (2002). Fast outlier detection in high dimensional spaces. In Proceedings of the 6th European conference on principles and practice of knowledge discovery in databases (pp. 15-26).
6. Angluin, D. (1988). Queries and concept learning. Machine Learning, 2, 319-342.
7. Anguita, D., Ridella, S., Riviecco, F., & Zunino, R. (2003). Quantum optimization for training support vector machines. Neural Networks, 16(1), 763-770.
8. Bennett, C. H. (1973). Logical reversibility of computation. IBM Journal of Research and Development, 17, 525-532.
9. Bennett, C. H., & Wiesner, S. J. (1992). Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Physical Review Letters, 69, 2881-2884.
10. Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997). Strengths and weaknesses of quantum computing. SIAM Journal on Computing, 26(5), 1510-1523.
11. Bentley, J. L. (1975). Multidimensional binary search tree used for associative searching. Communications of the ACM, 18(9), 509-517.
12. Bespamyatnikh, S. N. (1998). An efficient algorithm for the three-dimensional diameter problem. In Proceedings of the 9th symposium on discrete algorithms (pp. 137-146).
13. Borůvka, O. (1926). O jistém problému minimálním. Práce Moravské Pří rodovědecké Společnosti, 3, 37-58.
14. Boyer, M., Brassard, G., Høyer, P., & Tapp, A. (1998). Tight bounds on quantum searching. Fortschritte der Physik, 46, 493-505.
15. Brassard, G. (2003). Quantum communication complexity. Foundations of Physics, 33(11), 1593-1616.
16. Brassard, G., & Høyer, P. (1997). An exact quantum polynomial-time algorithm for Simon's problem. In Proceedings of the 5th Israel symposium on theory of computing and systems (pp. 12-23).
17. Brassard, G., Høyer, P., & Tapp, A. (1998). Quantum counting. In Proceedings of the 25th international conference on automata, languages and programming (pp. 820-831).
18. Brassard, G., Høyer, P., Mosca, M., & Tapp, A. (2002). Quantum amplitude amplification and estimation. In S. J. Lomonaco Jr. (Ed.), Quantum computation and quantum information (pp. 53-74).
19. Brassard, G., Broadbent, A., & Tapp, A. (2005). Quantum pseudo-telepathy. Foundations of Physics, 35, 1877-1907.
20. Brassard, G., Dupuis, F., Gambs, S., & Tapp, A. (2011). An optimal quantum algorithm to approximate the mean and its application for approximating the median of a set of points over an arbitrary distance. arXiv:1106.4267.
21. Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000). LOF: identifying density-based local outliers. In Proceedings of the 2000 ACM SIGMOD international conference on management of data (pp. 93-104).
22. Broadbent, A., & Kashefi, E. (2009). Parallelizing quantum circuits. Theoretical Computer Science, 410(26), 2489-2510.
23. Buhrman, H., Cleve, R., Massar, S., & de Wolf, R. (2009). Non-locality and communication complexity. arXiv:0907.3584.
24. Cleve, R., van Dam, W., Nielsen, M., & Tapp, A. (1999). Quantum entanglement and the communication complexity of the inner product function. In Proceedings of the first NASA international conference on quantum computing and quantum communications (pp. 61-74).
25. Cox, T., & Cox, M. (1994). Multidimensional scaling. London: Chapman and Hall.
26. Dasgupta, S., & Long, P. M. (2005). Performance guarantee for hierarchical clustering. Journal of Computer and System Sciences, 70(4), 555-569.
27. de Wolf, R. (2002). Quantum communication and complexity. Theoretical Computer Science, 287(1), 337-353.
28. Dong, D., Chen, C., & Chen, Z. (2005). Quantum reinforcement learning. In Proceedings of the first international conference on advances in natural computation (pp. 686-689).
29. Dürr, C., & Høyer, P. (1996). A quantum algorithm for finding the minimum. arXiv:quant-ph/9607014.
30. Dürr, C., Heiligman, M., Høyer, P., & Mhalla, M. (2004). Quantum query complexity of some graph problems. In Proceedings of the 31st international conference on automata, languages and programming (pp. 481-493).
31. Ezhov, A. A., & Berman, G. P. (2003). Introduction to quantum neural technologies. Princeton: Rinton Press.
32. Farhi, E., Goldsone, J., Gutmann, S., & Sipser, M. (2000). Quantum computation by adiabatic evolution. arXiv:quant-ph/0001106.
33. Finocchiaro, D. V., & Pellegrini, M. (2002). On computing the diameter of a point set in high dimensional Euclidean space. Theoretical Computer Science, 287(2), 501-514.
34. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman.
35. Giovannetti, V., Lloyd, S., & Maccone, L. (2008). Architectures for a quantum random access memory. Physical Review A, 78(5), 052310.
36. González, T. F. (1985). Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38, 293-306.
37. Gower, J. C., & Ross, G. J. S. (1969). Minimum spanning trees and single linkage cluster analysis. Applied Statistics, 18(1), 54-64.
38. Grover, L. K. (1997). Quantum mechanics helps in searching for a needle in a haystack. Physical Review Letters, 79(2), 325-328.
39. Grover, L. K. (1998). A framework for fast quantum mechanical algorithms. In Proceedings of the 30th ACM symposium on theory of computing (pp. 53-62).
40. Harel, D., & Koren, Y. (2001). On clustering using random walks. In Proceedings of the 21st conference on foundations of software technology and theoretical computer science (pp. 18-41).
41. Holevo, A. S. (1973). Bounds for the quantity of information transmitted by a quantum mechanical channel. Problems of Information Transmission, 9, 177-183.
42. Horn, D., & Gottlieb, A. (2001). The method of quantum clustering. In Proceedings of the neural information processing systems (pp. 769-776).
43. Horn, D., & Gottlieb, A. (2002). Algorithms for data clustering in pattern recognition problems based on quantum mechanics. Physical Review Letters, 88(1), 018702.
44. 1 -norm and related methods (pp. 405-416).
45. Kempe, J. (2003). Quantum random walks - An introductory overview. Contemporary Physics, 44(4), 307-327.
46. Kibriya, A. M., & Frank, E. (2007). An empirical comparison of exact nearest neighbour algorithms. In Proceedings of the 11th European conference on principles and practice of knowledge discovery in databases (pp. 140-151).
47. Kushilevitz, E., & Nisan, N. (1997). Communication complexity. Cambridge: Cambridge University Press.
48. Li, Q., He, Y., & Jiang, J.-p. (2009). A novel clustering algorithm based on quantum games. Journal of Physics A: Mathematical and Theoretical, 42, 445303.
49. Li, Q., He, Y., & Jiang, J.-p. (2011). A hybrid classical-quantum clustering algorithm based on quantum walks. Quantum Information Processing, 10(1), 13-26.
50. Lloyd, S. P. (1982). Least square quantization in PCM. IEEE Transactions on Information Theory, 28(2), 129-137. First made available as a Bell Telephone Laboratories Paper (1957).
51. Magniez, F., Nayak, A., Roland, J., & Sántha, M. (2007). Search via quantum walk. In Proceedings of the 39th ACM symposium on theory of computing (pp. 575-584).
52. Massart, D. L., Kaufman, L., & Rousseeuw, P. J. (1986). Least median of squares: a robust method for outlier and model error detection in regression and calibration. Analytica Chimica Acta, 187, 171-179.
53. Mishra, N., Oblinger, D., & Pitt, L. (2001). Sublinear time approximate clustering. In Proceedings of the 12th symposium on discrete algorithms (pp. 439-447).
54. Nayak, A., & Wu, F. (1999). The quantum query complexity of approximating the median and related statistics. In Proceedings of the 31st ACM symposium on theory of computing (pp. 384-393).
55. Nielsen, M. A., & Chuang, I. L. (2000). Quantum computation and quantum information. Cambridge: Cambridge University Press.
56. Papadimitriou, C. H. (1981). Worst-case and probabilistic analysis of a geometric location problem. SIAM Journal on Computing, 10(3), 542-557.
57. Preparata, F. P., & Shamos, M. I. (1985). Computational geometry: an introduction. New York: Springer.
58. Prim, R. C. (1957). Shortest connecting networks and some generalizations. The Bell System Technical Journal, 36(6), 1389-1401.
59. Raussendorf, R., & Briegel, H. J. (2001). A one-way quantum computer. Physical Review Letters, 88(22), 5188-5191.
60. Sántha, M. (2008). Quantum walk based search algorithms. In Proceedings of 5th international conference on theory and applications of models of computation (pp. 31-46).
61. Servedio, R. (2001). Separating quantum and classical learning. In Proceedings of the 28th international conference on automata, languages and programming (pp. 1065-1080).
62. Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Journal on Computing, 26(5), 1484-1509.
63. Szegedy, M. (2004). Quantum speed-up of Markov chain based algorithms. In Proceedings of 45th IEEE symposium on foundations of computer science (pp. 32-41).
64. Tenenbaum, J. B., de Silva, V., & Langford, J. C. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500), 2319-2323.
65. Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27, 1134-1142.
66. Witten, I. H., & Frank, E. (2005). Data mining: practical machine learning tools and techniques (2nd ed.). San Mateo: Morgan Kaufmann.
67. Yamanishi, K., Takeuchi, J., Williams, G. J., & Milne, P. (2004). On-line unsupervised outlier detection using finite mixtures with discounting learning algorithms. Data Mining and Knowledge Discovery, 8(3), 275-300.
68. Yu, Y., Qian, F., & Liu, H. (2010). Quantum clustering-based weighted linear programming support vector regression for multivariable nonlinear problem. Soft Computing, 14(9), 921-929.
69. Zahn, C. T. (1971). Graph-theoretical methods for detecting and describing gestalt clusters. IEEE Transactions on Computers, 20(1), 68-86.