方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| 量子蒙特卡洛× | Shor 算法× | |
|---|---|---|
| 领域 | 量子计算 | 量子计算 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1953 | 1994 |
| 提出者≠ | Nicholas Metropolis and colleagues | Peter Shor |
| 类型≠ | Monte Carlo simulation | Quantum algorithm |
| 开创性文献≠ | Metropolis, N., Rosenbluth, A. W., et al. (1953). Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21, 1087–1092. DOI ↗ | 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 ↗ |
| 别名≠ | QMC, variational Monte Carlo, diffusion Monte Carlo | Shor factorization, quantum factorization |
| 相关 | 3 | 3 |
| 摘要≠ | Quantum Monte Carlo (QMC) is a stochastic computational method for computing ground state properties of quantum many-body systems. Combining classical Monte Carlo sampling with quantum mechanics, QMC approaches are among the most accurate methods available for electronic structure and condensed matter physics, achieving sub-percent accuracy for many systems. | 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. |
| ScholarGate数据集 ↗ |
|
|