Postdoc at IRIF in Quantum computing (M/F)

CNRS; France; Sur place; EUR 35 000 - 45 000; Plein temps

Résumé du poste

A leading research institute in France is seeking a postdoctoral researcher in the Algorithms & Complexity team. The successful candidate will conduct research on quantum computing theory and supervise interns. A PhD in theoretical computer science, strong English proficiency, and the ability to work independently are essential. The position is full-time, based in Paris, and offers several fully funded postdoctoral positions for 1-3 years.

Qualifications

• PhD in theoretical computer science or a related field is required.
• Ability to carry out a research project independently.
• Ability to write scientific articles and present work in seminars.
• Strong organizational and collaboration skills are essential.
• Good academic proficiency in English (C1) is required.
• Expertise in quantum computing is an asset.

Responsabilités

• Conduct research within the Algorithms & Complexity group.
• Participate in research seminars and group discussions.
• Supervise interns and collaborate with PhD students.

Connaissances

Independent research project management

Scientific writing

Collaboration skills

Strong organizational skills

Advanced English proficiency

Formation

PhD in theoretical computer science or related field

Description du poste

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 10 Dec 2025 - 23:59 (UTC) Type of Contract Temporary Job Status Full-time Hours Per Week 35 Offer Starting Date 1 Jun 2026 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 team at IRIF (CNRS, Université Paris Cité) in Paris (France) invites applications for several fully funded postdoctoral positions (1–3 years) to work on quantum computing theory.

Responsibilities

• Research within the Algorithms & Complexity group
• Participation in the research seminar and group discussions
• Supervision of interns and collaboration with PhD students

The team has strong expertise in quantum algorithms and quantum complexity theory, and its permanent members include Simon Apers, Geoffroy Couteau, Pierre Fraigniaud, Iordanis Kerenidis, Sophie Laplante, Frédéric Magniez, Claire Mathieu, Miklos Santha, and Adrian Vladu.

Qualifications

• PhD in theoretical computer science or a related field
• Ability to carry out a research project independently
• Ability to write scientific articles and present work in seminars
• Strong organizational and collaboration skills
• Good academic proficiency in English (C1)
• Expertise in quantum computing is an asset