ECE 396 / COS 396 / QSE 320 home |ψ⟩⟨ψ| syllabus |ψ⟩⟨ψ| assignments |ψ⟩⟨ψ| ed Welcome to the Fall 2026 offering of Intro to Quantum Computing! This course will introduce quantum mechanics, and then explore it with an eye towards its power to compute in new and exciting ways. This course has a prerequisite of sophomore linear algebra at the level of MAT 202, 204, 217 or the equivalent. A previous quantum mechanics course will not be required. Beyond linear algebra, a basic understanding of probability, complex numbers, and algorithms is recommended. Please contact the instructor if you wish to take the course but do not currently meet these requirements. Sign up for Meet the Professor here!! Lectures: Mondays and Wednesdays, 10:40 am – 12:00 pm, in Friend Center 006 Instructor office hours: Mondays 12:00 – 1:00 pm, in COS 308 TA office hours: Tuesdays and Thursdays 5:00 – 6:30 pm, in COS 301 Instructor: Ewin Tang Graduate teaching assistants: Lakshika Rathi, Hongkun Chen, Salahedeen Issa Everything here is subject to change. | Date | Lecture | Course information | References and further reading | |---|---|---|---| | 09/02 | What are quantum computers (good for)? how to simulate physical systems; the (extended) Church-Turing thesis; current status of quantum computers; current status of claims of quantum advantage; syllabus based on Aaronson, Lecture 1, O’Donnell(1) Lecture 1, O’Donnell(2) Lecture 3 | pset 0 out | Aaronson, NP-complete Problems and Physical Reality (Can I use physics to cheat the limits of computation?) Feynman, Simulating Physics with Computers (The famous lecture!) Shor, The Early Days of Quantum Computation (Shor’s quantum computing lore) Aaronson, Read the Fine Print (The caveats behind quantum machine learning) Dalzell et al., Quantum Algorithms: A Survey of Applications and End-to-End Complexities (A comprehensive look at applications of quantum computing) |