Untitled

Related lectures (28)

Introduces the course syllabus, grading scheme, and classical and quantum computation models.

Covers function composition and integers, including properties and examples.

Covers the Shor Algorithm for period finding and its application in factorization, discussing the circuit implementation and measurement outcomes.

Covers functions, integers, GCD, and reasoning by recurrence, including the Euclidean algorithm and induction principle.

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

Explores cosets in commutative groups, Lagrange theorem, and integer factorization.

Explores well ordering, induction, Euclidean division, and prime factorization in integers.

Page 2 of 2