Organisation/Company: CNRS
Department: Institut de Recherche en Informatique Fondamentale
Research Field: Computer science Mathematics » Algorithms
Researcher Profile: First Stage Researcher (R1)
Country: France
Application Deadline: 25 Nov 2024 - 23:59 (UTC)
Type of Contract: Temporary
Job Status: Full-time
Hours Per Week: 35
Offer Starting Date: 1 Apr 2025
Is the job funded through the EU Research Framework Programme? Not funded by a EU programme
Is the Job related to staff position within a Research Infrastructure? No
Offer Description The Algorithms & Complexity group at IRIF (CNRS, Université Paris-Cité) in Paris (France) invites applications for one fully funded postdoc position (6 months) to work on the theory of quantum computing.
Responsibilities:
Research within the lines of the Algorithms & Complexity group
Participation in the research seminar & group discussions
Advising interns and collaborating with PhD students
The group has expertise in quantum algorithms and quantum complexity theory, and includes permanent members such as Simon Apers, Christina Boura, Geoffroy Couteau, Pierre Fraigniaud, Iordanis Kerenidis, Sophie Laplante, Frédéric Magniez, Claire Mathieu, Michele Orru, David Saulpic, and Adrian Vladu.
The position is in a sector related to the protection of scientific and technical potential (PPST), and therefore, in accordance with regulations, your arrival must be authorized by the competent authority of the Ministry of Higher Education and Research (MNESR).
Minimum Requirements:
PhD in theoretical computer science or a related field
Ability to lead a research project independently
Writing scientific papers and presenting work in seminars
Organizational and collaboration skills
Strong academic proficiency in English (C1 level)
Expertise in quantum computing is an advantage
Additional Comments:
The position is subject to a security clearance for work on topics identified as strategic by the Ministry of Research.
#J-18808-Ljbffr