Numerical analysis on quantum computers (VO, 2h, 3ECTS)Markus Faustmann Michael Feischl
We explain the basics of quantum computers (what is required in order to play numerical analysis) and analyze a number of algorithms:
- Grover's algorithm (search in unsorted vectors in O(sqrt(N)) )
- Shor's algorithm (factorization in polynomial time)
- Solving sparse linear systems (with exponential speed-up over classical algorithms)
- Quantum FEM
The lecture will start after the easter break with one 90min and one 60min session each week (2h, 3ECTS in total).