Papers
Topics
Authors
Recent
Search
2000 character limit reached

Efficient computations of continuous action densities of states for lattice models

Published 30 Oct 2021 in hep-lat, cond-mat.stat-mech, and cond-mat.str-el | (2111.00353v1)

Abstract: The Logarithmic Linear Relaxation (LLR) algorithm is an efficient method for computing densities of states for systems with a continuous spectrum. A key feature of this method is exponential error reduction, which allows us to evaluate the density of states of a system over hundreds of thousands of orders of magnitude with a fixed level of relative accuracy. As a consequence of exponential error reduction, the LLR method provides a robust alternative to traditional Monte Carlo calculations in cases in which states suppressed by the Boltzmann weight play nevertheless a relevant role, e.g., as transition regions between dominant configuration sets. After reviewing the algorithm, we will show an application in U(1) Lattice Gauge Theory that has enabled us to obtain the most accurate estimate of the critical coupling with modest computational resources, defeating exponential tunneling times between metastable vacua. As a further showcase, we will then present an application of the LLR method to the decorrelation of the topological charge in SU(3) Lattice Gauge Theory near the continuum limit. Finally, we will review in general applications of the LLR algorithm to systems affected by a strong sign problem and discuss the case of the Bose gas at finite chemical potential.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.