Introduction to Quantum Information Processing
QIC 710, CS 768, CO 681, PHYS 767, AMATH 871, PMATH 871 (Fall 2025)

[main]

Old video lectures (from 2020)

Click on any title to get a YouTube thumbnail for the lecture
Recommendation: watch at speed ≥ 1.25

Part 1: A primer for beginners

Lecture 1: What is a qubit?

Duration 43:39 (34:55 at 1.25 speed)

Lecture 2: Systems with multiple qubits

Duration 25:29 (20:23 at 1.25 speed)

Lecture 3: Superdense coding and measurements involving multiple qubits

Duration 37:12 (29:46 at 1.25 speed)      Cutout for slide 11: [pdf]

Lecture 4: Teleportation and the question of copying quantum states

Duration 19:40 (15:44 at 1.25 speed)


Part 2: Quantum algorithms
Lecture 5: Quantum circuits and classical circuits as algorithms

Duration 28:36 (22:53 at 1.25 speed)

Lecture 6: Simple quantum algorithms in the black box model

Duration 32:18 (25:50 at 1.25 speed)

Lecture 7: Simon's problem

Duration 31:05 (24:52 at 1.25 speed)

Slide 4: a proof of the classical lower bound is in section 6.2.1 of the course lecture notes [Part 2: Quantum algorithms]

Lecture 8: The discrete log problem

Duration 38:44 (30:59 at 1.25 speed)     Supplementary: [pdf]

Lecture 9: Quantum Fourier transform

Duration 17:00 (13:36 at 1.25 speed)

Lecture 10: The phase estimation problem

Duration 26:21 (21:05 at 1.25 speed)

Lecture 11: Algorithms for order-finding and factoring

Duration 37:55 (30:20 at 1.25 speed)     Supplementary: [pdf]

Lecture 12: Grover's search algorithm

Duration 28:52 (23:05 at 1.25 speed)

Lecture 13: Optimality of Grover's search algorithm

Duration 12:57 (10:21 at 1.25 speed)


Part 3: Quantum information theory

Lecture 14: Quantum states as density matrices

Duration 30:01 (24:00 at 1.25 speed)

Lecture 15: State transitions via Kraus operators

Duration 32:39 (26:07 at 1.25 speed)

Lecture 16: Stinespring form vs. Kraus form

Duration 25:54 (20:43 at 1.25 speed)

Lecture 17: Distance measures between states

Duration 22:56 (18:20 at 1.25 speed)

Lecture 18: Simple quantum error-correcting codes

Duration 27:13 (21:46 at 1.25 speed)

Lecture 19: Calderbank-Shor-Steane codes

Duration 28:39 (22:55 at 1.25 speed)

Lecture 20: Nonlocality

Duration 26:16 (21:00 at 1.25 speed)

Lecture 21: Bell/CHSH inequality

Duration 22:37 (18:05 at 1.25 speed)

Note: there is no Lecture 22

Part 4: Quantum cryptography
Lecture 23: The BB84 key distribution scheme

Duration 28:36 (22:52 at 1.25 speed)       Slides: [pdf]