q-means: A quantum algorithm for unsupervised machine learning

S. Lloyd, “Least squares quantization in pcm,” IEEE transactions on information theory , vol. 28, no. 2, pp. 129–137, 1982

1982

Earlier work this paper cites.

C. Durr and P. Hoyer, “A quantum algorithm for finding the minimum,” arXiv preprint quant-ph/9607014 , 1996

1996

Earlier work this paper cites.

D. Achlioptas and F. McSherry, “Fast computation of low rank matrix approximations,” in Proceedings of the 33rd Annual Symposium on Theory of Computing, 611-618, 2001

2001

Earlier work this paper cites.

J. Friedman, T. Hastie, and R. Tibshirani, The elements of statistical learning . Springer series in statistics New York, NY, USA:, 2001, vol. 1, no. 10

2001

Earlier work this paper cites.

M. A. Nielsen and I. Chuang, “Quantum computation and quantum information,” 2002

2002

Earlier work this paper cites.

G. Brassard, P. Hoyer, M. Mosca, and A. Tapp, “Quantum amplitude amplification and estimation,” Contemporary Mathematics , vol. 305, pp. 53–74, 2002

2002

Earlier work this paper cites.

P. Drineas, I. Kerenidis, and P. Raghavan, “Competitive recommendation systems,” in Proceedings of the thiry-fourth annual ACM symposium on Theory of computing . ACM, 2002, pp. 82–90

2002

Earlier work this paper cites.

A. Frieze, R. Kannan, and S. Vempala, “Fast monte-carlo algorithms for finding low-rank approximations,” Journal of the ACM (JACM) , vol. 51, no. 6, pp. 1025–1041, 2004

2004

Earlier work this paper cites.

P. Drineas, A. Frieze, R. Kannan, S. Vempala, and V. Vinay, “Clustering large graphs via the singular value decomposition,” Machine learning , vol. 56, no. 1-3, pp. 9–33, 2004

2004

Earlier work this paper cites.

D. Arthur and S. Vassilvitskii, “How slow is the k-means method?” in Proceedings of the twenty-second annual symposium on Computational geometry . ACM, 2006, pp. 144–153

2006

Earlier work this paper cites.

D. Arthur and S. Vassilvitskii, “k-means++: The advantages of careful seeding,” in Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms . Society for Industrial and Applied Mathematics, 2007, pp. 1027–1035

2007

Earlier work this paper cites.

A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,” Physical review letters , vol. 103, no. 15, p. 150502, 2009

2009

Cited alongside, same era.

A. Ambainis, “Variable time amplitude amplification and quantum algorithms for linear algebra problems,” in STACS’12 (29th Symposium on Theoretical Aspects of Computer Science) , vol. 14. LIPIcs, 2012, pp. 636–647

2012

Cited alongside, same era.

S. Lloyd, M. Mohseni, and P. Rebentrost, “Quantum algorithms for supervised and unsupervised machine learning,” arXiv , vol. 1307.0411, pp. 1–11, 7 2013. [Online]. Available: http://arxiv.org/abs/1307.0411

Original

2013

Cited alongside, same era.

E. Aïmeur, G. Brassard, and S. Gambs, “Quantum speed-up for unsupervised learning,” Machine Learning , vol. 90, no. 2, pp. 261–287, 2013

2013

Cited alongside, same era.

I. Kerenidis and A. Prakash, “Quantum gradient descent for linear systems and least squares,” arXiv:1704.04992 , 2017

Original

2017

Later among the works it cites.

J. Otterbach, R. Manenti, N. Alidoust, A. Bestwick, M. Block, B. Bloom, S. Caldwell, N. Didier, E. S. Fried, S. Hong et al. , “Unsupervised machine learning on a hybrid quantum computer,” arXiv preprint arXiv:1712.05771 , 2017

Original

2017

Later among the works it cites.

S. Chakraborty, A. Gilyén, and S. Jeffery, “The power of block-encoded matrix powers: improved regression techniques via faster Hamiltonian simulation,” arXiv preprint arXiv:1804.01973 , 2018

Original

2018

Closest in time.

J. Allcock, C.-Y. Hsieh, I. Kerenidis, and S. Zhang, “Quantum algorithms for feedforward neural networks,” Manuscript, 2018

2018

Closest in time.

I. Kerenidis and A. Luongo, “Quantum classification of the MNIST dataset via slow feature analysis,” arXiv preprint arXiv:1805.08837 , 2018