Method evidence record
Shor's Algorithm
Shor's Algorithm is a polynomial-time quantum algorithm for factoring large integers and computing discrete logarithms, problems believed to be intractable on classical computers. Discovered by Peter Shor in 1994, it demonstrated the potential of quantum computers to break widely used cryptographic systems like RSA, marking a landmark in quantum computing theory.
Source record
Citations copied verbatim from the method’s source record. No claim-level verification is inferred from them.
Shor's Algorithm for Integer Factorization and Discrete Logarithm
Taxonomic method record · ml-model / quantum-computing
- Shor, P. W. (1994). Algorithms for quantum computation: discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 124–134. · DOI 10.1109/SFCS.1994.365700
- Shor, P. W. (1997). Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Review, 41, 303–332. · DOI 10.1137/S0036144598347011
- Ekert, A. K., Raussendorf, R. (2014). A short introduction to quantum computing. Reviews of Modern Physics, 74, 339–373. · URL
Curated claims
Claims persisted in the evidence ledger, each with its own assessment.
No curated claims yet
This view does not invent a claim assessment when the ledger has none.
Related methods
Generated from the method graph and shown as machine-suggested relations — no evidence claim is inferred.