Quantum Information and Computation

NUMMER: 211025
KÜRZEL: quanInfCom
MODULBEAUFTRAGTE:R: Prof. Dr. Michael Walter
DOZENT:IN: Prof. Dr. Michael Walter
FAKULTÄT: Fakultät für Informatik
SPRACHE: Deutsch
SWS: 4
CREDITS: 5
WORKLOAD: 150 Stunden
ANGEBOTEN IM: jedes Sommersemester

PRÜFUNGEN

FORM: Abschlussprüfung; Schriftliche Modulabschlussprüfung
ANMELDUNG:
DATUM: 0000-00-00
BEGINN: 00:00:00
DAUER: 120 Minuten
RAUM:

LERNFORM

Vorlesung und Übungen.

LERNZIELE

You will learn fundamental concepts, algorithms, and results in quantum information and computation theory. After successful completion of this course, you will know the mathematical model of quantum information and computation, how to generalize computer science
concepts to the quantum setting, how to design and analyze quantum algorithms and protocols for a variety of computational problems, and how to prove complexity theoretic lower
bounds. You will be prepared for an advanced course or research/thesis project in this area.

INHALT

This course will give an introduction to quantum information and quantum computation from
the perspective of theoretical computer science.
Topics to be covered will likely include:
∙ Fundamental axioms of quantum mechanics: from classical to quantum bits
∙ Few-qubit protocols: teleportation and no-cloning
∙ The power of entanglement: Bell inequalities and CHSH game
∙ Quantum circuit model of computation
∙ Basic quantum algorithms: Deutsch-Jozsa, Bernstein-Vazirani, Simon
∙ Grover’s search algorithm
∙ Quantum Fourier transform
∙ Shor’s factoring algorithm
∙ Quantum query lower bounds
∙ Quantum complexity theory
∙ Quantum probability: mixed states, POVM measurements, quantum channels
∙ Quantum entropy and Holevo bound
∙ Quantum error correction
∙ Quantum cryptography
∙ Quantum “supremacy”
This course should be of interest to students of computer science, mathematics, physics, and
related disciplines (including those who previously followed the course Quantenalgorithmen
by Prof. May)

VORAUSSETZUNGEN CREDITS

Bestandene Modulabschlussprüfung

EMPFOHLENE VORKENNTNISSE

Familiarity with linear algebra (in finite dimensions) and
probability (with finitely many outcomes) at the level of a first Bachelor’s course; we will
briefly remind you of the more difficult bits in class. In addition, some mathematical maturity, since we will discuss precise mathematical statements and rigorous proofs. No background in physics is required.

LITERATUR

Hand-written lecture notes will be provided.
In addition, the following references can be useful for supplementary reading:
1. Nielsen and Chuang, Quantum Computation and Quantum Information, Cambridge University Press (2010)
2. Mermin, Quantum Computer Science, Cambridge University Press (2007)
3. de Wolf, Quantum Computing: Lecture Notes, https://arxiv.org/abs/1907.
09415 (2022)

AKTUELLE INFORMATIONEN

Verwendung des Moduls (in anderen Studiengängen):
M. Sc. IT-Sicherheit/Informationstechnik

SONSTIGE INFORMATIONEN

Stellenwert der Note für die Endnote: 5 / 105
(Im Studiengang werden Module im Umfang von 105 CP benotet und 15 CP nicht benotet)