The prerequisites for the course are 1) being well versed in designing and understanding algorithms and 2) a successful completion of a course on basic linear algebra. In exceptional cases the latter can be a corequisite – contact the instructor prior to the start of the semester in case you lack the necessary background.
The course consists of regular lecturers in which we look at Quantum Computing through the eyes of a computer scientist. This means that after the presentation of some necessary basic knowledge, several topics are addressed like architecture, algorithms, programming languages, cryptography, and hardware. This results in knowledge of an exiting research field, of which it is clear that despite the progress made, many hurdles still have to be taken.
This course aims to provide the students an insight in the fascinating area of Quantum Computing. Despite the fact that Quantum Computing is based on Quantum Physics no background in physics or advanced mathematics is required to participate this course.
The most recent timetable can be found at the LIACS website
Mode of instruction
lectures and assignments
Exam and assignments
The course grade will be determined by your work on the assignments and the final exam grade (details will be provided on the first day of class).
- Eleanor Rieffel and Wolfgang Polak, Quantum Computing, the MIT Press, 2011, isbn 978-0-262-01506-6
- Michael A. Nielsen and Isaac L. Chung, Quantum Computing and Quantum Information, reprinted 2012, Cambridge University Press, isbn 978-1-10700-217-3
You have to sign up for classes and examinations (including resits) in uSis. Check this link for more information and activity codes.
Study coordinator Computer Science, Riet Derogee