Basic model of quantum computation (reversible computing, qubits, unitary transformations, measurements, quantum protocols, quantum circuits); quantum algorithms (simple query algorithms, the quantum Fourier transform, Shor's factoring algorithm, Grover's search algorithm and its optimality); quantum complexity theory; mixed quantum states and quantum operations; quantum information theory (entropy, compression, entanglement transformations, quantum channel capacities); quantum error correction and fault tolerance; quantum nonlocality; quantum cryptography (key distribution and bit commitment); selected additional topics as time permits.
See below for a detailed lecture schedule with recommended readings.
| Office hours | ||
|---|---|---|
| Instructor: Andrew Childs | amchilds@umd.edu | Tuesday, 2–3 pm (AVW 3225) Wednesday, 3:30–4:30 pm (CSS 3100F) |
| TA: Tongyang Li | tongyang@cs.umd.edu | Tuesday 3:30–4:30 (AVW 3225) |
Primary: Paul Kaye, Raymond Laflamme, and Michele Mosca, An Introduction to Quantum Computing, Oxford University Press (2007). (errata)
Supplemental: Michael A. Nielsen and Isaac L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press (2000).
Copies of both texts will be available on reserve in the Engineering and Physical Sciences Library (Math building, room 1403).
| Assignments | 8% each (40% total) |
| Project | 30% |
| Final exam | 30% |
There will be 5 homework assignments during the course. Assignments will be made available here. You should submit completed assignments via the campus ELMS (https://myelms.umd.edu) in PDF format, either as a typeset document or a clear scan of handwritten solutions, by the start of class on the due date. The system will not accept submissions after the deadline, and since solutions will be posted on the course website promptly, extensions will not be granted. Graded assignments will be available on the ELMS.
You are encouraged to discuss homework problems with your peers, with the TA, and with the course instructor. However, your solutions should be based on your own understanding and should be written independently. For each assignment, you must either include a list of students in the class with whom you discussed the problems, or else state that you did not discuss the assignment with your classmates.
| A1 | problems | solutions |
| A2 | problems | solutions |
| A3 | problems | solutions |
| A4 | problems | solutions |
| A5 | problems | solutions |
Any student eligible for and requesting reasonable academic accommodations due to a disability is asked to provide, to the instructor during office hours, a letter of accommodation from the Office of Disability Support Services (DSS) within the first two weeks of the semester.
If you plan to observe any holidays during the semester that are not listed on the university calendar, please provide a list of these dates by the end of the first week of the semester.
As mentioned above, extensions to assignment due dates will not be granted for any reason, so that all students can have timely access to solutions. In the event of a medical emergency that affects your ability to complete coursework, appropriate accommodations will be made. However, you must make a reasonable attempt to notify the instructor prior to the due date, and you must provide written documentation from the Health Center or an outside health care provider. This documentation must verify dates of treatment and indicate the timeframe that you were unable to meet academic responsibilities. It must also contain the name and phone number of the medical service provider in case verification is needed. No diagnostic information will ever be requested.
| Dates | Topics | KLM | NC | Deadlines | Notes |
|---|---|---|---|---|---|
| 2.1-2.6, 2.8 | Review for math background | ||||
| Aug 29, 31 | From classical to quantum information | 1.1-7, 3.1-2, 4 | 1.1,1.3.1 2.2.1-5 | First lecture on Aug 30 | |
| Sep 5, 7 | Quantum information, quantum protocols | 3.3, 5.1-2, 2.7 | 1.3.6-7, 2.2.7-8, 2.3 | ||
| Sep 12, 14 | Quantum circuits | 4.1-5 | 4.1-6 | A1: Sep 14 | |
| Sep 19, 21 | Introductory quantum algorithms | 6.1-6.5 | 1.4.1-4 | ||
| Sep 26, 28 | Quantum Fourier transform, phase estimation | 7.1-7.2 | 5.1-2 | A2: Sep 28 | |
| Oct 3, 5 | Order finding, Factoring | 7.3 | 5.3 | ||
| Oct 10, 12 | Quantum searching | 8.1-4, 9.2-3 | 6.1, 6.3-4, 6.6 | Project proposal: Oct 12 | |
| Oct 17, 19 | Quantum complexity theory | 9.1 | 3.2 | A3: Oct 19 | |
| Oct 24, 26 | Mixed quantum states, quantum operations | 3.5, A.7-8 | 2.4, 8.1-3 | ||
| Oct 31, Nov 2 | Quantum operations, distance measures | 2.2.6, 9.1-2 | A4: Nov 2 | ||
| Nov 7, 9 | Quantum error correction | 10.1-5 | 10.1-4 | ||
| Nov 14, 16 | Stabilizer codes, fault tolerance | 10.6 | 10.5-6 | A5: Nov 16 | |
| Nov 21 | Entropy, compression | 11.1-3, 12.2, 12.5 | No lecture on Nov 23 (Thanksgiving) | ||
| Nov 28, 30 | Holevo bound, channel capacities, nonlocality | 12.1, 12.3-4, 2.6 | |||
| Dec 5, 7 | Key distribution, bit commitment | 12.6 | Project: Dec 7 | Last lecture on Dec 7 | |
| Final exam out: Dec 13 Final exam due: Dec 15 |
Columns labeled KLM and NC indicate recommended readings from Kaye-Laflamme-Mosca and optional readings from Nielsen-Chuang, respectively.