Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Kwantowy Monte Carlo× | Algorytm Shora× | |
|---|---|---|
| Dziedzina | Obliczenia kwantowe | Obliczenia kwantowe |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 1953 | 1994 |
| Twórca≠ | Nicholas Metropolis and colleagues | Peter Shor |
| Typ≠ | Monte Carlo simulation | Quantum algorithm |
| Źródło pierwotne≠ | 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 ↗ |
| Inne nazwy≠ | QMC, variational Monte Carlo, diffusion Monte Carlo | Shor factorization, quantum factorization |
| Pokrewne | 3 | 3 |
| Podsumowanie≠ | 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. |
| ScholarGateZbiór danych ↗ |
|
|