Sign inSign in

Shor's factoring algorithm

A quantum algorithm for factoring integers in polynomial time.
as Ryan O'Donnell defines itCarnegie Mellon UniversityThe wording closest to all 3 definitions
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Lecturers

2

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    A quantum algorithm published in 1994 that factors n-bit integers in O~(n2)\tilde{O}(n^2) time.
    • 6:10Quantum Computing Overview
  • Margaret Martonosi

    Princeton University · Research

    A quantum algorithm for integer factorization that can break RSA encryption by finding the period of a function.
    • 13:07Architecture & Systems in Quantum Computing: Opportunities and Challenges

Connections

6

The lectures that define it or assume it, and the concepts next to it.

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.