Introduction to Quantum Computing

Short Name
Introduction to Quantum C
Module Code
CS2363
Module Coordinator
  • Prof. Dr. Bettina Just
Teacher
  • Prof. Dr. Bettina Just
Short Description

The computational model of quantum computing is explained using simple examples

Learning Objectives

Students

  • Have an idea of quantum entanglement and know the computational model of quantum computing
  • Can implement simple algorithms
  • Are informed about other important quantum algorithms and their possible applications
  • Are informed about the actual situation of quantum hardware
  • Are able to understand the meaning of news on quantum computing.
Contents
  • Experiments demonstrating quantum entanglement
  • Computational model: Quantum circuit, quantum algorithms
  • Simulation of classical logical gates by quantum circuits
  • Algorithm for teleportation
  • Implementations with Q#, IBM-Q and Matlab
  • Actual situation of quantum hardware
Duration in Semester
1
Instruction Language
German
Total Effort
6.0 CrP; an estimated 180 hours, of which approximately 60 are spent in class.
Weekly School Hours
4
Method of Instruction

Seminaristischer Unterricht 4 SWS

Requirements for the awarding of Credit Points

Examination prerequisite: ./. Examination: will be announced at the beginning of the lecture.

Availability
As Needed
References
  • M. Homeister: Quantum Computing verstehen Vieweg
  • S. Aaronson: Quantum Computing since Democritus Cambridge University Press
  • Lipton, R.J., Regan, K.: Quantum Algorithms via Linear Algebra The MIT Press