**Lectures:**Tuesday, Thursday 11:00-12:15 PM, CSI 1122**Instructor:**Daniel Gottesman (e-mail: dgottesm@umd.edu, office hours Tuesday 12:30-1:30 PM, Atlantic 3251)**Teaching Assistant:**Yijia Xu (e-mail: yijia@umd.edu, office hours by appointment)**Piazza:**https://piazza.com/umd/spring2024/cmsc858g**Gradescope:**https://www.gradescope.com/courses/721880

- Problem set 1 (LaTeX) (Due Feb. 20, 2024 at 5 PM)
- Problem set 2 (LaTeX) (Due Mar. 5, 2024 at 5 PM)
- Problem set 3 (LaTeX) (Due Mar. 26, 2024 at 5 PM)
- Problem set 4 (LaTeX) (Due Apr. 9, 2024 at 5 PM)
- Problem set 5 (LaTeX) (Due Apr. 23, 2024 at 5 PM)

The textbook is a work in progress: D. Gottesman, *Surviving as a Quantum Computer in a Classical World*.

Chapters 1-14 are now available.

More chapters will be posted here as the semester continues. You also have the full table of contents so you can get a preview of what is planned and what is already written (but still needs editing).

I will try to keep already-posted chapters as stable as possible within this draft, but future chapters referenced in the table of contents will certainly have page numbers change and may have larger changes. If you find you wish to cite the book, please refer to it as the 2024 draft (in case there are future drafts distributed).

- Quantum error correction
- 9-qubit code
- Quantum error correction conditions
- Stabilizer codes
- Clifford group
- Qudit codes
- Bounds on quantum error-correcting codes
- Fault tolerance
- Transversal gates
- Shor, Steane, and Knill quantum error correction
- Fault-tolerant state preparation
- Magic states
- Threshold theorem
- Other topics
- Toric and surface codes
- Subsystem codes
- Other topics TBA

Your grade will have 3 components:

- Problem sets (35%)
- Project (35%)
- Final exam (30%)

- The problem sets will be available on this web page about once every two weeks on Tuesdays.
- The problem sets will be turned in on Gradescope.
- For the problem sets, if you use any external material to solve it (other than the lectures and the textbook), cite the source and indicate what you took from it.
- You may discuss problem sets with other students, but you must understand and write up your solution by yourself. If you do collaborate, indicate who you talked to on your assignment.
- There is no late penalty for problem sets up to 24 hours late. Beyond that, you will need to request an extension before the deadline.

- Performed in groups of 1-5 people (larger groups will need more content covered).
- Should present original research
*or*the main results from 1-5 research papers, depending on length of the papers, overlap between them, and group size. - Each group will turn in a written report (length 10-30 pages, depending on group size and scope of the project) and give a brief presentation in the last week of class (i.e., the first week of May).
- The written report is due Friday, May 9, 2024.
- The writeup should contain a brief summary of the contributions of each member of the group.

Email me the members of your group and the topic for your project by Friday, Mar. 15.

Here are some possible ideas for projects. This is not an exhaustive list. If you want a subject not on this list, let me know and we can discuss if it is acceptable.

- Coding theory:
- Quantum polar codes
- Quantum LDPC codes
- Continuous variable codes
- Floquet codes
- Complexity of decoding quantum codes
- Fault tolerance:
- Knill FT scheme
- Comparison of thresholds from different codes
- Upper bounds on the threshold
- Magic state distillation protocols
- Measures of magic
- Alternative (non-magic state) FT gate constructions
- Non-abelian anyons
- Other topics:
- Experimental quantum error correction and fault tolerance
- Shor-Preskill QKD proof
- Extensions of efficient simulation of Clifford group circuits
- Coding theory in quantum complexity (e.g., NLTS conjecture)
- Fractons as quantum error-correcting codes
- Quantum error correction and AdS/CFT

- Take-home exam.
- More information to be announced closer to the exam.