Propagator

Diagrammatic reasoning

Algorithm

Sparse approximation

Leverage (statistics)

Artificial intelligence

Programming language

Fortran

Mathematics

Mathematical physics

Computer science

Computational science

Python (programming language)

Theoretical computer science

SoftwareX

We introduce sparse-ir, a collection of libraries to efficiently handle imaginary-time propagators, a central object in finite-temperature quantum many-body calculations. We leverage two concepts: firstly, the intermediate representation (IR), an optimal compression of the propagator with robust a-priori error estimates, and secondly, sparse sampling, near-optimal grids in imaginary time and imaginary frequency from which the propagator can be reconstructed and on which diagrammatic equations can be solved. IR and sparse sampling are packaged into stand-alone, easy-to-use Python, Julia and Fortran libraries, which can readily be included into existing software. We also include an extensive set of sample codes showcasing the library for typical many-body and ab initio methods.

sparse-ir: Optimal compression and sparse sampling of many-body propagators