Iordanis Kerenidis

Iordanis Kerenidis

Auto-generated profile, based on publicly available information

Iordanis Kerenidis

Université de Paris, CNRS, IRIF, Paris, France

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 February 2020 in Physical Review A
Verified
Journal Article
Closed access
PDF file
IKIordanis Kerenidis
Iordanis Kerenidis
APAnupam Prakash
Anupam Prakash
Quantum machine learning and optimization are exciting new areas that have been brought forward by the breakthrough quantum algorithm of Harrow, Hassidim, and Lloyd for solving systems of linear equations. The utility of classical linear system solvers extends beyond linear algebra as they can be leveraged to solve optimization problems using iterative methods like gradient descent. In this work, we provide a quantum method for performing gradient descent when the gradient is an affine function. Performing τ steps of the gradient descent requires time O(τCS) for weighted least-squares problems, where CS is the cost of performing one step of the gradient descent quantumly, which at times can be considerably smaller than the classical cost. We illustrate our method by providing two applications: first, for solving positive semidefinite linear systems, and, second, for performing stochastic gradient descent for the weighted least-squares problem with reduced quantum memory requirements. We also provide a quantum linear system solver in the QRAM data structure model that provides significant savings in cost for large families of matrices.

15 April 2021 in Physical Review A
Verified
Journal Article
Closed access
PDF file
IKIordanis Kerenidis
Iordanis Kerenidis
JLJonas Landman
Jonas Landman
Spectral clustering is a powerful unsupervised machine learning algorithm for clustering data with nonconvex or nested structures [A. Y. Ng, M. I. Jordan, and Y. Weiss, On spectral clustering: Analysis and an algorithm, in Advances in Neural Information Processing Systems 14: Proceedings of the 2001 Conference (MIT Press, Cambridge, MA, 2002), pp. 849–856]. With roots in graph theory, it uses the spectral properties of the Laplacian matrix to project the data in a low-dimensional space where clustering is more efficient. Despite its success in clustering tasks, spectral clustering suffers in practice from a fast-growing running time of O(n3), where n is the number of points in the data set. In this work we propose an end-to-end quantum algorithm performing spectral clustering, extending a number of works in quantum machine learning. The quantum algorithm is composed of two parts: the first is the efficient creation of the quantum state corresponding to the projected Laplacian matrix, and the second consists of applying the existing quantum analog of the k-means algorithm [I. Kerenidis, J. Landman, A. Luongo, and A. Prakash, q-means: A quantum algorithm for unsupervised machine learning, in Advances in Neural Information Processing Systems 32: Proceedings of the 2019 Conference (Curran Associates, Red Hook, NY, 2020), pp. 4136–4146]. Both steps depend polynomially on the number of clusters, as well as precision and data parameters arising from quantum procedures, and polylogarithmically on the dimension of the input vectors. Our numerical simulations show an asymptotic linear growth with n when all terms are taken into account, significantly better than the classical cubic growth. This work opens the path to other graph-based quantum machine learning algorithms, as it provides routines for efficient computation and quantum access to the incidence, adjacency, and projected Laplacian matrices of a graph.

29 November 2023 in Quantum
Verified
Journal Article
Open access
PDF file
ECEl Amine Cherrat
El Amine Cherrat
SRSnehal Raj
Snehal Raj
IKIordanis Kerenidis
Iordanis Kerenidis
ASAbhishek Shekhar
Abhishek Shekhar
BWBen Wood
Ben Wood
MPMarco Pistoia
Marco Pistoia
Quantum machine learning has the potential for a transformative impact across industry sectors and in particular in finance. In our work we look at the problem of hedging where deep reinforcement learning offers a powerful framework for real markets. We develop quantum reinforcement learning methods based on policy-search and distributional actor-critic algorithms that use quantum neural network architectures with orthogonal and compound layers for the policy and value functions. We prove that the quantum neural networks we use are trainable, and we perform extensive simulations that show that quantum models can reduce the number of trainable parameters while achieving comparable performance and that the distributional approach obtains better performance than other standard approaches, both classical and quantum. We successfully implement the proposed models on a trapped-ion quantum processor, utilizing circuits with up to 16 qubits, and observe performance that agrees well with noiseless simulation. Our quantum techniques are general and can be applied to other reinforcement learning problems beyond hedging.

8 April 2021 in Quantum
Verified
Journal Article
Open access
PDF file
IKIordanis Kerenidis
Iordanis Kerenidis
APAnupam Prakash
Anupam Prakash
DSDániel Szilágyi
Dániel Szilágyi
Iordanis Kerenidis, Anupam Prakash, and Dániel Szilágyi, Quantum 5, 427 (2021). We present a quantum interior-point method (IPM) for second-order cone programming (SOCP) that runs in time…

19 July 2023 in Quantum Machine Intelligence
Verified
Journal Article
Closed access
PDF file
ECEl Amine Cherrat
El Amine Cherrat
IKIordanis Kerenidis
Iordanis Kerenidis
APAnupam Prakash
Anupam Prakash

12 September 2019 in Nature Communications
Verified
Journal Article
Open access
PDF file
NKNiraj Kumar
Niraj Kumar
IKIordanis Kerenidis
Iordanis Kerenidis
EDEleni Diamanti
Eleni Diamanti
Demonstrating a quantum advantage with currently available experimental systems is of utmost importance in quantum information science. While this remains elusive for quantum computation, the field of communication complexity offers the possibility to already explore and showcase this advantage for useful tasks. Here, we define such a task, the Sampling Matching problem, which is inspired by the Hidden Matching problem and features an exponential gap between quantum and classical protocols in the one-way communication model. Our problem allows by its conception a photonic implementation based on encoding in the phase of coherent states of light, the use of a fixed size linear optic circuit, and single-photon detection. This enables us to demonstrate in a proof-of-principle experiment an advantage in the transmitted information resource over the best known classical protocol, something impossible to reach for the original Hidden Matching problem. Our demonstration has implications in quantum verification and cryptographic settings.