Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Ολοκληρωτική Μέθοδος Μόντε Κάρλο× | Κβαντικό Μόντε Κάρλο× | |
|---|---|---|
| Πεδίο | Κβαντική Υπολογιστική | Κβαντική Υπολογιστική |
| Οικογένεια | Machine learning | Machine learning |
| Έτος προέλευσης≠ | 1948 | 1953 |
| Δημιουργός≠ | Richard Feynman | Nicholas Metropolis and colleagues |
| Τύπος≠ | Stochastic simulation | Monte Carlo simulation |
| Θεμελιώδης πηγή≠ | Feynman, R. P. (1948). Space-time approach to non-relativistic quantum mechanics. Reviews of Modern Physics, 20, 367–387. DOI ↗ | Metropolis, N., Rosenbluth, A. W., et al. (1953). Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21, 1087–1092. DOI ↗ |
| Εναλλακτικές ονομασίες≠ | PIMC, Feynman path integral | QMC, variational Monte Carlo, diffusion Monte Carlo |
| Συναφείς | 3 | 3 |
| Σύνοψη≠ | Path Integral Monte Carlo (PIMC) is a computational method for calculating thermodynamic and structural properties of quantum systems using Feynman's path integral formulation. Developed rigorously by David Ceperley and colleagues in the 1990s, PIMC treats quantum particles as classical polymers in a higher-dimensional space, enabling efficient Monte Carlo sampling of quantum statistics. | 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. |
| ScholarGateΣύνολο δεδομένων ↗ |
|
|