May 1: Course evaluations are now open. We would appreciate your feedback on the course. You may complete your evaluation any time between now and May 12.
Apr 25: Some notes have been added for the lecture on fast quantum simulation algorithms.
Apr 10: Since we have not yet covered the adversary method, the deadline for assignment 3 is extended to April 20.
Mar 18: A schedule of project presentations is now available. If you would like to speak at a different time, please find someone to switch with and let me know. I am happy to apply any permutation that everyone involved agrees to.
Mar 16: Project presentations will be scheduled during class time on April 27 and on May 2, 4, 9, and 11. If you have a preference about when you would like to speak, please email Andrew. Preferences will be accommodated in the order they are received.
Mar 15: Assignment 3 has been posted.
Mar 13: Unfortunately the university will be closed on March 14, so we will not have lecture or office hours.
Mar 7: Problem 5 on Assignment 2 will be held over for the final assignment. You do not have to submit your solution to this problem with Assignment 2.
Mar 1: Andrew's office hour for Wednesday, March 1, is canceled. Please feel free to ask questions or schedule an alternate time by email.
Feb 27: Topics that have been selected for course projects will be listed on the project page.
Feb 22: Assignment 2 has been posted.
Feb 21: Andrew's office hour for Wednesday, February 22, is canceled. Please feel free to ask questions or schedule an alternate time by email.
Feb 15: The lecture notes have been updated; in particular, note that equation (3.8) has been corrected.
Feb 7: Project suggestions have been posted.
Feb 2: Assignment 1 has been posted.
Jan 31: Lecture notes on Clifford+T synthesis have been posted.
Jan 19: A PDF version of the syllabus is available.
This is an advanced graduate course on quantum algorithms for students with prior experience in quantum information. The course will cover algorithms that allow quantum computers to solve problems faster than classical computers. Topics will include the quantum circuit model, quantum algorithms for algebraic problems (computing discrete logarithms, the hidden subgroup problem, quantum algorithms for number fields), quantum search, quantum walk algorithms, quantum algorithms for simulating quantum mechanics, limitations on the power of quantum computers, and selected recent developments in quantum algorithms.
This course assumes a good working knowledge of linear and abstract algebra, as well as concepts in quantum information at the level of CMSC 858K: Introduction to Quantum Information Processing. In particular, you should already be familiar with the material reviewed in Chapter 1 of the lecture notes. You are encouraged to consult with the instructor if you are unsure whether you are prepared to take the course.
Lecture notes will be available for all topics covered in the class. The relevant chapters will be indicated on the schedule below. Most of the material on the hidden subgroup problem and related concepts is covered in the survey article Quantum algorithms for algebraic problems (arXiv:0812.0380) by Childs and van Dam.
Grades for the course will be based on three assignments (each worth 20% of the final grade) and a final project consisting of a term paper and short presentation (40% of the final grade). Grades will be recorded at grades.cs.umd.edu.
The final project for the course will consist of a paper and a short presentation to the class on a topic related to quantum algorithms. In addition to reviewing previous work on your topic, you should aim to identify new research directions; outstanding projects will include some original research contributions. A list of suggested topics is available, but you are free to choose a topic not on that list. Each student should have a unique topic. Please discuss your project with me and send an email message confirming your choice of topic to amchilds@umd.edu by March 9.
You will have 20 minutes to give your presentation, with 5 minutes for questions. Presentations will be scheduled during the last several class meetings.
Your paper is due by May 11. It should be typeset in LaTeX and submitted by email as a PDF file. There are no length requirements, but as a rule of thumb, your paper should probably be around 10 pages.
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.
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.
Course evaluations are an important part of evaluating instruction. The Department of Computer Science and its faculty take student feedback seriously. Students can go to courseevalum.umd.edu to complete their evaluations.
Note: The following schedule is tentative and subject to change.