Iordanis Kerenidis

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 44

Top Topics

Communication Protocols

Financial Forecasting

Gaussian Mixture

Top Venues

ACM Trans. Comput. Theory

SIAM J. Comput.

Publications

El Amine Cherrat, Iordanis Kerenidis, Natansh Mathur, Jonas Landman, Martin Strahm, Yun Yvonna Li
Quantum Vision Transformers. Quantum 8 (2024)
Sohum Thakkar, Skander Kazdaghli, Natansh Mathur, Iordanis Kerenidis, André J. Ferreira-Martins, Samurai Brito
Improved financial forecasting via quantum machine learning. Quantum Mach. Intell. 6 (1) (2024)
Brian Coyle, El Amine Cherrat, Nishant Jain, Natansh Mathur, Snehal Raj, Skander Kazdaghli, Iordanis Kerenidis
Training-efficient density quantum machine learning. CoRR (2024)
El Amine Cherrat, Iordanis Kerenidis, Anupam Prakash
Quantum reinforcement learning via policy iteration. Quantum Mach. Intell. 5 (2) (2023)
El Amine Cherrat, Snehal Raj, Iordanis Kerenidis, Abhishek Shekhar, Ben Wood, Jon Dee, Shouvanik Chakrabarti, Richard Chen, Dylan Herman, Shaohan Hu, Pierre Minssen, Ruslan Shaydulin, Yue Sun, Romina Yalovetzky, Marco Pistoia
Quantum Deep Hedging. Quantum 7 (2023)
El Amine Cherrat, Snehal Raj, Iordanis Kerenidis, Abhishek Shekhar, Ben Wood, Jon Dee, Shouvanik Chakrabarti, Richard Chen, Dylan Herman, Shaohan Hu, Pierre Minssen, Ruslan Shaydulin, Yue Sun, Romina Yalovetzky, Marco Pistoia
Quantum Deep Hedging. CoRR (2023)
Sohum Thakkar, Skander Kazdaghli, Natansh Mathur, Iordanis Kerenidis, André J. Ferreira-Martins, Samurai Brito
Improved Financial Forecasting via Quantum Machine Learning. CoRR (2023)
Iordanis Kerenidis, Anupam Prakash
Quantum machine learning with subspace states. CoRR (2022)
El Amine Cherrat, Iordanis Kerenidis, Natansh Mathur, Jonas Landman, Martin Strahm, Yun Yvonna Li
Quantum Vision Transformers. CoRR (2022)
Jonas Landman, Natansh Mathur, Yun Yvonna Li, Martin Strahm, Skander Kazdaghli, Anupam Prakash, Iordanis Kerenidis
Quantum Methods for Neural Networks and Application to Medical Image Classification. Quantum 6 (2022)
El Amine Cherrat, Iordanis Kerenidis, Anupam Prakash
Quantum Reinforcement Learning via Policy Iteration. CoRR (2022)
Tudor Giurgica-Tiron, Iordanis Kerenidis, Farrokh Labib, Anupam Prakash, William J. Zeng
Low depth algorithms for quantum amplitude estimation. Quantum 6 (2022)
Iordanis Kerenidis, Anupam Prakash, Dániel Szilágyi
Quantum algorithms for Second-Order Cone Programming and Support Vector Machines. Quantum 5 (2021)
Iordanis Kerenidis, Alessandro Luongo, Anupam Prakash
Quantum Expectation-Maximization for Gaussian mixture models. ICML (2020)
Iordanis Kerenidis, Jonas Landman, Anupam Prakash
Quantum Algorithms for Deep Convolutional Neural Networks. ICLR (2020)
Tudor Giurgica-Tiron, Iordanis Kerenidis, Farrokh Labib, Anupam Prakash, William J. Zeng
Low depth algorithms for quantum amplitude estimation. CoRR (2020)
Iordanis Kerenidis, Alessandro Luongo, Anupam Prakash
Quantum Expectation-Maximization for Gaussian Mixture Models. CoRR (2019)
Iordanis Kerenidis, Jonas Landman, Anupam Prakash
Quantum Algorithms for Deep Convolutional Neural Networks. CoRR (2019)
Iordanis Kerenidis, Anupam Prakash, Dániel Szilágyi
Quantum Algorithms for Portfolio Optimization. AFT (2019)
Iordanis Kerenidis, Adi Rosén, Florent Urrutia
Multi-Party Protocols, Information Complexity and Privacy. ACM Trans. Comput. Theory 11 (2) (2019)
Iordanis Kerenidis, Jonas Landman, Alessandro Luongo, Anupam Prakash
q-means: A quantum algorithm for unsupervised machine learning. NeurIPS (2019)
Iordanis Kerenidis, Anupam Prakash, Dániel Szilágyi
Quantum algorithms for Second-Order Cone Programming and Support Vector Machines. CoRR (2019)
Iordanis Kerenidis, Jonas Landman, Alessandro Luongo, Anupam Prakash
q-means: A quantum algorithm for unsupervised machine learning. CoRR (2018)
Iordanis Kerenidis, Alessandro Luongo
Quantum classification of the MNIST dataset via Slow Feature Analysis. CoRR (2018)
Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez
Streaming Communication Protocols. ACM Trans. Comput. Theory 10 (4) (2018)
Iordanis Kerenidis, Anupam Prakash
A Quantum Interior Point Method for LPs and SDPs. CoRR (2018)
Jonathan Allcock, Chang-Yu Hsieh, Iordanis Kerenidis, Shengyu Zhang
Quantum algorithms for feedforward neural networks. CoRR (2018)
Iordanis Kerenidis, Anupam Prakash
Quantum Recommendation Systems. ITCS (2017)
Alex Bredariol Grilo, Iordanis Kerenidis
Learning with Errors is easy with quantum samples. CoRR (2017)
André Chailloux, Iordanis Kerenidis
Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment. SIAM J. Comput. 46 (5) (2017)
Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez
Streaming Communication Protocols. ICALP (2017)
Iordanis Kerenidis, Anupam Prakash
Quantum Recommendation Systems. CoRR (2016)
Iordanis Kerenidis, Mathieu Laurière, Francois Le Gall, Mathys Rennela
Information cost of quantum communication protocols. Quantum Inf. Comput. 16 (3&4) (2016)
Iordanis Kerenidis, Adi Rosén, Florent Urrutia
Multi-Party Protocols, Information Complexity and Privacy. MFCS (2016)
Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez
Streaming Communication Protocols. Electron. Colloquium Comput. Complex. 23 (2016)
Alex Bredariol Grilo, Iordanis Kerenidis, Attila Pereszlényi
Pointer Quantum PCPs and Multi-Prover Games. MFCS (2016)
Alex B. Grilo, Iordanis Kerenidis, Jamie Sikora
QMA with Subset State Witnesses. Chic. J. Theor. Comput. Sci. 2016 (2016)
Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland
Relative Discrepancy Does Not Separate Information and Communication Complexity. ACM Trans. Comput. Theory 9 (1) (2016)
Eddie Schoute, Laura Mancinska, Tanvirul Islam, Iordanis Kerenidis, Stephanie Wehner
Shortcuts to quantum network routing. CoRR (2016)
André Chailloux, Iordanis Kerenidis, Bill Rosgen
Quantum commitments from complexity assumptions. Comput. Complex. 25 (1) (2016)
Alex Bredariol Grilo, Iordanis Kerenidis, Attila Pereszlényi
Pointer Quantum PCPs and Multi-Prover Games. CoRR (2016)
Dorit Aharonov, André Chailloux, Maor Ganz, Iordanis Kerenidis, Loïck Magnin
A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias. SIAM J. Comput. 45 (3) (2016)
Iordanis Kerenidis, Adi Rosén, Florent Urrutia
Multi-Party Protocols, Information Complexity and Privacy. CoRR (2016)
Lucas Boczkowski, Iordanis Kerenidis, Frédéric Magniez
Streaming Communication Protocols. CoRR (2016)
Marios Georgiou, Iordanis Kerenidis
New Constructions for Quantum Money. TQC (2015)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. SIAM J. Comput. 44 (5) (2015)
Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland
Relative Discrepancy Does not Separate Information and Communication Complexity. ICALP (1) (2015)
Lila Fontes, Rahul Jain, Iordanis Kerenidis, Sophie Laplante, Mathieu Laurière, Jérémie Roland
Relative Discrepancy does not separate Information and Communication Complexity. Electron. Colloquium Comput. Complex. 22 (2015)
Alex Bredariol Grilo, Iordanis Kerenidis, Jamie Sikora
QMA with Subset State Witnesses. MFCS (2) (2015)
Romain Gay, Iordanis Kerenidis, Hoeteck Wee
Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption. IACR Cryptol. ePrint Arch. 2015 (2015)
Romain Gay, Iordanis Kerenidis, Hoeteck Wee
Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption. CRYPTO (2) (2015)
Alex Bredariol Grilo, Iordanis Kerenidis, Jamie Sikora
QMA with subset state witnesses. CoRR (2014)
André Chailloux, Iordanis Kerenidis, Srijita Kundu, Jamie Sikora
Optimal Bounds for Parity-Oblivious Random Access Codes with Applications. TQC (2014)
Iordanis Kerenidis, Mathieu Laurière, François Le Gall, Mathys Rennela
Privacy in Quantum Communication Complexity. CoRR (2014)
André Chailloux, Iordanis Kerenidis, Jamie Sikora
Lower bounds for quantum oblivious transfer. Quantum Inf. Comput. 13 (1-2) (2013)
Iordanis Kerenidis, Mathieu Laurière, David Xiao
New Lower Bounds for Privacy in Communication Protocols. ICITS (2013)
Iordanis Kerenidis, Mathieu Laurière, David Xiao
New lower bounds for privacy in communication protocols. Electron. Colloquium Comput. Complex. 20 (2013)
Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang
On the Power of a Unique Quantum Witness. Theory Comput. 8 (1) (2012)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower bounds on information complexity via zero-communication protocols and applications CoRR (2012)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower bounds on information complexity via zero-communication protocols and applications. Electron. Colloquium Comput. Complex. 19 (2012)
Iordanis Kerenidis, Sophie Laplante, Virginie Lerays, Jérémie Roland, David Xiao
Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications. FOCS (2012)
Iordanis Kerenidis, Stephanie Wehner
Long distance quantum cryptography made simple. Quantum Inf. Comput. 12 (5-6) (2012)
Iordanis Kerenidis, Shengyu Zhang
A Quantum Protocol for Sampling Correlated Equilibria Unconditionally and without a Mediator. TQC (2012)
Nati Aharon, André Chailloux, Iordanis Kerenidis, Serge Massar, Stefano Pironio, Jonathan Silman
Weak Coin Flipping in a Device-Independent Setting. TQC (2011)
Marc Kaplan, Sophie Laplante, Iordanis Kerenidis, Jérémie Roland
Non-local box complexity and secure function evaluation. Quantum Inf. Comput. 11 (1&2) (2011)
André Chailloux, Iordanis Kerenidis, Bill Rosgen
Quantum Commitments from Complexity Assumptions. ICALP (1) (2011)
Iordanis Kerenidis, Shengyu Zhang
A quantum protocol for sampling correlated equilibria unconditionally and without a mediator CoRR (2011)
André Chailloux, Iordanis Kerenidis
Optimal Bounds for Quantum Bit Commitment. FOCS (2011)
André Chailloux, Iordanis Kerenidis, Jamie Sikora
Lower bounds for Quantum Oblivious Transfer. FSTTCS (2010)
Rahul Jain, Iordanis Kerenidis, Greg Kuperberg, Miklos Santha, Or Sattath, Shengyu Zhang
On the Power of a Unique Quantum Witness. ICS (2010)
Iordanis Kerenidis
Quantum multiparty communication complexity and circuit lower bounds. Math. Struct. Comput. Sci. 19 (1) (2009)
André Chailloux, Iordanis Kerenidis
Optimal Quantum Strong Coin Flipping. FOCS (2009)
Marc Kaplan, Iordanis Kerenidis, Sophie Laplante, Jérémie Roland
Non-Local Box Complexity and Secure Function Evaluation. FSTTCS (2009)
André Chailloux, Iordanis Kerenidis
Increasing the power of the verifier in Quantum Zero Knowledge. FSTTCS (2008)
André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. TCC (2008)
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography. SIAM J. Comput. 38 (5) (2008)
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
Exponential Separation of Quantum and Classical One-Way Communication Complexity. SIAM J. Comput. 38 (1) (2008)
Iordanis Kerenidis
Introduction to Quantum Information Theory. ICITS (2007)
André Chailloux, Iordanis Kerenidis
The role of help in Classical and Quantum Zero-Knowledge. IACR Cryptol. ePrint Arch. 2007 (2007)
Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf
Exponential separations for one-way quantum communication complexity, with applications to cryptography. STOC (2007)
André Chailloux, Dragos Florin Ciocan, Iordanis Kerenidis, Salil P. Vadhan
Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model. IACR Cryptol. ePrint Arch. 2007 (2007)
Iordanis Kerenidis
Quantum Multiparty Communication Complexity and Circuit Lower Bounds. TAMC (2007)
Elham Kashefi, Iordanis Kerenidis
Statistical Zero Knowledge and quantum one-way functions. Theor. Comput. Sci. 378 (1) (2007)
Iordanis Kerenidis, Ran Raz
The one-way communication complexity of the Boolean Hidden Matching Problem. Electron. Colloquium Comput. Complex. 13 (087) (2006)
Iordanis Kerenidis, Ran Raz
The one-way communication complexity of the Boolean Hidden Matching Problem CoRR (2006)
Iordanis Kerenidis, Ronald de Wolf
Exponential lower bound for 2-query locally decodable codes via a quantum argument. J. Comput. Syst. Sci. 69 (3) (2004)
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
Exponential Separation of Quantum and Classical One-Way Communication Complexity Electron. Colloquium Comput. Complex. (036) (2004)
Iordanis Kerenidis, Ashwin Nayak
Weak coin flipping with small bias. Inf. Process. Lett. 89 (3) (2004)
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
Exponential separation of quantum and classical one-way communication complexity. STOC (2004)
Iordanis Kerenidis, Ronald de Wolf
Quantum symmetrically-private information retrieval. Inf. Process. Lett. 90 (3) (2004)
Iordanis Kerenidis, Ronald de Wolf
Quantum Symmetrically-Private Information Retrieval CoRR (2003)
Iordanis Kerenidis, Ronald de Wolf
Exponential lower bound for 2-query locally decodable codes via a quantum argument. STOC (2003)
Iordanis Kerenidis, Ronald de Wolf
Exponential Lower Bound for 2-Query Locally Decodable Codes Electron. Colloquium Comput. Complex. (059) (2002)
Petros Drineas, Iordanis Kerenidis, Prabhakar Raghavan
Competitive recommendation systems. STOC (2002)
Iordanis Kerenidis, Ronald de Wolf
Exponential Lower Bound for 2-Query Locally Decodable Codes via a Quantum Argument CoRR (2002)
Chris Harrelson, Iordanis Kerenidis
Quantum Clock Synchronization with one qubit CoRR (2001)