Timetable
Material
The course is largely based on the book
Nielsen, Chuang, Quantum Computation and Quantum Information, Cambridge university press 2000,
but the essential material will appear in lecture notes that will be added here as the course proceeds.
Also, links to other nice (online) materials will be added.
Other
Tasks
Exercises
Conduct of the course
The course is evaluated based on a project and exercise activities. Students are expected to complete at least 75% of the exercises (doing more or less than 75% will influence the course grade with one grade point per 25 %-units). The project consists of a 5-10 page written part and a 10-15 min presentation during the last week of the course. The project should present a quantum algorithm (not Grover's search or Shor's factoring) or some other relevant aspect of quantum information (in which case you should contact the lecturer to agree on the topic).
Description
Mathematical routine aquired during B.Sc. level mathematics courses, linear algebra. |
Bsc. level math courses, linear algebra
The course is an introduction to the basic principles and algorithms of quantum computation |
1. or 2. year |
qubits, quantum superposition, inference, measurements and entanglement; quantum operators and quantum circuits; quantuma algorithms (including Shor's factorization algorithm and Grover's search algorithm) |
Coursework and/or exam, Course will be graded with grades 1-5 |
Lecture notes, and other material specified at the beginnig of the course. |
Lectures and exercises |
Coursework and/or exam, Course will be graded with grades 1-5 |
Exam and exercises, or general exam, other methods will be described later |