| Quantum Recommendation Systems I Kerenidis, A Prakash Innovations in Theoretical Computer Science (ITCS), 2017, 2017 | 343 | 2017 |
| Exponential lower bound for 2-query locally decodable codes via a quantum argument I Kerenidis, R De Wolf Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003 | 289 | 2003 |
| Exponential separations for one-way quantum communication complexity, with applications to cryptography D Gavinsky, J Kempe, I Kerenidis, R Raz, R De Wolf Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 247 | 2007 |
| Competitive recommendation systems P Drineas, I Kerenidis, P Raghavan Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002 | 161 | 2002 |
| Quantum gradient descent for linear systems and least squares I Kerenidis, A Prakash Physical Review A 101 (2), 022316, 2020 | 149 | 2020 |
| q-means: A quantum algorithm for unsupervised machine learning I Kerenidis, J Landman, A Luongo, A Prakash Advances in Neural Information Processing Systems 32, 2019 | 143 | 2019 |
| Exponential separation of quantum and classical one-way communication complexity Z Bar-Yossef, TS Jayram, I Kerenidis Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004 | 122 | 2004 |
| Quantum Algorithms for Deep Convolutional Neural Networks I Kerenidis, J Landman, A Prakash EIGHTH INTERNATIONAL CONFERENCE ON LEARNING REPRESENTATIONS, 2019 | 103 | 2019 |
| Lower bounds on information complexity via zero-communication protocols and applications I Kerenidis, S Laplante, V Lerays, J Roland, D Xiao SIAM Journal on Computing 44 (5), 1550-1572, 2015 | 103 | 2015 |
| Shortcuts to quantum network routing E Schoute, L Mancinska, T Islam, I Kerenidis, S Wehner arXiv preprint arXiv:1610.05238, 2016 | 98 | 2016 |
| Experimental verification of multipartite entanglement in quantum networks W McCutcheon, A Pappa, BA Bell, A Mcmillan, A Chailloux, T Lawson, ... Nature communications 7 (1), 13251, 2016 | 97 | 2016 |
| A quantum interior point method for LPs and SDPs I Kerenidis, A Prakash ACM Transactions on Quantum Computing 1 (1), 1-32, 2020 | 87 | 2020 |
| Optimal quantum strong coin flipping A Chailloux, I Kerenidis 2009 50th Annual IEEE Symposium on Foundations of Computer Science, 527-533, 2009 | 86 | 2009 |
| Multipartite entanglement verification resistant against dishonest parties A Pappa, A Chailloux, S Wehner, E Diamanti, I Kerenidis Physical review letters 108 (26), 260502, 2012 | 71 | 2012 |
| Nonlocality and conflicting interest games A Pappa, N Kumar, T Lawson, M Santha, S Zhang, E Diamanti, I Kerenidis Physical review letters 114 (2), 020401, 2015 | 69 | 2015 |
| Optimal bounds for parity-oblivious random access codes A Chailloux, I Kerenidis, S Kundu, J Sikora New Journal of Physics 18 (4), 045003, 2016 | 65 | 2016 |
| Fully distrustful quantum bit commitment and coin flipping J Silman, A Chailloux, N Aharon, I Kerenidis, S Pironio, S Massar Physical review letters 106 (22), 220501, 2011 | 64 | 2011 |
| Quantum symmetrically-private information retrieval I Kerenidis, R de Wolf Information Processing Letters 90 (3), 109-114,, 2004 | 61 | 2004 |
| Prospects and challenges of quantum finance A Bouland, W van Dam, H Joorati, I Kerenidis, A Prakash arXiv preprint arXiv:2011.06492, 2020 | 57 | 2020 |
| Quantum classification of the MNIST dataset via slow feature analysis I Kerenidis, A Luongo Physical Review A, 2020, 2018 | 56* | 2018 |
Eleni DiamantiPermanent Researcher, CNRS, Université Pierre et Marie CurieVerified email at upmc.fr
