by Ben Prather

Shor's Algorithm

An informal description of Shor's algorithm for factorization by a quantum computer.

Presentation Summary

In this presentation, I go over the two basic components of Shor’s algorithm:

  • The number theory required to reduce the factorization problem to a period-finding problem
  • The quantum fourier transform, which finds the period of a function in polynomial time

References

  • Several more comprehensive descriptions of the algorithm are listed on the last slide

All Quantum Computing

ALGORITHM
quantum algorithms factorization number theory

Archive