|Period:||Semester 2||Hours of study:||26:00 hrs|
- Yes Elective choice
- Yes Contractonderwijs
- Yes Exchange
- Yes Study Abroad
- No Evening course
- No A la Carte
- No Honours Class
Please note that this course description is preliminary. The final course description will be released in June 2018.
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.
• Cbits and Qbits
• General features and some examples
• Quantum annealing and the universal quantum computer
• Breaking RSA encryption
• Searching with a quantum computer
• Quantum teleportation
• Quantum error correction
• Protocols with a few Qbits
• Quantum artificial neural networks
In the course, the students will understand how to leverage the power of quantum computers and learn about simulated physics. Why are QC more powerful than classical computers? By understanding when they are not powerful, we are learning how to efficiently write classical algorithms for certain quantum systems. Furthermore, there exists a remarkable harmony between physics and mathematics, but what about computer science? In the course we will walk through quantum algorithms, and will, as a consequence, approach the ultimate limits of computation. By comparing real and complex analysis we will discuss if there will be a similar shift from classical to quantum computers?
* What if today someone shows that P does not equal NP for a classical computer? Would we really be happy that the intractability of NP- complete problems had been shown?
* QC opens an entire bag of worrying about the foundations of computational complexity.
The most recent timetable can be found at the students' 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
- Quantum Computer Science: An Introduction” by David N. Mermin, 2007, Cambridge University Press.
- Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice, by Catherine C. McGeoch
You have to sign up for classes and examinations (including resits) in uSis. Check this link for more information and activity codes.
Lecturer: [dr. Florian Neukart](mailto: email@example.com)
Website:“Quantum Computing”: will follow
|Is part of||Programme type||Semester||Block|
|Computer Science: Computer Science and Advanced Data Analytics||Master||2|