Iordanis Kerenidis

André J. Ferreira-Martins

Quantum Mach. Intell., December, 2023

Quantum Deep Hedging.

[BibT_eX]

[DOI]

Shouvanik Chakrabarti

Quantum, November, 2023

Improved Financial Forecasting via Quantum Machine Learning.

[BibT_eX]

[DOI]

Samurai Brito

CoRR, 2023

2022

Quantum Methods for Neural Networks and Application to Medical Image Classification.

[BibT_eX]

[DOI]

Quantum, September, 2022

Low depth algorithms for quantum amplitude estimation.

[BibT_eX]

[DOI]

Quantum, 2022

Quantum machine learning with subspace states.

[BibT_eX]

[DOI]

CoRR, 2022

2021

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

[BibT_eX]

[DOI]

Dániel Szilágyi

Quantum, 2021

2020

Quantum Expectation-Maximization for Gaussian mixture models.

[BibT_eX]

[DOI]

Alessandro Luongo

Proceedings of the 37th International Conference on Machine Learning, 2020

Quantum Algorithms for Deep Convolutional Neural Networks.

[BibT_eX]

[DOI]

Jonas Landman

Proceedings of the 8th International Conference on Learning Representations, 2020

2019

Multi-Party Protocols, Information Complexity and Privacy.

[BibT_eX]

[DOI]

Adi Rosén

Florent Urrutia

ACM Trans. Comput. Theory, 2019

q-means: A quantum algorithm for unsupervised machine learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Quantum Algorithms for Portfolio Optimization.

[BibT_eX]

[DOI]

Dániel Szilágyi

Proceedings of the 1st ACM Conference on Advances in Financial Technologies, 2019

2018

Quantum algorithms for feedforward neural networks.

[BibT_eX]

[DOI]

CoRR, 2018

A Quantum Interior Point Method for LPs and SDPs.

[BibT_eX]

[DOI]

CoRR, 2018

Quantum classification of the MNIST dataset via Slow Feature Analysis.

[BibT_eX]

[DOI]

Alessandro Luongo

CoRR, 2018

2017

Physical Limitations of Quantum Cryptographic Primitives or Optimal Bounds for Quantum Coin Flipping and Bit Commitment.

[BibT_eX]

[DOI]

SIAM J. Comput., 2017

Learning with Errors is easy with quantum samples.

[BibT_eX]

[DOI]

Alex Bredariol Grilo

CoRR, 2017

Quantum Recommendation Systems.

[BibT_eX]

[DOI]

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016

A Simpler Proof of the Existence of Quantum Weak Coin Flipping with Arbitrarily Small Bias.

[BibT_eX]

[DOI]

SIAM J. Comput., 2016

Information cost of quantum communication protocols.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2016

Streaming Communication Protocols.

[BibT_eX]

[DOI]

Lucas Boczkowski

Frédéric Magniez

Electron. Colloquium Comput. Complex., 2016

Shortcuts to quantum network routing.

[BibT_eX]

[DOI]

CoRR, 2016

QMA with Subset State Witnesses.

[BibT_eX]

[DOI]

Alex B. Grilo

Jamie Sikora

Chic. J. Theor. Comput. Sci., 2016

Quantum commitments from complexity assumptions.

[BibT_eX]

[DOI]

Bill Rosgen

Comput. Complex., 2016

Pointer Quantum PCPs and Multi-Prover Games.

[BibT_eX]

[DOI]

Alex Bredariol Grilo

Attila Pereszlényi

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015

Communication Complexity of Conditional Disclosure of Secrets and Attribute-Based Encryption.

[BibT_eX]

[DOI]

Romain Gay

Hoeteck Wee

IACR Cryptol. ePrint Arch., 2015

Relative Discrepancy does not separate Information and Communication Complexity.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2015

New Constructions for Quantum Money.

[BibT_eX]

[DOI]

Marios Georgiou

Proceedings of the 10th Conference on the Theory of Quantum Computation, 2015

2014

Privacy in Quantum Communication Complexity.

[BibT_eX]

[DOI]

CoRR, 2014

Optimal Bounds for Parity-Oblivious Random Access Codes with Applications.

[BibT_eX]

[DOI]

Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

2013

Lower bounds for quantum oblivious transfer.

[BibT_eX]

[DOI]

Jamie Sikora

Quantum Inf. Comput., 2013

New lower bounds for privacy in communication protocols.

[BibT_eX]

[DOI]

Mathieu Laurière

David Xiao

Electron. Colloquium Comput. Complex., 2013

2012

On the Power of a Unique Quantum Witness.

[BibT_eX]

[DOI]

Theory Comput., 2012

Long distance quantum cryptography made simple.

[BibT_eX]

[DOI]

Stephanie Wehner

Quantum Inf. Comput., 2012

Lower bounds on information complexity via zero-communication protocols and applications.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2012

A Quantum Protocol for Sampling Correlated Equilibria Unconditionally and without a Mediator.

[BibT_eX]

[DOI]

Shengyu Zhang

Proceedings of the Theory of Quantum Computation, 2012

2011

Non-local box complexity and secure function evaluation.

[BibT_eX]

[DOI]

Quantum Inf. Comput., 2011

Weak Coin Flipping in a Device-Independent Setting.

[BibT_eX]

[DOI]

Proceedings of the Theory of Quantum Computation, Communication, and Cryptography, 2011

Optimal Bounds for Quantum Bit Commitment.

[BibT_eX]

[DOI]

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2009

Quantum multiparty communication complexity and circuit lower bounds.

[BibT_eX]

[DOI]

Math. Struct. Comput. Sci., 2009

Optimal Quantum Strong Coin Flipping.

[BibT_eX]

[DOI]

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008

Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography.

[BibT_eX]

[DOI]

SIAM J. Comput., 2008

Increasing the power of the verifier in Quantum Zero Knowledge.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

2007

Statistical Zero Knowledge and quantum one-way functions.

[BibT_eX]

[DOI]

Elham Kashefi

Theor. Comput. Sci., 2007

The role of help in Classical and Quantum Zero-Knowledge.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2007

Exponential separations for one-way quantum communication complexity, with applications to cryptography.

[BibT_eX]

[DOI]

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Introduction to Quantum Information Theory.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - Second International Conference, 2007

2006

The one-way communication complexity of the Boolean Hidden Matching Problem.

[BibT_eX]

[DOI]

Ran Raz

Electron. Colloquium Comput. Complex., 2006

2004

Exponential lower bound for 2-query locally decodable codes via a quantum argument.

[BibT_eX]

[DOI]

Ronald de Wolf

J. Comput. Syst. Sci., 2004

Quantum symmetrically-private information retrieval.

[BibT_eX]

[DOI]

Ronald de Wolf

Inf. Process. Lett., 2004

Weak coin flipping with small bias.

[BibT_eX]

[DOI]

Ashwin Nayak

Inf. Process. Lett., 2004

Exponential Separation of Quantum and Classical One-Way Communication Complexity

[BibT_eX]

[DOI]

Ziv Bar-Yossef

T. S. Jayram

Electron. Colloquium Comput. Complex., 2004

2002

Exponential Lower Bound for 2-Query Locally Decodable Codes

[BibT_eX]

[DOI]

Ronald de Wolf

Electron. Colloquium Comput. Complex., 2002

Competitive recommendation systems.

[BibT_eX]

[DOI]

Petros Drineas

Prabhakar Raghavan

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

2001

Quantum Clock Synchronization with one qubit

[BibT_eX]

[DOI]

Chris Harrelson