Abstract

Analytic continuation of imaginary time or frequency data to the real axis is a crucial step in extracting dynamical properties from quantum Monte Carlo simulations. The average spectrum method provides an elegant solution by integrating over all non-negative spectra weighted by how well they fit the data. In a recent paper, we found that discretizing the functional integral as in Feynman's path-integrals, does not have a well-defined continuum limit. Instead, the limit depends on the discretization grid whose choice may strongly bias the results. In this paper, we demonstrate that sampling the grid points, instead of keeping them fixed, also changes the functional integral limit and rather helps to overcome the bias considerably. We provide an efficient algorithm for doing the sampling and show how the density of the grid points acts now as a default model with a significantly reduced biasing effect. The remaining bias depends mainly on the width of the grid density, so we go one step further and average also over densities of different widths. For a certain class of densities, including Gaussian and exponential ones, this width averaging can be done analytically, eliminating the need to specify this parameter without introducing any computational overhead.

Highlights

  • Quantum Monte Carlo (QMC) simulations have become an indispensable tool for studying quantum many-body systems

  • In ASM1, we showed that a naive discretization of the functional integral involved in the average spectrum method does not produce

  • Despite the apparent elegance of this functional integral formulation, we found in ASM1 that it is not a well-defined expression because the result depends on how the spectrum f (x) is discretized

Read more

Summary

INTRODUCTION

Quantum Monte Carlo (QMC) simulations have become an indispensable tool for studying quantum many-body systems They often compute Green’s or correlation functions on the imaginary-time axis or Matsubara frequencies, which need to be analytically continued to the real axis to extract dynamical information about the system of interest. When evaluating the data on the imaginary axis, oscillations and sharp features in the spectrum get smoothed and noise gets damped due to the integration This makes the inverse problem of reconstructing the details of the spectrum extremely challenging. The most commonly used approach is the maximum entropy method (MaxEnt), which is rooted in Bayesian inference It tries to find a spectrum by balancing the fit to the data and the entropy relative to some default model. Test cases show that this width-sampling method gives good results resolving the features of the spectrum without the need for fine-tuning the grid.

AVERAGE SPECTRUM METHOD
Formalism
RELEASING GRID POINTS
Sampling algorithm
Binning and averaging
DENSITY DEPENDENCE
AVERAGING WIDTH OF GRID DENSITY
GRID SIZE DEPENDENCE
Findings
SUMMARY AND DISCUSSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call