Lecture 1: 10^500 Parallel Universes (15-859BB)
1:08:48Lecture 2: Rotate, Compute, Rotate (15-859BB)
1:20:24Lecture 3: Understanding and Measuring One Qubit (15-859BB)
1:21:29Lecture 4: Unitary Transformations and the Elitzur--Vaidman Bomb (15-859BB)
1:21:50Lecture 5: Multi-Qubit Systems (15-859BB)
1:22:43Lecture 6: Partial Measurements and Spooky Action at a Distance (15-859BB)
1:22:24Lecture 7: The CHSH Game (15-859BB)
53:31Lecture 8: No Cloning Theorem, and Quantum Teleportation (15-859BB)
1:22:32Lecture 9: Quantum Money (15-859BB)
1:24:38Lecture 10: Basics of Quantum Computing (15-859BB)
1:22:30Lecture 11: Revealing XOR-patterns I (15-859BB)
1:23:44Lecture 12: Revealing XOR-patterns II (15-859BB)
1:21:09Lecture 13: Simon's Algorithm (15-859BB)
1:21:33Lecture 14: The Fourier Transform over Z_n (15-859BB)
1:23:01Lecture 15: Period-Finding (Simon's Algorithm over Z_N) (15-859BB)
1:22:41Lecture 16: Shor's Factoring Algorithm (15-859BB)
1:20:16Lecture 17: The Hidden Subgroup Problem (15-859BB)
1:23:24Lecture 13: Simon's Algorithm (15-859BB)
This lecture presents Simon's algorithm, a key quantum algorithm that demonstrates exponential speedup over classical algorithms for finding hidden periods in Boolean functions.
Quantum Computation and Quantum Information
Lecture 13: Simon's Algorithm
Carnegie Mellon Course 15-859BB, Fall 2018
Lecture 12: Revealing XOR-patterns II (15-859BB)
Next · Lecture 14Lecture 14: The Fourier Transform over Z_n (15-859BB)
Seminar notes & discussion
No public seminar notes on this lecture yet.