6 EC
Semester 2, period 4
5334ADQA6Y
A major claim to fame of quantum computers is that they will be able to solve some problems significantly faster than believed to be possible on a classical computer. The design of further quantum algorithms is an exciting active field of research, and there is still much left to explore in understanding which problems can be sped up by quantum computers, and by how much. In this course, students will learn about various advanced topics in quantum algorithms and algorithm design, as well as techniques for understanding for which problems it is possible to get a quantum speedup, and by how much. Students will be encouraged to dive deep into topics, and probe the cutting edge of current research.
|
Activity |
Hours |
|
|
Hoorcollege |
30 |
|
|
Tentamen |
3 |
|
|
Self study |
135 |
|
|
Total |
168 |
(6 EC x 28 uur) |
This programme does not have requirements concerning attendance (TER-B).
| Item and weight | Details |
|
Final grade | |
|
0.4 (40%) Assignments | |
|
0.1 (17%) Assignment 1 | |
|
0.1 (17%) Assignment 2 | |
|
0.1 (17%) Assignment 3 | |
|
0.1 (17%) Assignment 4 | |
|
0.1 (17%) Assignment 5 | |
|
0.1 (17%) Assignment 6 | |
|
0.25 (25%) Final Paper | |
|
0.35 (35%) Tentamen |
Assignments will not be accepted after the deadline, however, the lowest two assignment grades will be dropped. There will be a resit exam, which will be worth .75 of the final grade (assignments will be dropped).
Assignments may be discussed among students, but should be completed individually. Assignments will be graded. There are additional exercises in the lecture notes that are not part of assignments, and students are encouraged to work through these as well.
The 'Regulations governing fraud and plagiarism for UvA students' applies to this course. This will be monitored carefully. Upon suspicion of fraud or plagiarism the Examinations Board of the programme will be informed. For the 'Regulations governing fraud and plagiarism for UvA students' see: www.student.uva.nl
| Weeknummer | Topics | Deadlines |
| 1 | Building blocks, hidden subgroup problems | |
| 2 | Phase estimation, search, approximate counting, amplitude amplification | Assignment 1 due Wednesday |
| 3 | Quantum walk algorithms | Assignment 2 due Wednesday |
| 4 | Span programs | Assignment 3 due Wednesday |
| 5 | Quantum query complexity | Assignment 4 due Wednesday |
| 6 | Quantum singular value transform | Assignment 5 due Wednesday |
| 7 | QMA and local Hamiltonian | Assignment 6 due Wednesday |
| 8 | Exam week | Final Paper due |