Parallelized Quantum Monte Carlo Algorithm with Nonlocal Worm Updates

Akiko Masaki-Kato, Takafumi Suzuki, Kenji Harada, Synge Todo, and Naoki Kawashima
Phys. Rev. Lett. 112, 140603 – Published 10 April 2014
PDFHTMLExport Citation

Abstract

Based on the worm algorithm in the path-integral representation, we propose a general quantum Monte Carlo algorithm suitable for parallelizing on a distributed-memory computer by domain decomposition. Of particular importance is its application to large lattice systems of bosons and spins. A large number of worms are introduced and its population is controlled by a fictitious transverse field. For a benchmark, we study the size dependence of the Bose-condensation order parameter of the hard-core Bose-Hubbard model with L×L×βt=10240×10240×16, using 3200 computing cores, which shows good parallelization efficiency.

  • Figure
  • Figure
  • Figure
  • Received 17 October 2013

DOI:https://doi.org/10.1103/PhysRevLett.112.140603

© 2014 American Physical Society

Authors & Affiliations

Akiko Masaki-Kato1, Takafumi Suzuki2, Kenji Harada3, Synge Todo1,4, and Naoki Kawashima1

  • 1Institute for Solid State Physics, University of Tokyo, Chiba, Japan 277-8581
  • 2Graduate School of Engineering, University of Hyogo, Himeji, Japan 671-2280
  • 3Graduate School of Informatics, Kyoto University, Kyoto, Japan 615-8063
  • 4Department of Physics, University of Tokyo, Tokyo, Japan 113-0033

Article Text (Subscription Required)

Click to Expand

Supplemental Material (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 112, Iss. 14 — 11 April 2014

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×