Sign inSign in
ConceptPhysics

Shor's algorithm

A quantum algorithm for integer factorization that can find the prime factors of a number exponentially faster than the best known classical algorithms.
as Shohini Ghose defines itWilfrid Laurier UniversityThe wording closest to all 4 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

4

Each in their own terms, from the easiest level.

  • Ryan O'Donnell

    Carnegie Mellon University · Undergraduate

    A polynomial-time quantum algorithm for integer factorization published by Peter Shor in 1994.
    • 44:5010^500 Parallel Universes
  • Andrew Helwer

    Microsoft Research · Undergraduate

    An algorithm that can efficiently factor large composite numbers to break RSA encryption.
    • 1:57Quantum Computing for Computer Scientists
  • Michele Mosca

    Ruhr University Bochum · Undergraduate

    A quantum algorithm that breaks deployed public key cryptography methods.
    • 12:37The Future of Quantum Computing and Post-Quantum Cryptography

Connections

8

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

4 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.