Introduction to Quantum Information Processing
QIC 710, CS 768, CO 681, PHYS 767, AMATH 871, PMATH 871 (Fall 2022)
[main]
Video lectures (click on any title to get a YouTube thumbnail for the lecture)
Part 1: A primer for beginners
Lecture 1: What is a qubit?
Duration 43:39
Lecture 2: Systems with multiple qubits
Duration 25:29
Lecture 3: Superdense coding and measurements involving multiple qubits
Duration 37:12 Cutout for slide 11: [pdf]
Lecture 4: Teleportation and the question of copying quantum states
Duration 19:40
|
Part 2: Quantum algorithms
Lecture 5: Quantum circuits and classical circuits as algorithms
Duration 28:36
Lecture 6: Simple quantum algorithms in the black box model
Duration 32:18
Lecture 7: Simon's problem
Duration 31:05
Slide 4: a proof of the classical lower bound is on page 34 of these lecture notes
(Quantum Algorithms I, section 6.2.1).
Lecture 8: The discrete log problem
Duration 38:44 Supplementary: [pdf]
Lecture 9: Quantum Fourier transform
Duration 17:00
Lecture 10: The phase estimation problem
Duration 26:21
Lecture 11: Algorithms for order-finding and factoring
Duration 37:55 Supplementary: [pdf]
Lecture 12: Grover's search algorithm
Duration 28:52
Lecture 13: Optimality of Grover's search algorithm
Duration 12:57
|
Part 3: Quantum information theory
Lecture 14: Quantum states as density matrices
Duration 30:01
Lecture 15: State transitions via Kraus operators
Duration 32:39
Lecture 16: Stinespring form vs. Kraus form
Duration 25:54
Lecture 17: Distance measures between states
Duration 22:56
Lecture 18: Simple quantum error-correcting codes
Duration 27:13
Lecture 19: Calderbank-Shor-Steane codes
Duration 28:39
Lecture 20: Nonlocality
Duration 26:16
Lecture 21: Bell/CHSH inequality
Duration 22:37
|
Lecture 22: (to be inserted)
Part 4: Quantum cryptography
Lecture 23: The BB84 key distribution scheme
Duration 28:36 Slides: [pdf]
|