Quantum information and computation
CSE 534* | Autumn 2024
Course information
Instructor: Chinmay Nirkhe (OH: Tu 2:30 - 3:30pm, CSE2 217)
Teaching Assistant (TA): Lukshya Ganjoo (OH: Mon 3:30 - 4:30pm, CSE2 121)
Location: Gates Center Rm. 271
Times: Tu, Th 10:00am - 11:30am
Recitation section: 2:30pm - 3:30pm
Final: Dec 2, 2024 8:00am - 10:20pm (CSE2 345) or Dec 9, 2024 10:00am - 12:20pm (CSE2 245)
Canvas: https://canvas.uw.edu/courses/1770221
Gradescope: https://www.gradescope.com/courses/875617
Course description
Introduction to quantum information and computation. Qubits, quantum gates, and measurements. Entanglement and non-locality. Density matrix formalism. Quantum algorithms: Simon's algorithm, Grover search, Shor's factoring, and Hamiltonian Simulation. Quantum error-correction. Recommended: either solid background in mathematics and/or theoretical computer science, or prior familiarity with quantum-computing fundamentals.
Prerequisites
The course material will be accessible to both computer scientists and physicists, provided they have a strong mathematical background. No explicit prerequisites are set for this course. We will review what is necessary but students with weaker math backgrounds may need to review material outside the course as necessary.
My expectation is that students have a strong mathematical background in linear algebra (such as MATH 318, 340, or equiv.). They should have taken and done well in such courses. In terms of computer science prerequisites, exposure to the theory of computation (such as CSE 431, 531, or equiv.) and theory of algorithms (such as CSE 417, CSE 521-22, 525, or equiv.) is useful as we will be extending the results from classical computation to quantum computation. No physics knowledge is necessary but it doesn't hurt to have taken a previous course on quantum mechanics (such as PHYS 225, 324, or equiv.). It is also helpful (but not necessary) to have taken group theory (such as MATH 402-04, 411-12, or equiv.), and analysis (such as MATH 327, 424-28 or equiv.).
Undergraduate students or graduate students of non-traditional backgrounds for this course are encouraged to contact me to see if this course is right for them.
Literature and other material
There are no explicit textbooks for this course but the following is a pretty good library to have around. I will link related readings from these books or online lecture notes as appropriate:
- Nielsen and Chuang. Quantum Computation and Quantum Information.
- Kitaev, Shen, and Vyalyi. Classical and Quantum Computation.
My own lecture notes will be posted as the course progresses but you can also look at Coladangelo's notes from 599q.
This video lecture series from Watrous at IBM may also be helpful.
The following are topics textbooks that might be helpful for further exploration outside the scope of this course.
- Watrous. The Theory of Quantum Information.
- Arora and Barak. Computational Complexity: A Modern Approach.
- Vidick and Wehner. Introduction to Quantum Cryptography.
Course schedule and topics†
All notes as one file
- Lecture 00: Video Lecture on Perspective and Course Administration
- This video lecture covers the broad perspective on what is quantum information and computation and how we will study it through this course. It also goes over all the administrative questions you may have.
- Video is ~40 minutes in length but definitely watchable at 2x speed.
- We will hit the ground running in Lecture 1 with some mathematics so don't skip out on this video.
- Peruse Problem Set 0. Additionally, the following linear algebra notes (1 & 2) from previous course iterations are helpful if problem set 0 is challenging.
- Supplementary reading: (Problem Set 0) N&C 2.0.0 - 2.1.10
- Lecture 01 (9/26): Axioms of quantum computation, probability theory review
- Lecture 02 (10/1): Elitzur-Vaidman Bomb Tester
- Lecture 03 (10/3): Entanglement, Density Matrices
- Lecture 04 (10/8): Bell inequalities, CHSH game
- Lecture 05 (10/10): CHSH game and proof of optimality
- Lecture 06 (10/15): Proof of optimality and certifiable randomness
- Lecture 07 (10/17): Quantum circuits, BQTIME, Grover's search
- Supplementary reading: (Grover's search) N&C 6-6.1,6.4
- Supplementary reading: (Complexity Theory) N&C Chapter 3, Arora and Barak Chapters 2,7
- Supplementary reading: (BQP) Arora and Barak Chapter 10.3
- Supplementary reading: (BQP) Kitaev, Shen, Viyali Chapter 9.4
- Lecture 07 notes
- Lecture 08 (10/22): Optimality of Grover's search
- Lecture 09 (10/24): Bernstein-Vazirani and Simon's algorithms
- Lecture 10 (10/29): Quantum Fourier Transform, Abelian hidden subgroup
- Lecture 11 (10/31): Order finding and factoring problems (part i)
- Lecture 12 (11/05): Order finding and factoring problems (part ii) and classical simulation of quantum computations
- Lecture 13 (11/07): Classical simulation of quantum computations, BQP and QMA
- Lecture 14 (11/12): BQP and QMA
- Supplementary reading: Combination of Lecture 13 and 15 suggested readings.
- Lecture 14 notes
- Lecture 15 (11/14): Local Hamiltonian problem, QMA-completeness
- Supplementary reading: Chapter 14 of Kitaev, Vyali and Shen. Note, back then the class QMA was known as BQNP.
- Lecture 15 notes
- Lecture 16 (11/19): QMA-completeness, Intro to Error-correction
- Lecture 17 (11/21): Conditions for error-correction, Stabilizer codes
- Lecture 18 (11/26): The toric code construction
- Lecture 19 (12/03): Hamiltonian simulation
- Lecture 20 (12/05): Guest lecture on fault tolerance by Michael Beverland (IBM)
- Final Exam (12/02 or 12/09)
>
For the final you can bring any notes either you wrote or I wrote; you can bring a digital copy but turn off the wifi chip in your computer and the proctor will be supervising digital use. No external sources are allowed and no textbooks. The exam will be two hours long.
Problem sets and grading
Submit problem sets via Gradescope.
Grades in this course are based 70% on problem sets and 30% on the final. As this is a graduate course, we will try to be lenient for reasonable extension requests on problem sets but all requests are up to the discretion of the TA and a reason for refusal or approval will not be given.
Do not use artificial intelligence or large-language models for solving your problem sets or exams in any shape or form.
Guidelines, Resources and Expectations
The following is consistent with the standards set at the University of Washington at large.
Academic Integrity
The University takes academic integrity very seriously. Behaving with integrity is part of our responsibility to our shared learning community. If you’re uncertain about if something is academic misconduct, ask me. I am willing to discuss questions you might have.
Acts of academic misconduct may include but are not limited to:
- Cheating (working collaboratively on quizzes/exams and discussion submissions, sharing answers, and previewing quizzes/exams)
- Plagiarism (representing the work of others as your own without giving appropriate credit to the original author(s))
Concerns about these or other behaviors prohibited by the Student Conduct Code will be referred for investigation and adjudication by (include information for specific campus office).
Students found to have engaged in academic misconduct may receive a zero on the assignment (or other possible outcome).
Conduct
The University of Washington Student Conduct Code (WAC 478-121) defines prohibited academic and behavioral conduct and describes how the University holds students accountable as they pursue their academic goals. Allegations of misconduct by students may be referred to the appropriate campus office for investigation and resolution. More information can be found online here.
Accessibility and Disability Resources
Your experience in this class is important to me. It is the policy and practice of the University of Washington to create inclusive and accessible learning environments consistent with federal and state law. If you have already established accommodations with Disability Resources for Students (DRS), please activate your accommodations via myDRS so we can discuss how they will be implemented in this course.
If you have not yet established services through DRS, but have a temporary health condition or permanent disability that requires accommodations (conditions include but not limited to; mental health, attention-related, learning, vision, hearing, physical or health impacts), contact DRS directly to set up an Access Plan. DRS facilitates the interactive process that establishes reasonable accommodations. Contact DRS at disability.uw.edu.
Religious Accomodations
Washington state law requires that UW develop a policy for accommodation of student absences or significant hardship due to reasons of faith or conscience, or for organized religious activities. The UW’s policy, including more information about how to request an accommodation, is available at Religious Accommodations Policy (https://registrar.washington.edu/staffandfaculty/religious-accommodations-policy/). Accommodations must be requested within the first two weeks of this course using the Religious Accommodations Request form (https://registrar.washington.edu/students/religious-accommodations-request/).
Safety
Call SafeCampus at 206-685-7233 anytime – no matter where you work or study – to anonymously discuss safety and well-being concerns for yourself or others. SafeCampus’s team of caring professionals will provide individualized support, while discussing short- and long-term solutions and connecting you with additional resources when requested.
The University of Washington prohibits sex discrimination and sex-based harassment and expects all UW community members to respect one another in our shared academic and work environments. Sex discrimination and sex-based harassment can include sexual assault, relationship violence, stalking, unwanted sexual contact, sexual exploitation, sexual harassment, and discrimination based on sex.
Students who believe they have experienced sex discrimination or sex-based harassment are encouraged to contact a Title IX case manager by making a Title IX report. The case manager can provide guidance on available support resources and resolution options.
*. This course was previously known as CSE 599Q.↩
†. Course schedule and contents subject to change and will be announced throughout the term.↩