方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| Shor 算法× | 量子相位估计× | |
|---|---|---|
| 领域 | 量子计算 | 量子计算 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1994 | 1995 |
| 提出者≠ | Peter Shor | Alexei Kitaev |
| 类型≠ | Quantum algorithm | Subroutine algorithm |
| 开创性文献≠ | 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 ↗ | Kitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. arXiv preprint quant-ph/9511026. link ↗ |
| 别名 | Shor factorization, quantum factorization | QPE, phase kickback |
| 相关 | 3 | 3 |
| 摘要≠ | 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. | Quantum Phase Estimation (QPE) is a fundamental quantum subroutine that estimates the eigenvalues of a unitary operator. Developed by Alexei Kitaev in 1995, QPE combines controlled unitary evolution with the quantum Fourier transform to extract eigenvalues from quantum states with exponential precision scaling. |
| ScholarGate数据集 ↗ |
|
|