General information
Offer title : PhD Student (M/F) at IRIF - Algorithms and complexity related to quantum computing (H/F)
Reference : UMR8243-FREMAG2-017
Number of position : 3
Workplace : PARIS 13
Date of publication : 03 May 2024
Type of Contract : PhD Student contract / Thesis offer
Contract Period : 36 months
Start date of the thesis : 1 September 2024
Proportion of work : Full time
Remuneration : 2 135,00 € gross monthly
Section(s) CN : Information sciences: bases of information technology, calculations, algorithms, representations, uses
Description of the thesis topic
The Algorithms and Complexity group at IRIF (CNRS, Université Paris-Cité) in Paris, France, invites candidates to apply for several doctoral funding opportunities to work on topics related to the theory of quantum computing.
Candidates with expertise in quantum computing or theoretical computer science in general are encouraged to apply.
Several topics are available, each bridging existing algorithmics with its extensions to quantum computing, including primarily (in alphabetical order):
- Streaming algorithms
- Approximation algorithms for clustering in high-dimensional Euclidean spaces
- Machine learning
- Distributed computing
- Complexity (communication, queries, memory)
- Continuous optimization
The specific topic can be refined based on the candidates' skills.
Work Context
The group has expertise in quantum algorithms and quantum complexity theory, and its permanent members include personalities such as Simon Apers, Geoffroy Couteau, Pierre Fraigniaud, Iordanis Kerenidis, Sophie Laplante, Frédéric Magniez, Claire Mathieu, Miklos Santha, and Adrian Vladu.
The position is located in a sector under the protection of scientific and technical potential (PPST), and therefore requires, in accordance with the regulations, that your arrival is authorized by the competent authority of the MESR.