title:
Quantum Algorithms and Complexity
Algorithmes et complexité quantiques
manager:
Simon Apers
ects:
3
period:
2
hours:
24
weeks:
8
hours-per-week:
3
lang:
themes:
Quantum, Complexity, Discrete Math/Graphs
year:
2025
  • Quantum Algorithms and Complexity
    Algorithmes et complexité quantiques
  • Language:
  • Period:
  • 2.
  • Duration:
  • 24h (3h/week).
  • ECTS:
  • 3.
  • Manager:
  • Simon Apers.

Overview

Lecturers:
Simon Apers and Alex Grilo

Organization:
Tuesday 12h45-15h45, room 1004.

Evaluation:
Final exam.

Prerequisites:
[QUANTUM] course at MPRI or another course on quantum computing.

Presentation and objectives:
The course will cover advanced quantum algorithms and quantum complexity theory.

Detailed schedule:

  • 9/12: no course
  • 16/12: (SA) Quantum walks
  • 06/01: (SA) Quantum walk search
  • 13/01: (SA) Quantum adiabatic algorithm
  • 20/01: (SA) Hamiltonian simulation
  • 27/01: no course
  • 03/02: (AG) Quantum interactive proof systems, classical complexity classes
  • 10/02: (AG) Quantum learning theory, state tomography, classical shadows of quantum states
  • 17/02: (AG) Boson sampling, random circuit sampling, complexity theoretical indications of quantum advantage
  • 24/02: (AG) Stabilizer states, Clifford+T circuits, classical simulation
  • 03/03: Exam

Lecture Notes:

  • Lectures 1-4: link
  • Lectures 5-8: TO ADD

Internships:
Please contact the lecturers for information about internships.