Engineering Local optimality in Quantum Monte Carlo algorithms

Details Engineering Local optimality in Quantum Monte Carlo algorithms Engineering Local optimality in Quantum Monte Carlo algorithms

2005-08-19

arxiv.org/abs/cond-mat/0508462v2

J Comp Phys, 225/2 pp. 2249-2266 (2007)

Physics

Condensed Matter

Statistical Mechanics

replaced with published version

Scientific paper

10.1016/j.jcp.2007.03.013

Quantum Monte Carlo algorithms based on a world-line representation such as the worm algorithm and the directed loop algorithm are among the most powerful numerical techniques for the simulation of non-frustrated spin models and of bosonic models. Both algorithms work in the grand-canonical ensemble and have a non-zero winding number. However, they retain a lot of intrinsic degrees of freedom which can be used to optimize the algorithm. We let us guide by the rigorous statements on the globally optimal form of Markov chain Monte Carlo simulations in order to devise a locally optimal formulation of the worm algorithm while incorporating ideas from the directed loop algorithm. We provide numerical examples for the soft-core Bose-Hubbard model and various spin-S models.

Affiliated with

Also associated with

No associations

Rating

Engineering Local optimality in Quantum Monte Carlo algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Engineering Local optimality in Quantum Monte Carlo algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Engineering Local optimality in Quantum Monte Carlo algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-365296