Iordanis Kerenidis

According to our database1, Iordanis Kerenidis authored at least 54 papers between 2001 and 2022.

Collaborative distances:



In proceedings 
PhD thesis 




Low depth algorithms for quantum amplitude estimation.
Quantum, 2022

Quantum Vision Transformers.
CoRR, 2022

Quantum Reinforcement Learning via Policy Iteration.
CoRR, 2022

Quantum machine learning with subspace states.
CoRR, 2022

Quantum algorithms for Second-Order Cone Programming and Support Vector Machines.
Quantum, 2021

Quantum Expectation-Maximization for Gaussian mixture models.
Proceedings of the 37th International Conference on Machine Learning, 2020

Quantum Algorithms for Deep Convolutional Neural Networks.
Proceedings of the 8th International Conference on Learning Representations, 2020

Multi-Party Protocols, Information Complexity and Privacy.
ACM Trans. Comput. Theory, 2019

q-means: A quantum algorithm for unsupervised machine learning.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Quantum Algorithms for Portfolio Optimization.
Proceedings of the 1st ACM Conference on Advances in Financial Technologies, 2019

Quantum algorithms for feedforward neural networks.
CoRR, 2018

A Quantum Interior Point Method for LPs and SDPs.
CoRR, 2018

Quantum classification of the MNIST dataset via Slow Feature Analysis.
CoRR, 2018

Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment.
SIAM J. Comput., 2017

Learning with Errors is easy with quantum samples.
CoRR, 2017

Quantum Recommendation Systems.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias.
SIAM J. Comput., 2016

Information cost of quantum communication protocols.
Quantum Inf. Comput., 2016

Streaming Communication Protocols.
Electron. Colloquium Comput. Complex., 2016

Shortcuts to quantum network routing.
CoRR, 2016

QMA with Subset State Witnesses.
Chic. J. Theor. Comput. Sci., 2016

Quantum commitments from complexity assumptions.
Comput. Complex., 2016

Pointer Quantum PCPs and Multi-Prover Games.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2015

Relative Discrepancy does not separate Information and Communication Complexity.
Electron. Colloquium Comput. Complex., 2015

New Constructions for Quantum Money.
Proceedings of the 10th Conference on the Theory of Quantum Computation, 2015

Privacy in Quantum Communication Complexity.
CoRR, 2014

Optimal Bounds for Parity-Oblivious Random Access Codes with Applications.
Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

Lower bounds for quantum oblivious transfer.
Quantum Inf. Comput., 2013

New lower bounds for privacy in communication protocols.
Electron. Colloquium Comput. Complex., 2013

On the Power of a Unique Quantum Witness.
Theory Comput., 2012

Long distance quantum cryptography made simple.
Quantum Inf. Comput., 2012

Lower bounds on information complexity via zero-communication protocols and applications.
Electron. Colloquium Comput. Complex., 2012

A Quantum Protocol for Sampling Correlated Equilibria Unconditionally and without a Mediator.
Proceedings of the Theory of Quantum Computation, 2012

Non-local box complexity and secure function evaluation.
Quantum Inf. Comput., 2011

Weak Coin Flipping in a Device-Independent Setting.
Proceedings of the Theory of Quantum Computation, Communication, and Cryptography, 2011

Optimal Bounds for Quantum Bit Commitment.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

Quantum multiparty communication complexity and circuit lower bounds.
Math. Struct. Comput. Sci., 2009

Optimal Quantum Strong Coin Flipping.
Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography.
SIAM J. Comput., 2008

Increasing the power of the verifier in Quantum Zero Knowledge.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Statistical Zero Knowledge and quantum one-way functions.
Theor. Comput. Sci., 2007

The role of help in Classical and Quantum Zero-Knowledge.
IACR Cryptol. ePrint Arch., 2007

Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model.
IACR Cryptol. ePrint Arch., 2007

Exponential separations for one-way quantum communication complexity, with applications to cryptography.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Introduction to Quantum Information Theory.
Proceedings of the Information Theoretic Security - Second International Conference, 2007

The one-way communication complexity of the Boolean Hidden Matching Problem.
Electron. Colloquium Comput. Complex., 2006

Exponential lower bound for 2-query locally decodable codes via a quantum argument.
J. Comput. Syst. Sci., 2004

Quantum symmetrically-private information retrieval.
Inf. Process. Lett., 2004

Weak coin flipping with small bias.
Inf. Process. Lett., 2004

Exponential Separation of Quantum and Classical One-Way Communication Complexity
Electron. Colloquium Comput. Complex., 2004

Exponential Lower Bound for 2-Query Locally Decodable Codes
Electron. Colloquium Comput. Complex., 2002

Competitive recommendation systems.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

Quantum Clock Synchronization with one qubit
CoRR, 2001