I am a second-year Ph.D. student, under the direction of Iordanis KERENIDIS from the Algorithm and Complexity team. I am working on developing new algorithms for long term and short term quantum computers. My speciality is quantum algorithms for machine learning. My main research consists in identifying classical machine learning algorithms that could potentially be adapted to the quantum computing framework with provable speedup.

We develop fundamental quantum circuits to process data, defining routines for linear algebra, graph, analytic computations. In my recent works I have been focused on developing:

  1. Quantum distance calculation between vectors in superposition with logarithmic dependence.
  2. Quantum convolution product between two 3D tensors.
  3. Neural Network Quantum backpropagation for convolution and pooling layers.
  4. Faster quantum tomography with $\ell_{\infty}$ norm guarantee.
  5. Quantum access to Adjency graph, Incidence graph and Laplacian graph with projection on its eigenspace.
  6. Partial Differential Equations solvers for near term quantum circuits (NISQ).

These routines are at the core of new quantum algorithm for unsupervised machine learning such as k-means clustering, gaussian mixture models, spectral clustering, as well as fully connected and convolutional neural networks and many others.

Contact

email : landman@irif.fr
address : Sophie Germain, IRIF, room 4059

Publications and preprints

Seminars and Conferences

Reviews

Education

  • École Polytechnique, Palaiseau, France
    2013-2018 Master degree (“Diplôme Polytechnicien”) in Electronics and Machine learning
  • UC Berkeley, California, USA
    Fall Semester 2017 : Visiting Scholar, Data Science and Entrepreneurship
  • Lycée Henri IV, Paris, France
    2011-2013 Classe Préparatoire

Awards