Syllabus: Course information can be found here.

Recorded lectures from Spring 2021 can be found here. These are not meant as a substitute for coming to class, but you may find them useful. 

The slides below are partially based on and/or inspired by the reading materials mentioned.

New: Printable Slides are condensed versions with minimal pictures and slide transitions, which may be preferable for your note-taking needs. These are new, and feedback is welcome. 

Quantum computing basics

📖   Reading material   Lecture notes (pages 1-14)

Why quantum computing?   (Lecture Slides)  (Printable Slides)

Random bits   (Lecture Slides) (Printable Slides)

Qubits   (Lecture Slides)  (Printable Slides)

Basic measurements   (Lecture Slides)  (Printable Slides)

Multiple qubits   (Lecture Slides)  (Printable Slides)

Partial measurements   (Lecture Slides)  (Printable Slides)

The no-cloning theorem   (Lecture Slides)  (Printable Slides)

Superdense coding   (Lecture Slides)  (Printable Slides)

Teleportation   (Lecture Slides)  (Printable Slides)

The quantum Zeno effect and bomb-testing   (Lecture Slides)  (Printable Slides)

Quantum algorithms

📖   Reading material   Lecture notes (pages 24-38, 70-80)

Quantum gates and circuits   (Lecture Slides)  (Printable Slides)

Superdense coding, teleportation, and no-cloning revisited as circuits   (Lecture Slides)  (Printable Slides)

Gate sets   (Lecture Slides)  (Printable Slides)

Deutsch's algorithm   (Lecture Slides)  (Printable Slides)

The Deutsch-Jozsa algorithm   (Lecture Slides)  (Printable Slides)

Simon's algorithm   (Lecture Slides)  (Printable Slides)

A simple searching algorithm   (Lecture Slides)  (Printable Slides) 

Grover's search algorithm   (Lecture Slides)  (Printable Slides)

Demo: Quantum Flytrap   (Website)

Demo: IBM Quantum Experience   (Website)

Computational complexity theory

📖   Reading material   Lecture notes (pages 133-139)     Lecture notes (pages 207-220)

Classical computational complexity theory   (Lecture Slides)  (Printable Slides)

Quantum computational complexity theory   (Lecture Slides)  (Printable Slides)

Complete problems   (Lecture Slides)  (Printable Slides)

Quantum information

📖   Reading material   Lecture notes (pages 81-93)

Density operators   (Lecture Slides)  (Printable Slides)

General measurements   (Lecture Slides)  (Printable Slides)

Distinguishability and the trace norm   (Lecture Slides)  (Printable Slides)

Similarity and the fidelity function   (Lecture Slides)  (Printable Slides)

Quantum channels   (Lecture Slides)  (Printable Slides)

The partial trace, purifications, and monogamy of entanglement   (Lecture Slides)  (Printable Slides)

Pure state entanglement and von Neumann entropy   (Lecture Slides)  (Printable Slides)

Mixed state entanglement and the PPT Test   (Lecture Slides)  (Printable Slides)

Quantum cryptography

Quantum key distribution   (Lecture Slides)  (Printable Slides)

Impossibility of quantum bit commitment   (Lecture Slides)  (Printable Slides)

Possibility of quantum money   (Lecture Slides)  (Printable Slides)

Quantum error correction

📖   Reading material   Lecture notes (pages 234-260)

Classical error correction   (Lecture Slides)  (Printable Slides)

Quantum error correction and fault tolerance   (Lecture Slides)  (Printable Slides)

The stabilizer formalism   (Lecture Slides)  (Printable Slides)

Adiabatic quantum computation

📖   Reading material   Lecture notes (pages 221-233)

Unitaries, Hamiltonians, and matrix exponentiation, oh my!   (Lecture Slides)  (Printable Slides)

Adiabatic quantum computation   (Lecture Slides)  (Printable Slides)

Shor's factoring algorithm - Bonus Topic

The quantum Fourier transform and its inverse   (Lecture Slides)  (Printable Slides)

Phase estimation   (Lecture Slides)  (Printable Slides)

Computational number theory   (Lecture Slides)  (Printable Slides)

Shor's algorithm for order finding  and factoring   (Lecture Slides)  (Printable Slides)