Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:cond-mat/0207138 · Physical Review Letters

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

Matthias Troyer, Stefan Weßel, Fabien Alet

Published Mar 26, 2003• 114 citations
arXivHTMLPDF

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.

DOI
10.1103/physrevlett.90.120201

Related papers

Optimized broad-histogram ensembles for the simulation of quantum systems

Stefan Weßel, Norbert Stoop, Emanuel Gull +2 more

The efficiency of statistical sampling in broad-histogram Monte Carlo simulations can be considerably improved by optimizing the simulated extended ensemble for fastest equilibration. Here we describe how a recently developed feedback algorithm can be generalized to find optimized sampling distributions for the simulation of quantum systems in the context of the stochastic series expansion (SSE) when defining an extended ensemble in the expansion order. If the chosen update method is efficient, such as non-local updates for systems undergoing a second-order phase transition, the optimized ensemble is characterized by a flat histogram in the expansion order if a variable-length formulation of the SSE is used. Whenever the update method suffers from slowdown, such as at a first-order phase transition, the feedback algorithm shifts weight towards the expansion orders in the transition region, resulting in a non-uniform histogram.

arXiv:0710.0024•Journal of Statistical Mechanics Theory and Experiment•Dec 13, 2007•14 citations

Histogram methods for quantum systems: from reweighting to Wang-Landau sampling

Matthias Troyer, Fabien Alet, Stefan Weßel

We discuss how reweighting and histogram methods for classical systems can be generalized to quantum models for discrete and continuous time world line simulations, and the stochastic series expansion (SSE) method. Our approach allows to apply all classical reweighting and histogram techniques for classical systems, as well as multicanonical or Wang-Landau sampling to the quantum case.

Brazilian Journal of Physics•Jun 1, 2004•26 citations

Estimating the partition function zeros by using the Wang-Landau Monte Carlo algorithm

Seung‐Yeon Kim

The concept of the partition function zeros is one of the most efficient methods for investigating the phase transitions and the critical phenomena in various physical systems. Estimating the partition function zeros requires information on the density of states Ω( E ) as a function of the energy E . Currently, the Wang-Landau Monte Carlo algorithm is one of the best methods for calculating Ω( E ). The partition function zeros in the complex temperature plane of the Ising model on an L × L square lattice ( L = 10 ~ 80) with a periodic boundary condition have been estimated by using the Wang-Landau Monte Carlo algorithm. The efficiency of the Wang-Landau Monte Carlo algorithm and the accuracies of the partition function zeros have been evaluated for three different, 5%, 10%, and 20%, flatness criteria for the histogram H ( E ).

Journal of the Korean Physical Society•Mar 1, 2017•4 citations

Reweight-annealing method for evaluating the partition function via quantum Monte Carlo calculations

Yi-Ming Ding, Junsong Sun, Nvsen Ma +3 more

Efficient and accurate algorithms for partition function, free energy, and thermal entropy calculations is of great significance in statistical physics and quantum many-body physics. Here we present an unbiased but low-technical-barrier algorithm within the quantum Monte Carlo framework, which has exceptionally high accuracy and no systemic error. Compared with the conventional specific heat integral method and Wang-Landau sampling algorithm, our method can obtain a much more accurate result of the subleading coefficient of the entropy consistent with theory. This method can be widely used in both classical and quantum Monte Carlo simulations and is easy to be parallelized on a computer.

arXiv:2403.08642•Physical review. B./Physical review. B•Oct 22, 2024•13 citations

Quantum algorithm for Wang-Landau sampling

Garrett T. Floyd, David Paul Landau, Michael R. Geller

It has been shown that the Metropolis algorithm can be implemented on quantum computers in a way that avoids the sign problem. However, flat histogram techniques are often preferred as they don't suffer from the same limitations that afflict Metropolis for problems of real-world interest and provide a host of other benefits. In particular, the Wang-Landau method is known for its efficiency and accuracy. In this work we design, implement, and validate a quantum algorithm for Wang-Landau sampling, greatly expanding the range of quantum many body problems solvable by Monte Carlo simulation.

arXiv:2208.09543•Aug 19, 2022•0 citations

Wang-Landau method for calculating Rényi entropies in finite-temperature quantum Monte Carlo simulations

Stephen Inglis, Roger G. Melko

We implement a Wang-Landau sampling technique in quantum Monte Carlo (QMC) simulations for the purpose of calculating the Rényi entanglement entropies and associated mutual information. The algorithm converges an estimate for an analog to the density of states for stochastic series expansion QMC, allowing a direct calculation of Rényi entropies without explicit thermodynamic integration. We benchmark results for the mutual information on two-dimensional (2D) isotropic and anisotropic Heisenberg models, a 2D transverse field Ising model, and a three-dimensional Heisenberg model, confirming a critical scaling of the mutual information in cases with a finite-temperature transition. We discuss the benefits and limitations of broad sampling techniques compared to standard importance sampling methods.

arXiv:1207.5052•Physical Review E•Jan 22, 2013•49 citations
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.
The efficiency of statistical sampling in broad-histogram Monte Carlo simulations can be considerably improved by optimizing the simulated extended ensemble for fastest equilibration. Here we describe how a recently developed feedback algorithm can be generalized to find optimized sampling distributions for the simulation of quantum systems in the context of the stochastic series expansion (SSE) when defining an extended ensemble in the expansion order. If the chosen update method is efficient, such as non-local updates for systems undergoing a second-order phase transition, the optimized ensemble is characterized by a flat histogram in the expansion order if a variable-length formulation of the SSE is used. Whenever the update method suffers from slowdown, such as at a first-order phase transition, the feedback algorithm shifts weight towards the expansion orders in the transition region, resulting in a non-uniform histogram.
The concept of the partition function zeros is one of the most efficient methods for investigating the phase transitions and the critical phenomena in various physical systems. Estimating the partition function zeros requires information on the density of states Ω( E ) as a function of the energy E . Currently, the Wang-Landau Monte Carlo algorithm is one of the best methods for calculating Ω( E ). The partition function zeros in the complex temperature plane of the Ising model on an L × L square lattice ( L = 10 ~ 80) with a periodic boundary condition have been estimated by using the Wang-Landau Monte Carlo algorithm. The efficiency of the Wang-Landau Monte Carlo algorithm and the accuracies of the partition function zeros have been evaluated for three different, 5%, 10%, and 20%, flatness criteria for the histogram H ( E ).
Efficient and accurate algorithms for partition function, free energy, and thermal entropy calculations is of great significance in statistical physics and quantum many-body physics. Here we present an unbiased but low-technical-barrier algorithm within the quantum Monte Carlo framework, which has exceptionally high accuracy and no systemic error. Compared with the conventional specific heat integral method and Wang-Landau sampling algorithm, our method can obtain a much more accurate result of the subleading coefficient of the entropy consistent with theory. This method can be widely used in both classical and quantum Monte Carlo simulations and is easy to be parallelized on a computer.
It has been shown that the Metropolis algorithm can be implemented on quantum computers in a way that avoids the sign problem. However, flat histogram techniques are often preferred as they don't suffer from the same limitations that afflict Metropolis for problems of real-world interest and provide a host of other benefits. In particular, the Wang-Landau method is known for its efficiency and accuracy. In this work we design, implement, and validate a quantum algorithm for Wang-Landau sampling, greatly expanding the range of quantum many body problems solvable by Monte Carlo simulation.
We implement a Wang-Landau sampling technique in quantum Monte Carlo (QMC) simulations for the purpose of calculating the Rényi entanglement entropies and associated mutual information. The algorithm converges an estimate for an analog to the density of states for stochastic series expansion QMC, allowing a direct calculation of Rényi entropies without explicit thermodynamic integration. We benchmark results for the mutual information on two-dimensional (2D) isotropic and anisotropic Heisenberg models, a 2D transverse field Ising model, and a three-dimensional Heisenberg model, confirming a critical scaling of the mutual information in cases with a finite-temperature transition. We discuss the benefits and limitations of broad sampling techniques compared to standard importance sampling methods.