Postdoc offers
Several openings are available in my group in classical and quantum computing.
For quantum computing, topics of interest include quantum algorithms for massive data, optimization, machine learning and cryptography. In case of interest, there will be also opportunities to collaborate with industrial partners.
For more information, please contacting me or visit the IRIF postdoc call webpage.
PhD/Master Thesis offers
If you woud like to apply for a thesis or an internship under my advising, please read the following intructions before contacting me.
PhD Thesis- Read some papers of my recent papers
- Attend some of the Master courses of the group or equivalent ones in other institutions
- Select one of the following topics you would like to work on
- Quantum computing: Introduction
- Streaming algorithms: Survey
- Property testing: Survey
Current and former students
PhD Theses- Dániel Szabó, Property testing, quantum computing and their connection
- Simona Etinski (co-advised with André Chailloux and Anthony Leverrier), Quantum protocols and algorithms
- 2021, Yassine Hamoudi (co-advised with Miklos Santha), Quantum Algorithms for the Monte Carlo Method
- 2021, Yixin Shen, Classical and Quantum Cryptanalysis for Euclidean Lattices and Subset Sums
- 2020, Alessandro Luongo (co-advised with Iordanis Kerenidis, Industrial PhD Thesis (CIFRE) with ATOS), Quantum machine learning algorithms
- 2015, Nathanaël François: Algorithms and Lower Bounds for variants of the Streaming Model
- 2014, Stacey Jeffery (informally co-advised with Michele Mosca): Frameworks for Quantum Algorithms
- 2013, Christian Konrad: Computations on Massive Data Sets: Streaming Algorithms and Two-Party Communication (PhD grant provided by CFM Fondation)
- 2011, Loïck Magnin (co-advised with Nicolas Cerf): Two-player interaction in quantum computing: cryptographic primitives & query complexity
- 2003, Sylvain Peyronnet (partly involved in the advising with Michel de Rougemont): Model checking et vérification probabiliste
- 2021 (M2 MPRI), Maël Luce: Avantage quantique dans le modèle CONGEST du calcul distribué
- 2011 (M2 MPRI), Nathanaël François: Vérification des files de priorité dans le modèle de streaming
- 2010 (U. Waterloo, EU-Canada exchange program), Stacey Jeffery: Collision finding with many classical or quantum processors
- 2008 (M2 MPRI), Omar Fawzi: Couplage maximum dans les modèles de streaming
- 2007 (M2 IF ENS-Lyon), Loïck Magnin: Mise en gage quantique avec des variables continues
- 2006 (M2 MPRI), Basile Couëtoux: Bornes inférieures de fonctions booléennes
- 2003 (DEA DIF ENS-Lyon), Pierre Philipps: Bornes inférieures en calcul quantique: Méthode par adversaire vs. méthode des polynômes
- 2002 (DEA Algo), Ke-Fong Lin: Calcul quantique par évolution adiabatique
- 2015 (MIM1 ENS-Lyon), Titouan Carette : Arbres de décision quantiques
- 2011 (L3 U. Montréal), Cynthia Beauchemin: Arbres de décision probabilistes, approche pratique et théorique
- 2010 (L3 ENS-Cachan), Elisa Rebolini: Alternative au théorème adabatique pour l'algorithme de Grover
- 2006 (MIM1 ENS-Lyon), Omar Fawzi: Primitives cryptographiques quantiques
- 2002 (MIM1 ENS-Lyon), Sylvain Périfel: Autour de la transformée de Fourier quantique
- 2001 (MIM1 ENS-Lyon), Pierre Philipps: Algorithmes de recherche et problème des collisions en calcul quantique