Iordanis Kerenidis
Iordanis Kerenidis
CNRS Senior Researcher & QC WARE
Verified email at irif.fr
TitleCited byYear
Exponential lower bound for 2-query locally decodable codes via a quantum argument
I Kerenidis, R De Wolf
Journal of Computer and System Sciences 69 (3), 395-420, 2004
2502004
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
1852007
Competitive recommendation systems
P Drineas, I Kerenidis, P Raghavan
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
1472002
Quantum Recommendation Systems
I Kerenidis, A Prakash
Innovations in Theoretical Computer Science, 2017
912017
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
902015
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
902004
Optimal quantum strong coin flipping
A Chailloux, I Kerenidis
2009 50th Annual IEEE Symposium on Foundations of Computer Science, 527-533, 2009
652009
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
532015
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
48*2011
Quantum symmetrically-private information retrieval
I Kerenidis, R de Wolf
Information Processing Letters 90 (3), 109-114,, 2004
462004
Optimal bounds for quantum bit commitment
A Chailloux, I Kerenidis
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 354-362, 2011
432011
Experimental verification of multipartite entanglement in quantum networks
W McCutcheon, A Pappa, BA Bell, A McMillan, A Chailloux, T Lawson, ...
Nature communications 7 (1), 1-8, 2016
412016
Multipartite entanglement verification resistant against dishonest parties
A Pappa, A Chailloux, S Wehner, E Diamanti, I Kerenidis
Physical review letters 108 (26), 260502, 2012
362012
Quantum gradient descent for linear systems and least squares
I Kerenidis, A Prakash
Physical Review A 101 (2), 022316, 2020
342020
Lower bounds for quantum oblivious transfer
A Chailloux, I Kerenidis, J Sikora
Quantum Information and Computation, 2012
342012
Exponential separation of quantum and classical one-way communication complexity
Z Bar-Yossef, TS Jayram, I Kerenidis
SIAM Journal on Computing 38 (1), 366-384, 2008
342008
Experimental plug and play quantum coin flipping
A Pappa, P Jouguet, T Lawson, A Chailloux, M Legré, P Trinkler, ...
Nature communications 5 (1), 1-8, 2014
332014
Weak coin flipping with small bias
I Kerenidis, A Nayak
Information Processing Letters 89 (3), 131-135, 2004
322004
Communication complexity of conditional disclosure of secrets and attribute-based encryption
R Gay, I Kerenidis, H Wee
Annual Cryptology Conference, 485-502, 2015
302015
Optimal bounds for parity-oblivious random access codes
A Chailloux, I Kerenidis, S Kundu, J Sikora
New Journal of Physics 18 (4), 045003, 2016
242016
The system can't perform the operation now. Try again later.
Articles 1–20