Quantum Recommendation Systems

E. Rich, “User modeling via stereotypes*,” Cognitive science , vol. 3, no. 4, pp. 329–354, 1979

1979

Earlier work this paper cites.

A. Y. Kitaev, “Quantum measurements and the abelian stabilizer problem,” arXiv preprint quant-ph/9511026 , 1995

1995

Earlier work this paper cites.

C. H. Papadimitriou, H. Tamaki, P. Raghavan, and S. Vempala, “Latent semantic indexing: A probabilistic analysis,” in Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems . ACM, 1998, pp. 159–168

1998

Earlier work this paper cites.

D. Achlioptas and F. McSherry, “Fast computation of low rank matrix approximations,” in Proceedings of the thirty-third annual ACM symposium on Theory of computing . ACM, 2001, pp. 611–618

2001

Earlier work this paper cites.

Y. Azar, A. Fiat, A. Karlin, F. McSherry, and J. Saia, “Spectral analysis of data,” in Proceedings of the thirty-third annual ACM symposium on Theory of computing . ACM, 2001, pp. 619–626

2001

Earlier work this paper cites.

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

2002

Earlier work this paper cites.

L. Grover and T. Rudolph, “Creating superpositions that correspond to efficiently integrable probability distributions,” arXiv preprint quant-ph/0208112 , 2002

2002

Earlier work this paper cites.

G. Adomavicius and A. Tuzhilin, “Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions,” Knowledge and Data Engineering, IEEE Transactions on , vol. 17, no. 6, pp. 734–749, 2005

2005

Earlier work this paper cites.

B. Awerbuch, B. Patt-Shamir, D. Peleg, and M. Tuttle, “Improved recommendation systems,” in Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms . Society for Industrial and Applied Mathematics, 2005, pp. 1174–1183

2005

Cited alongside, same era.

R. M. Bell and Y. Koren, “Lessons from the netflix prize challenge,” ACM SIGKDD Explorations Newsletter , vol. 9, no. 2, pp. 75–79, 2007

2007

Cited alongside, same era.

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.

Y. Koren, R. Bell, and C. Volinsky, “Matrix factorization techniques for recommender systems,” Computer , no. 8, pp. 30–37, 2009

2009

Cited alongside, same era.

A. M. Childs, “On the relationship between continuous-and discrete-time quantum walk,” Communications in Mathematical Physics , vol. 294, no. 2, pp. 581–603, 2010

P. Jain, P. Netrapalli, and S. Sanghavi, “Low-rank matrix completion using alternating minimization,” in Proceedings of the forty-fifth annual ACM symposium on Theory of computing . ACM, 2013, pp. 665–674

2013

Later among the works it cites.

S. Lloyd, M. Mohseni, and P. Rebentrost, “Quantum algorithms for supervised and unsupervised machine learning,” Arxiv preprint:1307.0411 , 2013

2013

Later among the works it cites.

——, “Quantum self analysis,” Arxiv preprint:1307.1401 , 2013

2013

Later among the works it cites.

——, “Quantum support vector machine for big feature and big data classification,” Arxiv preprint:1307.0471 , 2013

2013

Later among the works it cites.

A. Prakash, “Quantum algorithms for linear algebra and machine learning,” Ph.D Thesis, University of California, Berkeley. , 2014

2014

Later among the works it cites.