Classical and Quantum Computing

Course at Universität Heidelberg, Autumn 2009

Instructor

Manfred Salmhofer

Contents

The course will first give an introduction to complexity theory and to quantum theory on finite-dimensional Hilbert spaces. Based on this, the theory of quantum networks and quantum algorithms will be developed in general, and the algorithms of Shor and Grover will be discussed in detail. Further topics include quantum cryptography, quantum error correction, and quantum information theory.

Prerequisites

Linear Algebra and Differential Equations, as covered by the courses PTP1 or PMP2 (or by the corresponding math courses "Linear Algebra" and "Analysis").

No previous knowledge of quantum mechanics is required. This course is for students from the third semester onwards.

Literature

Christos H. Papadimitriou, Computational Complexity. Addison-Wesley

A.Yu. Kitaev, A.H.Shen, M.N. Vyalyi, Classical and Quantum Computation. AMS Graduate Studies in Mathematics, Vol. 47

Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information. Cambridge University Press

N. David Mermin, Quantum Computer Science. Cambridge University Press

Coordinates

Time:	Mondays, 14:15-16:00
Place:	Großer Hörsaal des physikalischen Instituts, Philosophenweg 12

Exercise sessions

Two groups: Thursdays, 9-11 and 16-18, INF 227, SR 2.401

Exam and Credits

The course is worth 5 credit points.

To pass the course and obtain the credit points, students must attend the exercise sessions, do the homework, and pass the exam at the end of the course. Details about this will be discussed in class.