Interlaced coarse-graining for the dynamic cluster approximation
P. Staar, M. Jiang, U.R. H\"ahner, T.C.S. Schulthess, and T.A. Maier

TL;DR
This paper introduces an interlaced coarse-graining method for the dynamical cluster approximation that improves convergence, reduces the fermionic sign problem, and enables larger cluster calculations to better understand long-range correlations.
Contribution
The paper presents a novel interlaced coarse-graining approach for DCA that enhances convergence, reduces the sign problem, and allows for larger cluster simulations in quantum many-body problems.
Findings
Interlaced coarse-graining yields more localized self-energy.
It results in smoother cluster size dependence and better convergence.
Reduces the fermionic sign problem, enabling larger cluster calculations.
Abstract
The dynamical cluster approximation (DCA) and its DCA extension use coarse-graining of the momentum space to reduce the complexity of quantum many-body problems, thereby mapping the bulk lattice to a cluster embedded in a dynamical mean-field host. Here, we introduce a new form of an interlaced coarse-graining and compare it with the traditional coarse-graining. While it gives a more localized self-energy for a given cluster size, we show that it leads to more controlled results with weaker cluster shape and smoother cluster size dependence, which converge to the results obtained from the standard coarse-graining with increasing cluster size. Most importantly, the new coarse-graining reduces the severity of the fermionic sign problem of the underlying quantum Monte Carlo cluster solver and thus allows for calculations on larger clusters. This enables the treatment of longer-ranged…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
