nLab Shor's algorithm

Idea

A prime factorization algorithm for quantum computers (cf. quantum algorithm).

Related concepts

• Grover's algorithm

• Deutsch-Jozsa algorithm

• quantum complexity theory

• quantum supremacy

References

Due to:

• Peter W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proceedings 35th Annual Symposium on Foundations of Computer Science, IEEE Comput. Soc. Press: 124-134 (1994) [doi:10.1109/SFCS.1994.365700]

• Daniel R. Simon, On the power of quantum computation, SIAM Journal on Computing 26 5 (1997) [doi:10.1137/S0097539796298637, pdf]

Early review:

• Yuri I. Manin, Classical computing, quantum computing, and Shor’s factoring algorithm, Astérisque, 266 Séminaire Bourbaki 862 (2000) 375-404 [arXiv:quant-ph/9903008, numdam:SB_1998-1999__41__375_0]

Further review:

• Daniel Simon, Exploring Simon’s Algorithm with Daniel Simon (Oct 2021)

  A bit of amusing history: I submitted my algorithm to a theoretical computer science conference (STOC 1993), but it was rejected. However, Peter Shor was on the program committee for that conference, and immediately saw the potential (that I had had absolutely no inkling of, to be honest) for applying the same general algorithm structure to concrete problems like factoring and discrete logarithms. After trying unsuccessfully to persuade the committee to accept my paper, he got to work on his own, and submitted it to the next major theoretical computer science conference (FOCS 1993)—in parallel with mine, resubmitted. We had in fact agreed to merge the papers if only his was accepted, but the committee fortunately agreed to accept them both, giving us each credit for our respective portions of the resulting achievement.”

• Renato Portugal, Basic Quantum Algorithms [arXiv:2201.10574]

Textbook account:

• Giuliano Benenti, Giulio Casati, Davide Rossini, Section 3.14 of: Principles of Quantum Computation and Information, World Scientific 2018 (doi:10.1142/10909, 2004 pdf)

Lecture notes:

• Scott Aaronson, Chapters 18-21 of: Introduction to Quantum Information Science (2018) [pdf, webpage]

Formulation in Quipper:

• Safat Siddiqui, Mohammed Jahirul Islam, Omar Shehab, §4.3, §4.5 in: Five Quantum Algorithms Using Quipper [arXiv:1406.4481]

See also:

• Wikipedia, Shor’s algorithm

• Wikipedia, Simon’s problem

On compiling Shor’s algorithm to su(2)-anyon braid quantum gates (i.e. implementation in topological quantum computation):

• M. Baraban, Nicholas E. Bonesteel, Steven H. Simon, Resources required for topological quantum factoring, Phys. Rev. A 81 062317 (2010) [doi:10.1103/PhysRevA.81.062317, arXiv:1002.0537]

On (requirements for) actual implementation of Shor’s algorithm on a quantum computer:

• Craig Gidney, Martin Ekerå, How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits, Quantum 5 (2021) 433 [doi:10.22331/q-2021-04-15-433, pdf, video:YT]

  [p. 2:] Although Shor’s algorithms run in polynomial time, and although there has been significant historical work focusing on reducing the cost of Shor’s algorithms and large scale quantum computing architectures, the constant factors hidden by the asymptotic notation remain substantial. These constant factors must be overcome, by heavy optimization at all levels, in order to make the algorithms practical.

  Current quantum computers are far from being capable of executing Shor’s algorithms for cryptographically relevant problem sizes.“