Simon Apers

Simon Apers is a CNRS researcher at IRIF (Institut de Recherche en Informatique Fondamentale) at Université Paris Cité. He focuses on quantum algorithms with broader interests in theoretical computer science, including random walks, graph theory, and combinatorial optimization.

His primary research interests span quantum computing, theoretical computer science, and algorithms. Apers has made significant contributions to quantum walks, quantum property testing, graph algorithms, and computational complexity. His work often bridges quantum information with classical theoretical computer science, exploring how quantum techniques can improve classical algorithms and solve problems more efficiently. He has developed quantum speedups for various computational tasks including sampling, optimization, and graph problems.

Simon Apers serves as a program committee member for prestigious conferences including TQC'25, QIP'25, TQC'23, SODA'23, and ESA '21. He also serves as an editor for the journal Quantum. His teaching activities include courses at Sorbonne University (2022-present) on Advanced Quantum Algorithms, MPRI (2021-present) on Quantum Algorithms and Complexity, and Bad Honnef (2022).

His publication record shows a strong trend toward quantum algorithms for graph problems, quantum walks, and connections between quantum computing and classical theoretical computer science. He frequently collaborates with researchers from various institutions across Europe and has published in top venues including FOCS, STACS, ESA, PRL, and JMLR.

Simon Apers actively mentors students and has open positions for PhD students and postdocs in quantum algorithms at IRIF. His research group is involved in cutting-edge work at the intersection of quantum computing and theoretical computer science, with significant contributions to quantum walks, property testing, and computational complexity.