Note: A pure-sampling quantum Monte Carlo algorithm with independent Metropolis
- Department of Mathematics, Brock University, St. Catharines, Ontario L2S 3A1 (Canada)
Recently, Ospadov and Rothstein published a pure-sampling quantum Monte Carlo algorithm (PSQMC) that features an auxiliary Path Z that connects the midpoints of the current and proposed Paths X and Y, respectively. When sufficiently long, Path Z provides statistical independence of Paths X and Y. Under those conditions, the Metropolis decision used in PSQMC is done without any approximation, i.e., not requiring microscopic reversibility and without having to introduce any G(x → x′; τ) factors into its decision function. This is a unique feature that contrasts with all competing reptation algorithms in the literature. An example illustrates that dependence of Paths X and Y has adverse consequences for pure sampling.
- OSTI ID:
- 22675975
- Journal Information:
- Journal of Chemical Physics, Vol. 145, Issue 2; Other Information: (c) 2016 Author(s); Country of input: International Atomic Energy Agency (IAEA); ISSN 0021-9606
- Country of Publication:
- United States
- Language:
- English
Similar Records
A pure-sampling quantum Monte Carlo algorithm
Metis: A Pure Metropolis Markov Chain Monte Carlo Bayesian Inference Library