Reptation quantum Monte Carlo algorithm for lattice Hamiltonians with a directed-update scheme

Giuseppe Carleo, Federico Becca, Saverio Moroni, and Stefano Baroni
Phys. Rev. E 82, 046710 – Published 25 October 2010

Abstract

We provide an extension to lattice systems of the reptation quantum Monte Carlo algorithm, originally devised for continuous Hamiltonians. For systems affected by the sign problem, a method to systematically improve upon the so-called fixed-node approximation is also proposed. The generality of the method, which also takes advantage of a canonical worm algorithm scheme to measure off-diagonal observables, makes it applicable to a vast variety of quantum systems and eases the study of their ground-state and excited-state properties. As a case study, we investigate the quantum dynamics of the one-dimensional Heisenberg model and we provide accurate estimates of the ground-state energy of the two-dimensional fermionic Hubbard model.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 18 March 2010

DOI:https://doi.org/10.1103/PhysRevE.82.046710

©2010 American Physical Society

Authors & Affiliations

Giuseppe Carleo, Federico Becca, Saverio Moroni, and Stefano Baroni

  • Scuola Internazionale Superiore di Studi Avanzati (SISSA) and Democritos National Simulation Center, Istituto Officina dei Materiali del CNR, Via Bonomea 265, I-34136 Trieste, Italy

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 82, Iss. 4 — October 2010

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 E

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×