- quantum gates and quantum circuits,
- early algorithms (e.g. Deutsch-Jozsa and Bernstein-Vazirani),
- exact algorithms (e.g. Simon's algorithm, Fourier Transformation, Shors method, Grover's Search, HHL),
- hybrid heuristic methods (e.g. VQE and QAOA),
- insight into error rates, error correction and complexity.
Mathematics of Quantum Computing (M, 4.5 LP)
|Module Number||Module Name||CP (Effort)|
|MAT-59-14-M-6||Mathematics of Quantum Computing||4.5 CP (135 h)|
|CP, Effort||4.5 CP = 135 h|
|Position of the semester||1 Sem. irreg.|
|Level|| Master (General)|
+ further Lecturers of the department Mathematics
|Area of study||[MAT-OPT] Optimisation|
|Reference course of study||[MAT-88.105-SG] M.Sc. Mathematics|
|Type/SWS||Course Number||Title||Choice in |
|SL||SL is |
required for exa.
Mathematics of Quantum Computing
|P||42 h||93 h||
- About [MAT-59-14-K-6]: Title: "Mathematics of Quantum Computing"; Presence-Time: 42 h; Self-Study: 93 h
- About [MAT-59-14-K-6]: The study achievement [U-Schein] proof of successful participation in the exercise classes (ungraded) must be obtained.
Examination achievement PL1
- Form of examination: oral examination (20-30 Min.)
- Examination Frequency: each semester
- Examination number: 84222 ("Mathematics of Quantum Computing")
Evaluation of grades
The grade of the module examination is also the module grade.
Competencies / intended learning achievements
In the exercise classes they have developed a confident, precise and independent handling of the terms, statements and methods from the lecture. They have also learned to modify quantum algorithms and to apply them to other problems.