Skip to content
lectern.tv
CMU 15-859BB: Quantum Computation and Quantum Information →0/17
1

Lecture 1: 10^500 Parallel Universes (15-859BB)

1:08:48
2

Lecture 2: Rotate, Compute, Rotate (15-859BB)

1:20:24
3

Lecture 3: Understanding and Measuring One Qubit (15-859BB)

1:21:29
4

Lecture 4: Unitary Transformations and the Elitzur--Vaidman Bomb (15-859BB)

1:21:50
5

Lecture 5: Multi-Qubit Systems (15-859BB)

1:22:43
6

Lecture 6: Partial Measurements and Spooky Action at a Distance (15-859BB)

1:22:24
7

Lecture 7: The CHSH Game (15-859BB)

53:31
8

Lecture 8: No Cloning Theorem, and Quantum Teleportation (15-859BB)

1:22:32
9

Lecture 9: Quantum Money (15-859BB)

1:24:38
10

Lecture 10: Basics of Quantum Computing (15-859BB)

1:22:30
11

Lecture 11: Revealing XOR-patterns I (15-859BB)

1:23:44
12

Lecture 12: Revealing XOR-patterns II (15-859BB)

1:21:09
13

Lecture 13: Simon's Algorithm (15-859BB)

1:21:33
14

Lecture 14: The Fourier Transform over Z_n (15-859BB)

1:23:01
15

Lecture 15: Period-Finding (Simon's Algorithm over Z_N) (15-859BB)

1:22:41
16

Lecture 16: Shor's Factoring Algorithm (15-859BB)

1:20:16
17

Lecture 17: The Hidden Subgroup Problem (15-859BB)

1:23:24

Lecture 16: Shor's Factoring Algorithm (15-859BB)

Ryan O'DonnellCarnegie Mellon University

Professor

1:20:16·2018·graduate level

This pivotal lecture details Shor's algorithm, demonstrating its polynomial-time efficiency for integer factorization and its profound implications for classical cryptography.

Theory & AlgosAlgorithms & Data StructuresCryptographyShor's AlgorithmInteger Factorization

Quantum Computation and Quantum Information

Lecture 16: Shor's Factoring Algorithm

Carnegie Mellon Course 15-859BB, Fall 2018

Previous · Lecture 15

Lecture 15: Period-Finding (Simon's Algorithm over Z_N) (15-859BB)

Next · Lecture 17

Lecture 17: The Hidden Subgroup Problem (15-859BB)

Seminar notes & discussion

Sign in to comment

No public seminar notes on this lecture yet.