Flat Histogram Methods for Quantum Systems: Algorithms to Overcome Tunneling Problems and Calculate the Free Energy
- 26 March 2003
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 90 (12) , 120201
- https://doi.org/10.1103/physrevlett.90.120201
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.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- Quantum Monte Carlo with directed loopsPhysical Review E, 2002
- Efficient, Multiple-Range Random Walk Algorithm to Calculate the Density of StatesPhysical Review Letters, 2001
- Maximum entropy method of obtaining thermodynamic properties from quantum Monte Carlo simulationsPhysical Review B, 2000
- Stochastic series expansion method with operator-loop updatePhysical Review B, 1999
- Exact, complete, and universal continuous-time worldline Monte Carlo approach to the statistics of discrete quantum systemsJournal of Experimental and Theoretical Physics, 1998
- Simulations of Discrete Quantum Systems in Continuous Euclidean TimePhysical Review Letters, 1996
- Cluster algorithm for vertex modelsPhysical Review Letters, 1993
- Collective Monte Carlo Updating for Spin SystemsPhysical Review Letters, 1989
- Nonuniversal critical dynamics in Monte Carlo simulationsPhysical Review Letters, 1987
- Equation of State Calculations by Fast Computing MachinesThe Journal of Chemical Physics, 1953