![]() Homework: Chapter 6, Exercises 1,2,3,4 (hand in Feb 28) Homework: Chapter 5, Exercises 1,2,4 (hand in Feb 21) Homework: Chapter 4, Exercises 1,3,4 (hand in Feb 21) Homework: Chapter 3, Exercises 1,3 (hand in Feb 14) Homework: Chapter 2, Exercises 2,4,5,7,8 (hand in Feb 14) The circuit model, Deutsch-Jozsa algorithm.Homework: Chapter 1, Exercises 1,2,3 (hand in Feb 7) Introduction to quantum mechanics and qubits, overview of the course.The final grade is determined 40%-60% by the homework-grade and the final exam. We will ignore the lowest of your seven scores. When determining the average grade for the homework, If you don't hand it in you'll score a 1 for Which is the package used for the Nielsen-Chuang book.Įach homework set will get a grade between 1 and 10 If you use LaTeX and want to draw circuits, you can use Handwritten solutions are fine, as long as they are clearly readable. You can hand it in on paper, or email a readable file to Giannicola (G.Scarpa at cwi dot nl, with cc to rdewolf at cwi dot nl). There will be homework exercises once a week, to be handed in before or at the start of the Thursday lecture.Ĭooperation is allowed, but everyone has to hand in their own solution set in their own words. This is a 6 ECTS course, which comes to roughly 20 hours of work per week. The last two hours on Thursday are for exercises and homework. Quantum Computation and Quantum Information, Cambridge University Press, 2000. Those who want to read more (much more.) can consult the standard textbook in this area: The course is taught from a computer science perspective but should be accessible for physicists as well.įamiliarity with basic linear algebra, probability theory, discrete math, algorithms and complexity theoryĪn updated version prepared after the end of the course with some clarifications (note that the numbering of exercises has changed). In addition to such algorithms, there is a plethora of other applications: quantum cryptography, quantum communication, simulation of physical systems, and many others. ![]() A second important quantum algorithm is Grover's search algorithm, which searches through an unordered search space quadratically faster than is possible classically. Shor's algorithm breaks all such cryptography. This problem is generally believed to take exponential time on even the best classical computers, and its assumed hardness forms the basis of much of modern cryptography (particularly the widespread RSA system). For example, Peter Shor in 1994 found a quantum algorithm that can efficiently factor large integers into their prime factors. However, the real aim is to find computational problems where a quantum computer is much more efficient than classical computers. Quantum computers generalize classical ones and hence are at least as efficient. The laws of quantum mechanics constrain how we can perform computational operations on these qubits, and thus determine how efficiently we can solve a certain computational problem. Its main building block is the qubit which, unlike classical bits, can take both values 0 and 1 at the same time, and hence affords a certain kind of parallelism. Quantum computation is the field that investigates the computational power and other properties of computers based on quantum-mechanical principles. Moreover, spatially separated quantum systems may be entangled with each other and operations may have ``non-local'' effects because of this. A quantum system can be in a superposition of many different states at the same time, and can exhibit interference effects during the course of its evolution. ![]() However, modern quantum physics tells us that the world behaves quite differently. Today's computers-both in theory (Turing machines) and practice (PCs and smart phones)-are based on classical physics. Teaching assistant: Giannicola Scarpa ( CWI) University of Amsterdam course "Quantum Computing" Quantum Computing (5314QUCO6Y) University of Amsterdam course, Spring 2013 semester
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |