The Dynamical Cluster Approximation with Quantum Monte Carlo Cluster Solvers
Mark Jarrell, Alexandru Macridin, Karlis Mikelsons +4 more
We present a pedagogical discussions of the dynamical mean field (DMFA) and dynamical cluster (DCA) approximations and associated Monte Carlo and entropy‐based methods of Bayesian data analysis. The DMFA and DCA methods are developed as coarse‐graining approximations and the relationship between the cluster and lattice problems are detailed. The Hirsch‐Fye and continuous time Quantum Monte Carlo (QMC) algorithms are used to solve the cluster problem. The algorithms are discussed, together with methods for efficient measurements and the modifications required by the self‐consistency of the DMFA/DCA. Then, several principles of Bayesian data analysis are presented. When coupled with information theory, this analysis produces a precise and systematic way to analytically continue Matsubara‐time QMC results to real frequencies. We show how to use Bayesian inference to qualify the solution of the continuation and optimize the inputs. Besides developing the Bayesian formalism, we also present a detailed description of the data qualification, sketch an efficient algorithm to solve for the optimal spectra, give cautionary notes where appropriate, and present two detailed case studies to demonstrate the method.
AIP conference proceedings•Jan 1, 2008•5 citations