Shor's algorithm

Shor's algorithm
Name	Shor's algorithm
Inventor	Peter Shor
Year	1994
Field	Quantum computing
Problem	Integer factorization, discrete logarithm

Shor's algorithm is a quantum algorithm for integer factorization and discrete logarithms discovered by Peter Shor. It transformed research in Peter Shor, 1994, MIT, Bell Labs, AT&T, and Thesis-level quantum information studies by demonstrating an exponential speedup over known classical algorithms such as General number field sieve, Trial division, Pollard's rho algorithm, Quadratic sieve, and work by John Pollard. The algorithm connected advances in Paul Benioff's quantum Turing machine concept, Richard Feynman's proposals for quantum simulation, and the Quantum Fourier transform era centered at IBM, Microsoft Research, Google Quantum AI, and IonQ.

Background

Shor's algorithm emerged from the intersection of theoretical computer science and experimental physics through collaborations and context involving Peter Shor, Charles Bennett, Gilles Brassard, Lov Grover, David Deutsch, and institutions like Bell Labs, MIT, IBM Research, Los Alamos National Laboratory, and Centre for Quantum Technologies. Its development relied on prior results in number theory by Leonhard Euler, Carl Friedrich Gauss, Évariste Galois, and modern computational number theory research at Princeton University, Stanford University, Harvard University, and University of Cambridge. The algorithm leverages the Quantum Fourier transform and period-finding techniques informed by classical analyses such as Von Neumann-era operator theory and later complexity classes like BQP, NP, and P in the taxonomy popularized at Clay Mathematics Institute discussions and ACM and IEEE conferences.

Algorithm overview

Shor's algorithm reduces integer factorization to order-finding and discrete logarithm problems by using quantum registers, superposition, modular exponentiation, and the Quantum Fourier transform. The high-level steps parallel ideas from classical algorithms such as the Pollard rho algorithm and the Continued fraction algorithm studied at University of Waterloo and ETH Zurich: choose a random base co-prime to the composite N (informed by Euclid's algorithm), set up a periodic function f(x)=a^x mod N, use a quantum period-finding subroutine to estimate the order r, then derive nontrivial factors via gcd computations and chance-based checks similar to Fermat-style methods and analyses by Atkin and Morain. The strategy is related to modular arithmetic foundations taught at École Normale Supérieure and utilized in cryptology curricula at University of California, Berkeley and Massachusetts Institute of Technology.

Quantum subroutines

Key quantum subroutines include state preparation, modular exponentiation performed via reversible arithmetic circuits inspired by designs at IBM Research and Intel, the Quantum Fourier transform implementation attributed to early work at IBM, and measurement yielding phase estimates linked to Kitaev's phase estimation framework. Implementations reference quantum error correction schemes by Shor (distinct from the factoring algorithm), Andrew Steane, and Daniel Gottesman; fault-tolerant constructions developed at National Institute of Standards and Technology, University of Oxford, and University of Bristol; and gate decompositions influenced by Solovay–Kitaev theorem work attributed to Robert Kitaev and contributors at Yale University and Caltech. The algorithm relies on reversible modular multiplication circuits designed in collaborations involving Michele Mosca, Christof Zalka, Jozsef K. F.-era research groups, and follow-on optimizations at Microsoft Research and Rigetti Computing.

Complexity and performance

The theoretical complexity of Shor's algorithm is polynomial in the number of bits of N, with time complexity often cited as O((log N)^3) or O((log N)^2 (log log N)(log log log N)) depending on the arithmetic model and the optimizations credited to work at University of Bristol, University of Waterloo, University of Cambridge, and Los Alamos National Laboratory. This contrasts with the sub-exponential performance of the General number field sieve developed by collaborative teams at CWI, École Polytechnique, and RSA Laboratories. Complexity class implications tied to BQP vs. NP debates were widely covered in panels at ACM STOC, IEEE FOCS, and colloquia featuring Scott Aaronson, Umesh Vazirani, Lov Grover, and Seth Lloyd.

Implementations and experiments

Experimental demonstrations of components and small instances were carried out on platforms developed by IBM, Google Quantum AI, IonQ, University of Science and Technology of China, and academic groups at University of Innsbruck and University of Oxford. Early compiled demonstrations factoring small integers involved technologies from NMR groups at Los Alamos National Laboratory and superconducting qubit experiments at IBM Q Experience and Google Sycamore. Hybrid implementations and resource estimates have been published by teams at Microsoft Research, Rigetti Computing, D-Wave Systems (comparative studies), and consortia including EU Quantum Flagship and US National Quantum Initiative. Scaling challenges reference error rates, coherence times, gate fidelities, and fault-tolerant thresholds established in work at NIST and Quantinuum.

Applications and cryptographic impact

The cryptographic impact focused attention on public-key systems including RSA (cryptosystem), Diffie–Hellman key exchange, ElGamal encryption, and standards maintained by NIST, ISO/IEC, and IETF. Anticipation of large-scale quantum implementations spurred research in post-quantum cryptography communities at NIST and projects led by Ronald Rivest, Adi Shamir, Leonard Adleman, and others associated with RSA Laboratories to standardize lattice-based, hash-based, code-based, and multivariate schemes studied at Google, Microsoft, IBM, and universities such as Cornell University and Technion. National responses involved policy actions by US Department of Defense, European Union, and research funding from agencies including NSF and EPSRC to accelerate cryptographic transitions and quantum-resistant algorithm deployments.

Category:Quantum algorithms