Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Κβαντικό Μόντε Κάρλο× | Ολοκληρωτική Μέθοδος Μόντε Κάρλο× | |
|---|---|---|
| Πεδίο | Κβαντική Υπολογιστική | Κβαντική Υπολογιστική |
| Οικογένεια | Machine learning | Machine learning |
| Έτος προέλευσης≠ | 1953 | 1948 |
| Δημιουργός≠ | Nicholas Metropolis and colleagues | Richard Feynman |
| Τύπος≠ | Monte Carlo simulation | Stochastic simulation |
| Θεμελιώδης πηγή≠ | Metropolis, N., Rosenbluth, A. W., et al. (1953). Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21, 1087–1092. DOI ↗ | Feynman, R. P. (1948). Space-time approach to non-relativistic quantum mechanics. Reviews of Modern Physics, 20, 367–387. DOI ↗ |
| Εναλλακτικές ονομασίες≠ | QMC, variational Monte Carlo, diffusion Monte Carlo | PIMC, Feynman path integral |
| Συναφείς | 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. | 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. |
| ScholarGateΣύνολο δεδομένων ↗ |
|
|