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:2309.12511 · SciPost Physics Codebases

MatsubaraFunctions.jl: An equilibrium Green's function library in the Julia programming language

Dominik Kiese, Anxiang Ge, Nepomuk Ritz, Jan von Delft, Nils Wentzell

Published Jan 11, 2024• 4 citations
arXivHTMLPDF

Abstract

The Matsubara Green’s function formalism stands as a powerful technique for computing the thermodynamic characteristics of interacting quantum many-particle systems at finite temperatures. In this manuscript, our focus centers on introducing MatsubaraFunctions.jl, a Julia library that implements data structures for generalized n-point Green’s functions on Matsubara frequency grids. The package’s architecture prioritizes user-friendliness without compromising the development of efficient solvers for quantum field theories in equilibrium. Following a comprehensive introduction of the fundamental types, we delve into a thorough examination of key facets of the interface. This encompasses avenues for accessing Green’s functions, techniques for extrapolation and interpolation, as well as the incorporation of symmetries and a variety of parallelization strategies. Examples of increasing complexity serve to demonstrate the practical utility of the library, supplemented by discussions on strategies for sidestepping impediments to optimal performance.

DOI
10.21468/scipostphyscodeb.24

Related papers

Codebase release 0.1 for MatsubaraFunctions.jl

Dominik Kiese, Anxiang Ge, Nepomuk Ritz +2 more

The Matsubara Green’s function formalism stands as a powerful technique for computing the thermodynamic characteristics of interacting quantum many-particle systems at finite temperatures. In this manuscript, our focus centers on introducing MatsubaraFunctions.jl, a Julia library that implements data structures for generalized n-point Green’s functions on Matsubara frequency grids. The package’s architecture prioritizes user-friendliness without compromising the development of efficient solvers for quantum field theories in equilibrium. Following a comprehensive introduction of the fundamental types, we delve into a thorough examination of key facets of the interface. This encompasses avenues for accessing Green’s functions, techniques for extrapolation and interpolation, as well as the incorporation of symmetries and a variety of parallelization strategies. Examples of increasing complexity serve to demonstrate the practical utility of the library, supplemented by discussions on strategies for sidestepping impediments to optimal performance.

SciPost Physics Codebases•Jan 11, 2024•2 citations

Efficient Temperature-Dependent Green’s Function Methods for Realistic Systems: Using Cubic Spline Interpolation to Approximate Matsubara Green’s Functions

Alexei A. Kananenka, Alicia Rae Welden, Lan Nguyen Tran +2 more

The popular, stable, robust, and computationally inexpensive cubic spline interpolation algorithm is adopted and used for finite temperature Green's function calculations of realistic systems. We demonstrate that with appropriate modifications the temperature dependence can be preserved while the Green's function grid size can be reduced by about 2 orders of magnitude by replacing the standard Matsubara frequency grid with a sparser grid and a set of interpolation coefficients. We benchmarked the accuracy of our algorithm as a function of a single parameter sensitive to the shape of the Green's function. Through numerous examples, we confirmed that our algorithm can be utilized in a systematically improvable, controlled, and black-box manner and highly accurate one- and two-body energies and one-particle density matrices can be obtained using only around 5% of the original grid points. Additionally, we established that to improve accuracy by an order of magnitude, the number of grid points needs to be doubled, whereas for the Matsubara frequency grid, an order of magnitude more grid points must be used. This suggests that realistic calculations with large basis sets that were previously out of reach because they required enormous grid sizes may now become feasible.

arXiv:1602.05898•Journal of Chemical Theory and Computation•Apr 6, 2016•48 citations

Quantum Physics: Illustration of Multidimensional Green Functions Using Julia Language

Lizeth Fernanda Silva Godoy, Jorge Milton Lara Sinaluisa, Cristian Luis Inca Balseca +3 more

In this article, the numerical level representation of imaginary time Green's functions based on a low rank decomposition of the discrete Lehmann spectral representation (DLR) using an effective spectral density has been presented with illustrative efficiency. The DLR basis consists of a collection of exponentials chosen by interpolation decomposition to ensure stable and efficient recovery of imaginary time Green functions or Matsubara frequency samples (Kaye et al., 2022). This implementation to fit behavior of a low-temperature spinless free fermionics-electron gas quantum system requires much fewer degrees of freedom for the standard discretizations. The basic functions of DLR are explicit; carefully chosen to ensure a stable and accurate approach, simplifying standard operations. Importantly, the function can be explicitly transformed to the Matsubara frequency domain or obtained directly by interpolation on a Matsubara frequency grid.

Journal of Namibian Studies History Politics Culture•May 21, 2023•0 citations

libdlr: Efficient imaginary time calculations using the discrete Lehmann representation

Jason Kaye, Kun Chen, Hugo U. R. Strand

We introduce libdlr, a library implementing the recently introduced discrete Lehmann representation (DLR) of imaginary time Green's functions. The DLR basis consists of a collection of exponentials chosen by the interpolative decomposition to ensure stable and efficient recovery of Green's functions from imaginary time or Matsubara frequency samples. The library provides subroutines to build the DLR basis and grids, and to carry out various standard operations. The simplicity of the DLR makes it straightforward to incorporate into existing codes as a replacement for less efficient representations of imaginary time Green's functions, and libdlr is intended to facilitate this process. libdlr is written in Fortran, provides a C header interface, and contains a Python module pydlr. We also introduce a stand-alone Julia implementation, Lehmann.jl. Program Title: libdlr CPC Library link to program files: https://doi.org/10.17632/56z594pzsj.1 Developer's repository link: https://github.com/jasonkaye/libdlr Licensing provisions: Apache-2.0 Programming language: Fortran, C, Python, Julia Nature of problem: Discretization and compression of functions (Green's functions and self-energies) with an imaginary time variable. Solution method: Explicit basis functions and discretization points obtained by low rank compression of the analytical continuation kernel.

arXiv:2110.06765•Computer Physics Communications•Jul 8, 2022•32 citations

QI.jl---a Julia package for numerical computation in quantum information theory

Piotr Gawron, Dariusz Kurzyk, Łukasz Pawela

Numerical investigations are an important research tool in quantum information theory. There already exists a wide range of computational tools implemented in various programming languages. However there is little effort in implementing this kind of tools in the Julia language. Julia is a modern numerical computation library with excellent support for vector and matrix algebra, extended type system that allows for implementation of elegant application interfaces and support for parallel and distributed computing. QI.jl is a new quantum information theory library implemented in Julia that provides functions for creating and analyzing quantum states, and for creating quantum operations in various representations. An additional feature of the library is a collection of functions for sampling random quantum states and operations such as unitary operations and generic quantum channels.

•Jun 29, 2018•0 citations

QuantumInformation.jl—A Julia package for numerical computation in quantum information theory

Piotr Gawron, Dariusz Kurzyk, Łukasz Pawela

Numerical investigations are an important research tool in quantum information theory. There already exists a wide range of computational tools for quantum information theory implemented in various programming languages. However, there is little effort in implementing this kind of tools in the Julia language. Julia is a modern programming language designed for numerical computation with excellent support for vector and matrix algebra, extended type system that allows for implementation of elegant application interfaces and support for parallel and distributed computing. QuantumInformation.jl is a new quantum information theory library implemented in Julia that provides functions for creating and analyzing quantum states, and for creating quantum operations in various representations. An additional feature of the library is a collection of functions for sampling random quantum states and operations such as unitary operations and generic quantum channels.

arXiv:1806.11464•PLoS ONE•Dec 26, 2018•20 citations
The Matsubara Green’s function formalism stands as a powerful technique for computing the thermodynamic characteristics of interacting quantum many-particle systems at finite temperatures. In this manuscript, our focus centers on introducing MatsubaraFunctions.jl, a Julia library that implements data structures for generalized n-point Green’s functions on Matsubara frequency grids. The package’s architecture prioritizes user-friendliness without compromising the development of efficient solvers for quantum field theories in equilibrium. Following a comprehensive introduction of the fundamental types, we delve into a thorough examination of key facets of the interface. This encompasses avenues for accessing Green’s functions, techniques for extrapolation and interpolation, as well as the incorporation of symmetries and a variety of parallelization strategies. Examples of increasing complexity serve to demonstrate the practical utility of the library, supplemented by discussions on strategies for sidestepping impediments to optimal performance.
The Matsubara Green’s function formalism stands as a powerful technique for computing the thermodynamic characteristics of interacting quantum many-particle systems at finite temperatures. In this manuscript, our focus centers on introducing MatsubaraFunctions.jl, a Julia library that implements data structures for generalized n-point Green’s functions on Matsubara frequency grids. The package’s architecture prioritizes user-friendliness without compromising the development of efficient solvers for quantum field theories in equilibrium. Following a comprehensive introduction of the fundamental types, we delve into a thorough examination of key facets of the interface. This encompasses avenues for accessing Green’s functions, techniques for extrapolation and interpolation, as well as the incorporation of symmetries and a variety of parallelization strategies. Examples of increasing complexity serve to demonstrate the practical utility of the library, supplemented by discussions on strategies for sidestepping impediments to optimal performance.
The popular, stable, robust, and computationally inexpensive cubic spline interpolation algorithm is adopted and used for finite temperature Green's function calculations of realistic systems. We demonstrate that with appropriate modifications the temperature dependence can be preserved while the Green's function grid size can be reduced by about 2 orders of magnitude by replacing the standard Matsubara frequency grid with a sparser grid and a set of interpolation coefficients. We benchmarked the accuracy of our algorithm as a function of a single parameter sensitive to the shape of the Green's function. Through numerous examples, we confirmed that our algorithm can be utilized in a systematically improvable, controlled, and black-box manner and highly accurate one- and two-body energies and one-particle density matrices can be obtained using only around 5% of the original grid points. Additionally, we established that to improve accuracy by an order of magnitude, the number of grid points needs to be doubled, whereas for the Matsubara frequency grid, an order of magnitude more grid points must be used. This suggests that realistic calculations with large basis sets that were previously out of reach because they required enormous grid sizes may now become feasible.
In this article, the numerical level representation of imaginary time Green's functions based on a low rank decomposition of the discrete Lehmann spectral representation (DLR) using an effective spectral density has been presented with illustrative efficiency. The DLR basis consists of a collection of exponentials chosen by interpolation decomposition to ensure stable and efficient recovery of imaginary time Green functions or Matsubara frequency samples (Kaye et al., 2022). This implementation to fit behavior of a low-temperature spinless free fermionics-electron gas quantum system requires much fewer degrees of freedom for the standard discretizations. The basic functions of DLR are explicit; carefully chosen to ensure a stable and accurate approach, simplifying standard operations. Importantly, the function can be explicitly transformed to the Matsubara frequency domain or obtained directly by interpolation on a Matsubara frequency grid.
We introduce libdlr, a library implementing the recently introduced discrete Lehmann representation (DLR) of imaginary time Green's functions. The DLR basis consists of a collection of exponentials chosen by the interpolative decomposition to ensure stable and efficient recovery of Green's functions from imaginary time or Matsubara frequency samples. The library provides subroutines to build the DLR basis and grids, and to carry out various standard operations. The simplicity of the DLR makes it straightforward to incorporate into existing codes as a replacement for less efficient representations of imaginary time Green's functions, and libdlr is intended to facilitate this process. libdlr is written in Fortran, provides a C header interface, and contains a Python module pydlr. We also introduce a stand-alone Julia implementation, Lehmann.jl. Program Title: libdlr CPC Library link to program files: https://doi.org/10.17632/56z594pzsj.1 Developer's repository link: https://github.com/jasonkaye/libdlr Licensing provisions: Apache-2.0 Programming language: Fortran, C, Python, Julia Nature of problem: Discretization and compression of functions (Green's functions and self-energies) with an imaginary time variable. Solution method: Explicit basis functions and discretization points obtained by low rank compression of the analytical continuation kernel.
Numerical investigations are an important research tool in quantum information theory. There already exists a wide range of computational tools implemented in various programming languages. However there is little effort in implementing this kind of tools in the Julia language. Julia is a modern numerical computation library with excellent support for vector and matrix algebra, extended type system that allows for implementation of elegant application interfaces and support for parallel and distributed computing. QI.jl is a new quantum information theory library implemented in Julia that provides functions for creating and analyzing quantum states, and for creating quantum operations in various representations. An additional feature of the library is a collection of functions for sampling random quantum states and operations such as unitary operations and generic quantum channels.
Numerical investigations are an important research tool in quantum information theory. There already exists a wide range of computational tools for quantum information theory implemented in various programming languages. However, there is little effort in implementing this kind of tools in the Julia language. Julia is a modern programming language designed for numerical computation with excellent support for vector and matrix algebra, extended type system that allows for implementation of elegant application interfaces and support for parallel and distributed computing. QuantumInformation.jl is a new quantum information theory library implemented in Julia that provides functions for creating and analyzing quantum states, and for creating quantum operations in various representations. An additional feature of the library is a collection of functions for sampling random quantum states and operations such as unitary operations and generic quantum channels.