### Biography

Former student of the *Ecole Normale Supérieure de Cachan*, Frédéric Magniez is graduated both in mathematics (*agrégation*) and computer science (PhD). His PhD thesis was awarded by the *Association Française d’Informatique Théorique* in 2000. He then became a CNRS researcher and worked at the *Université Paris Sud*, before joining the *Institut de Recherche en Informatique Fondamentale* (IRIF) at the *Université de Paris in 2010*. His research focuses on the design and analysis of randomized algorithms for processing large data sets, as well as the development of quantum computing, particularly algorithms, cryptography and its interactions with physics.

Professor at the *École Polytechnique* from 2003 to 2015, Frédéric Magniez co-initiated the first course dedicated to quantum computing of the institution. In 2006, he founded and led the national working group for quantum computing, that currently brings together 20 research groups. From 2013 to 2017, he ran the Algorithms and Complexity group, whose research in quantum computing is recognized worldwide. In 2015, he became Deputy Director of the *Fondation des Sciences Mathématiques de Paris*, a network of excellence bringing together 1,200 researchers in mathematics and computer science, before taking over as Director of IRIF in 2018.
Professor at the *Collège de France*, he has held the Annual Chair in Informatics and Digital Sciences from 2020 to 2021.

### Research

Topics- Quantum computing: algorithms, self-testing, cryptography
- Sublinear algorithms: property testing, streaming algorithms

### Collège de France

Quantum algorithms (Annual Chair 2020-21, in French)- Interviews: Collège de France, ENS Paris-Saclay
- Inaugural lecture: Article, Book, Video
- Lectures & Seminars: Presentation, Videos and slides

### Teaching

Lectures- Parisian Master of Research in Computer Science (2002-)
- Ecole Polytechnique (2003-15, archive site)

- Graphs, algorithms and randomness (CIMPA, 2019), Quantum physics and computer science (CNRS, 2014), Communication complexity (GDR IM & CNRS, 2014), Randomized algorithms (EPIT & CNRS, 2012), New computation paradigms (ENS Lyon, 2010), Quantum computing (2009), Computational complexity (EPIT & CNRS, 2005)

### Management

Responsibilities- Director of IRIF (2018-)
- Deputy director of Fondation Sciences Mathématiques de Paris (2015-17)
- Leader of Algorithms and Complexity group (2013-17)

- Special issue on Quantum Computation, Algorithmica (2009)

- TQC'22, PODC'22, ICALP'22, HALG'22, ITCS'22, SODA'21, FCT'17, ICALP'17, PQCRYPTO'17, CSR'17, IPDPS'17, ICALP'15, TAMC'15, MFCS'14, SOFSEM'12, STOC'11, STACS'08, FCT'07, QIP'06, SOFSEM'05

- Regional network for computer sciences (2019-)
- CNRS research network for theoretical computer science (2009-17)
- National committee for scientific research (CoNRS, section 06, 2012-16)
- French spring school EPIT (2011-16)

### Main grants

France- Coordinator: QUDATA (ANR Générique 2019-22), RDAM (ANR Blanc 2013-17), QRAC (ANR Defis 2009-12)
- Participant: AlgoriDAM (ANR Générique 2020-23), CRYQ (ANR JCJC 2010-13)

- Coordinator: HPCQS (EuroHPC 2021-24, local PI for CNRS), IRIF-IQC collaboration on QIP (CNRS PICS 2017-19), CSQIP (EU-Canada TEP 2009-11)
- Participant: PARQ (ERC Advanced 2020-25), QUANTALGO (QuantERA ERA-NET Cofund 2018-21), QALGO (FP7/ICT/FET 2013-16), DIQIP (CHIST-ERA ERA-NET Cofund 2011-14), QCS (FP7/ICT/FET 2010-13)