After successful completion of the course, students are able to are in a position to reproduce the contents as outlined in detail in the English version of "Lehrinhalte" in written as well as oral form. Moreover, the students will be able to apply the basic concepts of Quantenberechenbarkeit u. -komplexitätstheorie  to simple examples.

quantum information and complexity theory: with a short review of quantum complexity and algorithmic information theory

lecture with a strong and active student participation.

I kindly ask all students who are interested in this course in the summer semester of 2021 to contact me as soon as possible by email svozil@tuwien.ac.at.

The 1st lecture will take place in the 2nd week of March 2021, that is, Thursday, March 11th, 2021 from 11:30-13 (if there are no collisions).

Join Zoom Meeting
https://tuwien.zoom.us/j/95370294130

Meeting ID: 953 7029 4130

Oral exam

• LECTURE NOTES ON QUANTUM COMPUTATION [Cornell University, Physics 481-681, CS 483; Spring, 2004] (c) 2004, by N. David Mermin http://people.ccmr.cornell.edu/~mermin/qcomp/CS483.html
• Nicolas Gisin, Grégoire Ribordy, Wolfgang Tittel, and Hugo Zbinden, "Quantum cryptography", Rev. Mod. Phys. 74, 145-195 (2002) http://link.aps.org/abstract/RMP/v74/p145
• J. Eisert and M.M. Wolf, Quantum computing [book chapter of the "Handbook Innovative Computing" (Springer, Berlin Heidelberg New York, 2004)] http://www.arxiv.org/abs/quant-ph/0401019

• M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000).
• J. Gruska, Quantum Computing (McGraw-Hill, London, 1999).

A brief introduction into some elementary quantum mechanics is presented in the course.