Introduction to Quantum Algorithms

Code: LTAT.04.008 “Introduction to Quantum Algorithms”
Next session: Spring 2022
Instructors: Dirk Oliver Theis, Alejandro Villoria, Evgenii Dolzhkov
Created by: Assoc. Prof. Dirk Oliver Theis

This course covers the basic (i.e., easiest) quantum algorithms.

After a review of quantum mechanics to the extent that is necessary for quantum algorithms, we will discuss the quantum circuit model for universal (fault-tolerant) quantum computing. From there, we will venture to increasingly complex quantum algorithms. We start with the Fourier transform based algorithms (Deutsch-Josza, and Simon’s algorithms, Quantum Fourier Transform, Fourier Sampling, Quantum Phase Estimation) which allows us to discuss Shor’s algorithm. We then proceed to amplitude amplification (Grover’s algorithm) and amplitude estimation. The course concludes with an outlook where we apply all the techniques learned in the semester to discuss a baby-version of the quantum linear system solver.

There will be two lecture classes per week, so that there’s sufficient time to work out lots of example quantum calculations in class.

  1. Working with pure states
  2. The circuit model & tourists view on quantum computational complexity
  3. Fourier sampling & Deutsch-Jozsa algorithm
  4. Period finding and Simon’s algorithm
  5. Quantum Fourier transform
  6. Quantum Phase estimation
  7. Shor’s algorithm
  8. Quantum amplitude amplification
  9. Quantum amplitude estimation
  10. Outlook: Quantum linear system solver