CMSC/PHYS 457: Introduction to Quantum Computing
University of Maryland, Spring 2025
Instructor: Runzhou Tao
Staff:
| Name | Office Hours | |
|---|---|---|
| Prof. Runzhou Tao | rztao@umd.edu | By appointment or After class |
| Rushil Dandamudi | rushilcd@umd.edu | 12pm - 2pm Monday at AVW 4160 |
| Seyed Sajjad Nezhadi | sajjad@umd.edu | 1:30pm - 3:30pm Wednesday at Zoom |
Time: Tue & Thu 3:30pm - 4:45pm
Location: CSI 3117
Description: An introduction to the concept of a quantum computer, including algorithms that outperform classical computation and methods for performing quantum computation reliably in the presence of noise. As this is a multidisciplinary subject, the course will cover basic concepts in theoretical computer science and physics in addition to introducing core quantum computing topics.
Previous Offering of the Course
- CMSC/PHYS 457 in Spring 2018, Spring 2019, Spring 2020, Spring 2021, Spring 2022, Spring 2023
- Check also the graduate-level course (CMSC 657) on quantum information in Fall 2018, Fall 2019, Fall 2022, Fall 2023, Fall 2024.
Generics
Prerequisite: Familiarity with complex numbers and basic concepts in linear algebra (e.g., eigenvalues, eigenvectors, Hermitian and unitary matrices). 1 course with a minimum grade of C- from (MATH240, PHYS274); and 1 course with a minimum grade of C- from (CMSC351, PHYS373).
Syllabus: see below
In general, please send your questions/requests via Piazza or email. We will reply as soon as possible.
Evaluation: assignments (40%), exams (40%), and project (20%). Details in the policy page.
How to Navigate Through the Course
- Quantum information and computation is an exciting emerging field, but it’s impossible to cover everything in an introductory course. The main goals are:
- Understand and comprehend the theoretical foundation of quantum information and computation.
- Cover a selective collection of fundamental topics in quantum computation.
- Learn about the research frontier of one specific topic via the course project.
- Expect a large amount of reading materials and significant effort given the difficulty of the topics.
- The course project is meant to train your ability to navigate literature and understand research papers. Original contributions are welcome but not mandatory. The main purpose is to facilitate future research endeavors.
Assignments
Homework assignments must be submitted electronically to ELMS. If you have trouble with electronic submissions, contact the instructor immediately.
We highly recommend using LaTeX for typesetting. We will reward the use of LaTeX with a 5% bonus on your homework points. Here’s a good reference and a LaTeX template for writing solutions.
Check the homework page.
Textbooks & Lectures
We will mainly use notes (available online or our own) for lectures. We will also refer to parts of the following textbooks:
- Paul Kaye, Raymond Laflamme, and Michele Mosca, An Introduction to Quantum Computing, Oxford University Press (2007).
- Scott Aaronson’s Introduction to Quantum Information Science (UT Austin 2017).
- M. Nielsen and I. Chuang, Quantum Computation and Quantum Information, Cambridge University Press (10th Anniversary edition, 2011).
- A. Yu. Kitaev, A. H. Shen, and M. N. Vyalyi, Classical and Quantum Computation (Graduate Studies in Mathematics), AMS, 2002.
- John Watrous, The Theory of Quantum Information, Cambridge University Press, 2018.
Syllabus
Below is the tentative syllabus (subject to frequent updates). Reading assignments and references are included. All assignments and project-related deadlines are listed under the “Due” column.
| Date | Week | Lecture | Due |
|---|---|---|---|
| 01/28 | 1 | Introduction; History of Quantum Computing. Reading: KLM Ch.1, 2.1-2.6 (Slides) (Linear Algebra Cheetsheet) | |
| 01/30 | Linear Algebra Background & Quantum Mechanics Formulation (I). Reading: KLM 3.1-3.2 | ||
| 02/04 | 2 | Quantum Mechanics Formulation (II). Reading: KLM 3.3-3.4 | |
| 02/06 | Quantum Mechanics Formulation (III). Reading: KLM 3.5 | ||
| 02/11 | 3 | Cancelled due to Campus Closure | Assn 0 |
| 02/13 | Quantum Mechanics Formulation (IV) & No-cloning theorem | ||
| 02/18 | 4 | Basic Quantum Circuits/Gates, Reading: KLM 4.1-4.2 | |
| 02/20 | Universal Gate Sets. Reading: KLM 4.3-4.4 | Assn 1 | |
| 02/25 | 5 | Teleportation and Super-dense Coding (Online) Reading: KLM 5.1-5.2 | |
| 02/27 | Coding Lecture (I) (Online) | Proj Proposal | |
| 03/04 | 6 | Deutsch-Josza Algorithm Reading: KLM 6.1-6.4 | |
| 03/06 | Simon’s Algorithm Reading: KLM 6.5 | ||
| 03/11 | 7 | Grover’s Algorithm (I) Reading: KLM 8.1 | |
| 03/13 | In-Class Mid-Term | ||
| 03/16-22 | 8 | Spring Break | |
| 03/25 | 9 | Coding Lecture (II) | |
| 03/27 | Grover’s Algorithm (II) Reading: KLM 8.2-8.3 | ||
| 04/01 | 10 | Lower Bound for Unstructured Search Reading: (van Melkebeek’s Notes 7) | Assn 2 |
| 04/03 | Advanced Topic: Quantum Error Correction | ||
| 04/08 | 11 | Quantum Phase Estimation & Quantum Fourier Transform Reading: KLM 7.1 , (Watrous’ Notes 8) (Watrous’ Notes 9) | Proj Mid-term |
| 04/10 | Advanced Topic: Bell Inequalities | ||
| 04/15 | 12 | Quantum Algorithm for Order Finding Reading: KLM 7.3 (Watrous’ Notes 10) | |
| 04/17 | Shor’s Algorithm Reading: KLM 7.3 (Watrous’ Notes 11) | ||
| 04/22 | 13 | Coding Lecture (III) | |
| 04/24 | Advanced Topic: QMA and Local Hamiltonians (Online) | Coding 1Assn 3 | |
| 04/29 | 14 | Recitation (Online) | |
| 05/01 | Final Project Presentations (I) | ||
| 05/02-03 | Final Exam (Online) | ||
| 05/06 | 15 | Final Project Presentations (II) | Coding 2 |
| 05/08 | Final Project Presentations (III) | ||
| 05/18 | 16 | Proj Final Report |