Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1908.07575 · Physical review. B./Physical review. B

Sparse sampling approach to efficient ab initio calculations at finite temperature

Jia Li, Markus Wallerberger, Naoya Chikano, Chia-Nan Yeh, Emanuel Gull, Hiroshi Shinaoka

Published Jan 27, 2020• 106 citations
arXivHTMLPDF

Abstract

Efficient ab initio calculations of correlated materials at finite temperatures require compact representations of the Green's functions both in imaginary time and in Matsubara frequency. In this paper, we introduce a general procedure which generates sparse sampling points in time and frequency from compact orthogonal basis representations, such as Chebyshev polynomials and intermediate representation basis functions. These sampling points accurately resolve the information contained in the Green's function, and efficient transforms between different representations are formulated with minimal loss of information. As a demonstration, we apply the sparse sampling scheme to diagrammatic $GW$ and second-order Green's function theory calculations of a hydrogen chain of noble gas atoms and of a silicon crystal.

DOI
10.1103/physrevb.101.035144

Related papers

Efficient ab initio many-body calculations based on sparse modeling of Matsubara Green's function

Hiroshi Shinaoka, Naoya Chikano, Emanuel Gull +6 more

This lecture note reviews recently proposed sparse-modeling approaches for efficient ab initio many-body calculations based on the data compression of Green's functions. The sparse-modeling techniques are based on a compact orthogonal basis, an intermediate representation (IR) basis, for imaginary-time and Matsubara Green's functions. A sparse sampling method based on the IR basis enables solving diagrammatic equations efficiently. We describe the basic properties of the IR basis, the sparse sampling method and its applications to ab initio calculations based on the GW approximation and the Migdal--Eliashberg theory. We also describe a numerical library for the IR basis and the sparse sampling method, sparse-ir, and provide its sample codes. This lecture note follows the Japanese review article [H. Shinaoka et al., Solid State Physics 56(6), 301 (2021)].

arXiv:2106.12685•SciPost Physics Lecture Notes•Sep 22, 2022•30 citations

Sparse sampling and tensor network representation of two-particle Green's functions

Hiroshi Shinaoka, Dominique Geffroy, Markus Wallerberger +4 more

Many-body calculations at the two-particle level require a compact representation of two-particle Green’s functions. In this paper, we introduce a sparse sampling scheme in the Matsubara frequency domain as well as a tensor network representation for two-particle Green’s functions. The sparse sampling is based on the intermediate representation basis and allows an accurate extraction of the generalized susceptibility from a reduced set of Matsubara frequencies. The tensor network representation provides a system independent way to compress the information carried by two-particle Green’s functions. We demonstrate efficiency of the present scheme for calculations of static and dynamic susceptibilities in single- and two-band Hubbard models in the framework of dynamical mean-field theory.

arXiv:1909.07519•SciPost Physics•Jan 28, 2020•33 citations

Efficient Temperature-Dependent Green’s Functions Methods for Realistic Systems: Compact Grids for Orthogonal Polynomial Transforms

Alexei A. Kananenka, Jordan J. Phillips, Dominika Zgid

The Matsubara Green's function that is used to describe temperature-dependent behavior is expressed on a numerical grid. While such a grid usually has a couple of hundred points for low-energy model systems, for realistic systems with large basis sets the size of an accurate grid can be tens of thousands of points, constituting a severe computational and memory bottleneck. In this paper, we determine efficient imaginary time grids for the temperature-dependent Matsubara Green's function formalism that can be used for calculations on realistic systems. We show that, because of the use of an orthogonal polynomial transform, we can restrict the imaginary time grid to a few hundred points and reach micro-Hartree accuracy in the electronic energy evaluation. Moreover, we show that only a limited number of orthogonal polynomial expansion coefficients are necessary to preserve accuracy when working with a dual representation of the Green's function or self-energy and transforming between the imaginary time and frequency domain.

arXiv:1509.04262•Journal of Chemical Theory and Computation•Jan 6, 2016•49 citations

Spectral properties from Matsubara Green's function approach: Application to molecules

Michael Schüler, Y. Pavlyukh

We present results for many-body perturbation theory for the one-body Green's function at finite temperatures using the Matsubara formalism. Our method relies on the accurate representation of the single-particle states in standard Gaussian basis sets, allowing to efficiently compute, among other observables, quasiparticle energies and Dyson orbitals of atoms and molecules. In particular, we challenge the second-order treatment of the Coulomb interaction by benchmarking its accuracy for a well-established test set of small molecules, which includes also systems where the usual Hartree-Fock treatment encounters difficulties. We discuss different schemes how to extract quasiparticle properties and assess their range of applicability. With an accurate solution and compact representation, our method is an ideal starting point to study electron dynamics in time-resolved experiments by the propagation of the Kadanoff-Baym equations.

arXiv:1710.08660•Physical review. B./Physical review. B•Mar 30, 2018•26 citations

Low-rank Green's function representations applied to dynamical mean-field theory

Nan Sheng, Alexander Hampel, Sophie Beck +4 more

Several recent works have introduced highly compact representations of single-particle Green's functions in the imaginary time and Matsubara frequency domains, as well as efficient interpolation grids used to recover the representations. In particular, the intermediate representation with sparse sampling and the discrete Lehmann representation (DLR) make use of low rank compression techniques to obtain optimal approximations with controllable accuracy. We consider the use of the DLR in dynamical mean-field theory (DMFT) calculations, and in particular show that the standard full Matsubara frequency grid can be replaced by the compact grid of DLR Matsubara frequency nodes. We test the performance of the method for a DMFT calculation of ${\mathrm{Sr}}_{2}{\mathrm{RuO}}_{4}$ at temperature $50\phantom{\rule{0.16em}{0ex}}\mathrm{K}$ using a continuous-time quantum Monte Carlo impurity solver, and demonstrate that Matsubara frequency quantities can be represented on a grid of only 36 nodes with no reduction in accuracy, or increase in the number of self-consistent iterations, despite the presence of significant Monte Carlo noise.

arXiv:2301.07764•Physical review. B./Physical review. B•Jun 13, 2023•8 citations

Discrete Lehmann representation of imaginary time Green's functions

Jason Kaye, Kun Chen, Olivier Parcollet

We present an efficient basis for imaginary time Green's functions based on a low-rank decomposition of the spectral Lehmann representation. The basis functions are simply a set of well-chosen exponentials, so the corresponding expansion may be thought of as a discrete form of the Lehmann representation using an effective spectral density which is a sum of $\ensuremath{\delta}$ functions. The basis is determined only by an upper bound on the product $\ensuremath{\beta}{\ensuremath{\omega}}_{max}$, with $\ensuremath{\beta}$ the inverse temperature and ${\ensuremath{\omega}}_{max}$ an energy cutoff, and a user-defined error tolerance $\ensuremath{\epsilon}$. The number $r$ of basis functions scales as $O(log(\ensuremath{\beta}{\ensuremath{\omega}}_{max})log(1/\ensuremath{\epsilon}))$. The discrete Lehmann representation of a particular imaginary time Green's function can be recovered by interpolation at a set of $r$ imaginary time nodes. Both the basis functions and the interpolation nodes can be obtained rapidly using standard numerical linear algebra routines. Due to the simple form of the basis, the discrete Lehmann representation of a Green's function can be explicitly transformed to the Matsubara frequency domain, or obtained directly by interpolation on a Matsubara frequency grid. We benchmark the efficiency of the representation on simple cases, and with a high-precision solution of the Sachdev-Ye-Kitaev equation at low temperature. We compare our approach with the related intermediate representation method, and introduce an improved algorithm to build the intermediate representation basis and a corresponding sampling grid.

arXiv:2107.13094•Physical review. B./Physical review. B•Jun 13, 2022•61 citations
Efficient ab initio calculations of correlated materials at finite temperatures require compact representations of the Green's functions both in imaginary time and in Matsubara frequency. In this paper, we introduce a general procedure which generates sparse sampling points in time and frequency from compact orthogonal basis representations, such as Chebyshev polynomials and intermediate representation basis functions. These sampling points accurately resolve the information contained in the Green's function, and efficient transforms between different representations are formulated with minimal loss of information. As a demonstration, we apply the sparse sampling scheme to diagrammatic GWGWGW and second-order Green's function theory calculations of a hydrogen chain of noble gas atoms and of a silicon crystal.
This lecture note reviews recently proposed sparse-modeling approaches for efficient ab initio many-body calculations based on the data compression of Green's functions. The sparse-modeling techniques are based on a compact orthogonal basis, an intermediate representation (IR) basis, for imaginary-time and Matsubara Green's functions. A sparse sampling method based on the IR basis enables solving diagrammatic equations efficiently. We describe the basic properties of the IR basis, the sparse sampling method and its applications to ab initio calculations based on the GW approximation and the Migdal--Eliashberg theory. We also describe a numerical library for the IR basis and the sparse sampling method, sparse-ir, and provide its sample codes. This lecture note follows the Japanese review article [H. Shinaoka et al., Solid State Physics 56(6), 301 (2021)].
Many-body calculations at the two-particle level require a compact representation of two-particle Green’s functions. In this paper, we introduce a sparse sampling scheme in the Matsubara frequency domain as well as a tensor network representation for two-particle Green’s functions. The sparse sampling is based on the intermediate representation basis and allows an accurate extraction of the generalized susceptibility from a reduced set of Matsubara frequencies. The tensor network representation provides a system independent way to compress the information carried by two-particle Green’s functions. We demonstrate efficiency of the present scheme for calculations of static and dynamic susceptibilities in single- and two-band Hubbard models in the framework of dynamical mean-field theory.
The Matsubara Green's function that is used to describe temperature-dependent behavior is expressed on a numerical grid. While such a grid usually has a couple of hundred points for low-energy model systems, for realistic systems with large basis sets the size of an accurate grid can be tens of thousands of points, constituting a severe computational and memory bottleneck. In this paper, we determine efficient imaginary time grids for the temperature-dependent Matsubara Green's function formalism that can be used for calculations on realistic systems. We show that, because of the use of an orthogonal polynomial transform, we can restrict the imaginary time grid to a few hundred points and reach micro-Hartree accuracy in the electronic energy evaluation. Moreover, we show that only a limited number of orthogonal polynomial expansion coefficients are necessary to preserve accuracy when working with a dual representation of the Green's function or self-energy and transforming between the imaginary time and frequency domain.
We present results for many-body perturbation theory for the one-body Green's function at finite temperatures using the Matsubara formalism. Our method relies on the accurate representation of the single-particle states in standard Gaussian basis sets, allowing to efficiently compute, among other observables, quasiparticle energies and Dyson orbitals of atoms and molecules. In particular, we challenge the second-order treatment of the Coulomb interaction by benchmarking its accuracy for a well-established test set of small molecules, which includes also systems where the usual Hartree-Fock treatment encounters difficulties. We discuss different schemes how to extract quasiparticle properties and assess their range of applicability. With an accurate solution and compact representation, our method is an ideal starting point to study electron dynamics in time-resolved experiments by the propagation of the Kadanoff-Baym equations.
Several recent works have introduced highly compact representations of single-particle Green's functions in the imaginary time and Matsubara frequency domains, as well as efficient interpolation grids used to recover the representations. In particular, the intermediate representation with sparse sampling and the discrete Lehmann representation (DLR) make use of low rank compression techniques to obtain optimal approximations with controllable accuracy. We consider the use of the DLR in dynamical mean-field theory (DMFT) calculations, and in particular show that the standard full Matsubara frequency grid can be replaced by the compact grid of DLR Matsubara frequency nodes. We test the performance of the method for a DMFT calculation of Sr2RuO4{\mathrm{Sr}}_{2}{\mathrm{RuO}}_{4}Sr2​RuO4​ at temperature 50K50\phantom{\rule{0.16em}{0ex}}\mathrm{K}50K using a continuous-time quantum Monte Carlo impurity solver, and demonstrate that Matsubara frequency quantities can be represented on a grid of only 36 nodes with no reduction in accuracy, or increase in the number of self-consistent iterations, despite the presence of significant Monte Carlo noise.
We present an efficient basis for imaginary time Green's functions based on a low-rank decomposition of the spectral Lehmann representation. The basis functions are simply a set of well-chosen exponentials, so the corresponding expansion may be thought of as a discrete form of the Lehmann representation using an effective spectral density which is a sum of $\ensuremath{\delta}$ functions. The basis is determined only by an upper bound on the product $\ensuremath{\beta}{\ensuremath{\omega}}_{max}$, with $\ensuremath{\beta}$ the inverse temperature and ${\ensuremath{\omega}}_{max}$ an energy cutoff, and a user-defined error tolerance $\ensuremath{\epsilon}$. The number rrr of basis functions scales as $O(log(\ensuremath{\beta}{\ensuremath{\omega}}_{max})log(1/\ensuremath{\epsilon}))$. The discrete Lehmann representation of a particular imaginary time Green's function can be recovered by interpolation at a set of rrr imaginary time nodes. Both the basis functions and the interpolation nodes can be obtained rapidly using standard numerical linear algebra routines. Due to the simple form of the basis, the discrete Lehmann representation of a Green's function can be explicitly transformed to the Matsubara frequency domain, or obtained directly by interpolation on a Matsubara frequency grid. We benchmark the efficiency of the representation on simple cases, and with a high-precision solution of the Sachdev-Ye-Kitaev equation at low temperature. We compare our approach with the related intermediate representation method, and introduce an improved algorithm to build the intermediate representation basis and a corresponding sampling grid.