Kenji Harada, Naoki Kawashima
Published 2002-05-23, updated 2002-12-27Version 3
Recently, Syljuasen and Sandvik proposed a new framework for constructing algorithms of quantum Monte Carlo simulation. While it includes new classes of powerful algorithms, it is not straightforward to find an efficient algorithm for a given model. Based on their framework, we propose an algorithm that is a natural extension of the conventional loop algorithm with the split-spin representation. A complete table of the vertex density and the worm-scattering probability is presented for the general XXZ model of an arbitrary S with a uniform magnetic field.
Comments: 12 pages, 7 figures, insert a word "squared" in the first line of the caption of Fig.7 and correct the label of vertical axis of Fig.7
Journal: PHYSICAL REVIEW E 66, 056705 (2002)
Method to Observe Anomaly of Magnetic Susceptibility for Quantum Spin Systems
Heat transport in an ordered harmonic chain in presence of a uniform magnetic field
A Multigrid Algorithm for Sampling Imaginary-Time Paths in Quantum Monte Carlo Simulations
