Lecture 19: Shor's Algorithm for Factoring 🔢

0:00 Factoring problem for large integers
4:44 Example: how to factor N if we know orders of elements in Z_N^*
10:54 Problem of finding the multiplicative order of a remainder
15:34 The steps of Shor's algorithm
25:18 Analysis of Shor's algorithm: classical computation step
33:32 Analysis of Shor's algorithm: partial measurement step
37:45 Analysis of Shor's algorithm: Quantum Fourier Transform step
51:15 Example: factoring N=989

In this lecture we present and analyze Peter Shor's quantum algorithm for factorization of large integers.

This is a lecture in a graduate course "Quantum Computing".

My book "Quantum Computing for High School Students" is available here: https://qubitpublishing.com/ or from Amazon.

Complete playlist for this course:
https://www.youtube.com/playlist?list=PLu6jbin1VpDD87rdSDF4HRfITWF_LwgOx