Flat Histogram Methods for Quantum Systems: Algorithms to Overcome Tunneling Problems and Calculate the Free Energy

Matthias Troyer, Stefan Wessel, and Fabien Alet
Phys. Rev. Lett. 90, 120201 – Published 26 March 2003

Abstract

We present a generalization of the classical Wang-Landau algorithm [Phys. Rev. Lett. 86, 2050 (2001)] to quantum systems. The algorithm proceeds by stochastically evaluating the coefficients of a high temperature series expansion or a finite temperature perturbation expansion to arbitrary order. Similar to their classical counterpart, the algorithms are efficient at thermal and quantum phase transitions, greatly reducing the tunneling problem at first order phase transitions, and allow the direct calculation of the free energy and entropy.

  • Figure
  • Figure
  • Figure
  • Figure
  • Received 9 July 2002

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

©2003 American Physical Society

Authors & Affiliations

Matthias Troyer1,2, Stefan Wessel1, and Fabien Alet1,2,3

  • 1Theoretische Physik, ETH Zürich, CH-8093 Zürich, Switzerland
  • 2Computation Laboratory, ETH Zürich, CH-8092 Zürich, Switzerland
  • 3Laboratoire de Physique Quantique, Université Paul Sabatier, 31062 Toulouse, France

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 90, Iss. 12 — 28 March 2003

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
×