title: Note: A pure-sampling quantum Monte Carlo algorithm with independent Metropolis.
abstract: 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.
authors.affiliation: Department of Mathematics, Brock University, St. Catharines, Ontario L2S 3A1, Canada.
authors.forename: Jan
authors.initials: J
authors.lastname: Vrbik
authors.affiliation: Department of Physics, Brock University, St. Catharines, Ontario L2S 3A1, Canada.
authors.forename: Egor
authors.initials: E
authors.lastname: Ospadov
authors.affiliation: Department of Physics, Brock University, St. Catharines, Ontario L2S 3A1, Canada.
authors.forename: Stuart M
authors.initials: SM
authors.lastname: Rothstein