Related papers: The density of states from first principles
The density of states is calculated for a SU(2) and a compact U(1) lattice gauge theory using a modified version of the Wang-Landau algorithm. We find that the density of states of the SU(2) gauge theory can be reliably calculated over a…
An algorithm to calculate the density of states, based on the well-known Wang-Landau method, is introduced. Independent random walks are performed in different restricted ranges of energy, and the resultant density of states is modified by…
In Wang-Landau type algorithms, Monte-Carlo updates are performed with respect to the density of states, which is iteratively refined during simulations. The partition function and thermodynamic observables are then obtained by standard…
We present an efficient Monte Carlo algorithm for determining the density of states which is based on the statistics of transition probabilities between states. By measuring the infinite temperature transition probabilities--that is, the…
Using a recently introduced tensor network method, we study the density of states of the lattice Schwinger model, a standard testbench for lattice gauge theory numerical techniques, but also the object of recent experimental quantum…
We discuss a new strategy for treating the complex action problem of lattice field theories with a $\theta$-term based on density of states (DoS) methods. The key ingredient is to use open boundary conditions where the topological charge is…
We present high-accuracy calculations of the density of states using multicanonical methods for lattice gauge theory with a compact gauge group U(1) on 4^4, 6^4 and 8^4 lattices. We show that the results are consistent with weak and strong…
We present ongoing investigations of the first-order confinement transition of a composite dark matter model, to predict the resulting spectrum of gravitational waves. To avoid long autocorrelations at the first-order transition, we employ…
Recently, a novel algorithm for computing the density of states in statistical systems and quantum field theories has been proposed. The same method can be applied to theories at finite density affected by the notorious sign problem,…
We present a graphical approach to understanding the degeneracy, density of states, and cumulative state number for some simple quantum systems. By taking advantage of basic computing operations we define a straightforward procedure for…
We implement the Wang-Landau algorithm in the context of SU(N) lattice gauge theories. We study the quenched, reduced version of the lattice theory and calculate its density of states for N=20,30,40,50. We introduce a variant of the…
We discuss a new density of states (DoS) approach to solve the complex action problem that is caused by topological terms. The key ingredient is to use open boundary conditions for (at least) one of the directions, such that the…
It is shown that the algorithm introduced in [1] and conceived to deal with continuous degrees of freedom models is well suited to compute the density of states in models with a discrete energy spectrum too. The q=10 D=2 Potts model is…
We provide a brief overview of approaches for calculating the density of states of quantum systems and random matrix Hamiltonians using the tools of free probability theory. For a given Hamiltonian of a quantum system or a generic random…
Using Wang-landau algorithm combined with analytic method, the density of states of two dimensional XY model on square lattices of sizes $16\times16$, $24\times24$ and $32\times32$ is accurately calculated. Thermodynamic quantities, such as…
In this work we develop an implementation of the Wang--Landau algorithm [Phys. Rev. Lett. \textbf{86}, 2050-2053 (2001)]. This algorithm allows us to find the density of states (DOS), a function that, for a given system, describes the…
We review and extend, in a self-contained way, the mathematical foundations of numerical simulation methods that are based on the use of random states. The power and versatility of this simulation technology is illustrated by calculations…
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…
Efficient characterization of highly entangled multi-particle systems is an outstanding challenge in quantum science. Recent developments have shown that a modest number of randomized measurements suffices to learn many properties of a…
Recently, a new and efficient algorithm (the LLR method) has been proposed for computing densities of states in statistical systems and gauge theories. In this talk, we explore whether this novel density of states method can be applied to…