UE Quantum Algorithms: basics and principles

This is a set of lecture notes on quantum algorithms. The content will span from fundamentals to advanced topics, trying to give a large view on the current state of art in the domain.

Content (EN)
I. Quantum circuits
1 Preliminaries
2 Efficient universality of quantum circuits
3 Quantum circuit synthesis over Clifford+T (TP 1 : Introduction Qiskit + implementation Clifford circuit)
II. Quantum algorithms for algebraic problems
4 The abelian quantum Fourier transform and phase estimation (TP 2 : Implementation of a QPE algorithms)
III. Quantum walk
5 Continuous-time and Discrete quantum walk
6 Unstructured search
7 Quantum walk search (TP 3 : Implementation Spatial Search over 2D grid)
IV. Quantum query complexity
8 Query complexity and the polynomial method
9 The collision problem
10 The quantum adversary method (TP 4 : Learning graph)
V. Quantum simulation
11 Simulating Hamiltonian dynamics. Examples from physics and chemistry
VI. Adiabatic quantum computing
12 The quantum adiabatic theorem
13 Adiabatic optimization

Lundi 13, 9h salle seminaire 2eme étage frumam st charles
Mardi 14, 10h Luminy salle 403 Luminy
Mercredi 9h-12h, 14h-17h, salle seminaire 2eme étage frumam st charles
Jeudi 10h-13h, salle seminaire 2eme étage frumam st charles