Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Monte-Carlo quantique× | Path Integral Monte Carlo× | |
|---|---|---|
| Domaine | Informatique quantique | Informatique quantique |
| Famille | Machine learning | Machine learning |
| Année d'origine≠ | 1953 | 1948 |
| Auteur d'origine≠ | Nicholas Metropolis and colleagues | Richard Feynman |
| Type≠ | Monte Carlo simulation | Stochastic simulation |
| Source fondatrice≠ | 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 ↗ |
| Alias≠ | QMC, variational Monte Carlo, diffusion Monte Carlo | PIMC, Feynman path integral |
| Apparentées | 3 | 3 |
| Résumé≠ | 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. |
| ScholarGateJeu de données ↗ |
|
|