Quantencomputing

Module Code
CS5340
Module Coordinators
Bettina Just
Teachers
Bettina Just
Short Description
The modul introduces to the concept of quantum computing and the most important quantum algorithms.
Learning Objectives

Students know the computational model of quantum computing as well as the most important quantum algorithms. They are able to understand new developments in quantum computing, and to specialize to selected topics in quantum computing.

Contents
  • Computational model: Quantum circuits, quantum algorithms
  • Properties of quantum circuits: No cloning theorem and universal gates
  • The algorithm of Deutsch-Josza,
  • Groover Iteration
  • Shor’s algorithm for factoring integers
  • Applications of quantum computing

Optional: Further topics related to quantum computing (e.g. historical development, computational complexity quantum mechanics, actual state of realization of quantum computers, simulation of quantum computers and quantum algorithms)

Duration in Semester
1
Instruction Language
German
Total Effort
6 CrP; an estimated 180 hours, of which approximately 60 are spent in class.
Weekly School Hours
4
Method of Instruction
Lecture 2 sppw Exercises 2 sppw
Requirements for the awarding of Credit Points

Written examination, or presentation with written elaboration (will be announced in time and appropriate manner)

Evaluation Standard
according to examination regulations (§ 9)
Availability
Yearly
References
  • M. Homeister: Quantum Computing verstehen Vieweg
  • G. Brands: Einführung in die Quanteninformatik Springer
  • S. Aaronson: Quantum Computing since Democritus Cambridge University Press
  • Lipton, R.J., Regan, K.: Quantum Algorithms via Linear Algebra The MIT Press