Overview

Lecturers:
Simon Apers and Alex Grilo

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

Evaluation:
Final exam.

Students are allowed to bring any material related to the course (lecture notes, exercise sheets, *personal* written/printed solutions). No books, tablets or other electronic devices are allowed.

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 walk search
• 06/01: (SA) Quantum linear algebra
• 13/01: (SA) Quantum adiabatic algorithm
• 20/01: (SA) Transducers and quantum Las Vegas
• 27/01: no course
• 03/02: (AG) BQP, oracle separations, QMA
• 10/02: (AG) QMA, Quantum interactive proof systems
• 17/02: (AG) Boson sampling, random circuit sampling, complexity theoretical indications of quantum advantage
• 24/02: (AG) State tomography, classical shadows of quantum states
• 03/03: Exam

Lecture Notes:

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

Internships:
Please contact the lecturers for information about internships.