Machine learningNumber-theoretic Algorithm
Shor 算法
Shor 算法是一种用于大整数分解和离散对数计算的多项式时间量子算法，这些问题被认为在经典计算机上是难以处理的。该算法由 Peter Shor 于 1994 年发现，它展示了量子计算机在破解 RSA 等广泛使用的密码系统方面的潜力，标志着量子计算理论的一个里程碑。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- 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. link ↗
如何引用本页
ScholarGate. (2026, June 3). Shor's Algorithm for Integer Factorization and Discrete Logarithm. ScholarGate. https://scholargate.app/zh/quantum-computing/shors-algorithm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →