Shor Algorithm: Period Finding

Related lectures (30)

Page 2 of 3

Explores the Shor algorithm for quantum factorization and its application in finding function periods.

Explores polynomial roots, factorization, and the Euclidean algorithm in depth.

Covers the details of the Shor algorithm circuit and its complexity.

Covers Shor's factoring algorithm and the link between order finding and factoring.

Covers GCD, LCM, and the Euclidean algorithm for efficient computation of GCD.

Covers GCD, LCM, and the Euclidean algorithm for efficient computation.

Covers Lenstra's Algorithm for integer factorization, which efficiently computes prime factors of an integer.

Introduces polynomial factorization over finite fields and efficient computation of greatest common divisors of polynomials.

Introduces greatest common divisor, prime factorization, and the Euclidean Algorithm.

Covers the factorization of polynomials over a field, including division with remainder and common divisors.