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:2007.01661 · Computer Physics Communications

ADG: Automated generation and evaluation of many-body diagrams II. Particle-number projected Bogoliubov many-body perturbation theory

P. Arthuis, A. Tichai, J. Ripoche, T. Duguet

Published Oct 19, 2020• 17 citations
arXivHTMLPDF
DOI
10.1016/j.cpc.2020.107677

Related papers

Ab initio Bogoliubov many-body perturbation theory: closed-form constraint on the average particle number

Pepijn Demol, T. Duguet, A. Tichai

arXiv:2407.16841•The European Physical Journal A•Jan 28, 2025•5 citations

Computer generation of Feynman diagrams for perturbation theory II. Program description

Heung Wong, Josef Paldus

Computer Physics Communications•Jul 1, 1973•45 citations

Bogoliubov many-body perturbation theory under constraint

P. Demol, Mikaël Frosini, A. Tichai +2 more

arXiv:2002.02724•Annals of Physics•Nov 19, 2020•48 citations

High-order resummation of Bogoliubov many-body perturbation theory

Pepijn Demol

•May 29, 2023•0 citations

ADG: Automated generation and evaluation of many-body diagrams I. Bogoliubov many-body perturbation theory

P. Arthuis, T. Duguet, A. Tichai +2 more

We describe the first version (v1.0.0) of the code ADG that automatically (1) generates all valid Bogoliubov many-body perturbation theory (BMBPT) diagrams and (2) evaluates their algebraic expression to be implemented for numerical applications . This is achieved at any perturbative order p for a Hamiltonian containing both two-body (four-legs) and three-body (six-legs) interactions (vertices). The automated generation of BMBPT diagrams of order p relies on elements of graph theory, i.e., it is achieved by producing all oriented adjacency matrices of size ( p + 1 ) × ( p + 1 ) satisfying topological Feynman’s rules. The automated evaluation of BMBPT diagrams of order p relies both on the application of algebraic Feynman’s rules and on the identification of a powerful diagrammatic rule providing the result of the remaining p -tuple time integral. The diagrammatic rule in question constitutes a novel finding allowing for the straight summation of large classes of time-ordered diagrams at play in the time-independent formulation of BMBPT. Correspondingly, the traditional resolvent rule employed to compute time-ordered diagrams happens to be a particular case of the general rule presently identified. The code ADG is written in Python2.7 and uses the graph manipulation package NetworkX . The code is also able to generate and evaluate Hartree–Fock-MBPT (HF-MBPT) diagrams and is made flexible enough to be expanded throughout the years to tackle the diagrammatics used in various many-body formalisms that already exist or are yet to be formulated. Program summary Program Title: ADG Program Files doi: http://dx.doi.org/10.17632/6h4xrydwfb.1 Licensing provisions: GPLv3 Programming language: Python2.7 Nature of problem: As formal and numerical developments in many-body-perturbation-theory-based ab initio methods make higher orders reachable, producing and evaluating all the diagrams become rapidly undoable on a handmade basis as both their number and complexity grow quickly, making it prone to mistakes and oversights. Solution method : BMBPT diagrams are encoded as square matrices known as oriented adjacency matrices in graph theory, and then turned into graph objects using the NetworkX package. Checks on the diagrams and evaluation of their time-integrated expression are then done on a purely diagrammatic basis. HF-MBPT diagrams are produced and evaluated as well using the same principle.

arXiv:1809.01187•Computer Physics Communications•Dec 10, 2018•55 citations

ADG: automated generation and evaluation of many-body diagrams

A. Tichai, P. Arthuis, H. Hergert +1 more

Abstract The goal of the present paper is twofold. First, a novel expansion many-body method applicable to superfluid open-shell nuclei, the so-called Bogoliubov in-medium similarity renormalization group (BIMSRG) theory, is formulated. This generalization of standard single-reference IMSRG theory for closed-shell systems parallels the recent extensions of coupled cluster, self-consistent Green’s function or many-body perturbation theory. Within the realm of IMSRG theories, BIMSRG provides an interesting alternative to the already existing multi-reference IMSRG (MR-IMSRG) method applicable to open-shell nuclei. The algebraic equations for low-order approximations, i.e., BIMSRG(1) and BIMSRG(2), can be derived manually without much difficulty. However, such a methodology becomes already impractical and error prone for the derivation of the BIMSRG(3) equations, which are eventually needed to reach high accuracy. Based on a diagrammatic formulation of BIMSRG theory, the second objective of the present paper is thus to describe the third version (v3.0) of the code that automatically (1) generates all valid BIMSRG(n) diagrams and (2) evaluates their algebraic expressions in a matter of seconds. This is achieved in such a way that equations can easily be retrieved for both the flow equation and the Magnus expansion formulations of BIMSRG. Expanding on this work, the first future objective is to numerically implement BIMSRG(2) (eventually BIMSRG(3)) equations and perform ab initio calculations of mid-mass open-shell nuclei.

arXiv:2102.10889•The European Physical Journal A•Jan 1, 2022•21 citations
We describe the first version (v1.0.0) of the code ADG that automatically (1) generates all valid Bogoliubov many-body perturbation theory (BMBPT) diagrams and (2) evaluates their algebraic expression to be implemented for numerical applications . This is achieved at any perturbative order p for a Hamiltonian containing both two-body (four-legs) and three-body (six-legs) interactions (vertices). The automated generation of BMBPT diagrams of order p relies on elements of graph theory, i.e., it is achieved by producing all oriented adjacency matrices of size ( p + 1 ) × ( p + 1 ) satisfying topological Feynman’s rules. The automated evaluation of BMBPT diagrams of order p relies both on the application of algebraic Feynman’s rules and on the identification of a powerful diagrammatic rule providing the result of the remaining p -tuple time integral. The diagrammatic rule in question constitutes a novel finding allowing for the straight summation of large classes of time-ordered diagrams at play in the time-independent formulation of BMBPT. Correspondingly, the traditional resolvent rule employed to compute time-ordered diagrams happens to be a particular case of the general rule presently identified. The code ADG is written in Python2.7 and uses the graph manipulation package NetworkX . The code is also able to generate and evaluate Hartree–Fock-MBPT (HF-MBPT) diagrams and is made flexible enough to be expanded throughout the years to tackle the diagrammatics used in various many-body formalisms that already exist or are yet to be formulated. Program summary Program Title: ADG Program Files doi: http://dx.doi.org/10.17632/6h4xrydwfb.1 Licensing provisions: GPLv3 Programming language: Python2.7 Nature of problem: As formal and numerical developments in many-body-perturbation-theory-based ab initio methods make higher orders reachable, producing and evaluating all the diagrams become rapidly undoable on a handmade basis as both their number and complexity grow quickly, making it prone to mistakes and oversights. Solution method : BMBPT diagrams are encoded as square matrices known as oriented adjacency matrices in graph theory, and then turned into graph objects using the NetworkX package. Checks on the diagrams and evaluation of their time-integrated expression are then done on a purely diagrammatic basis. HF-MBPT diagrams are produced and evaluated as well using the same principle.
Abstract The goal of the present paper is twofold. First, a novel expansion many-body method applicable to superfluid open-shell nuclei, the so-called Bogoliubov in-medium similarity renormalization group (BIMSRG) theory, is formulated. This generalization of standard single-reference IMSRG theory for closed-shell systems parallels the recent extensions of coupled cluster, self-consistent Green’s function or many-body perturbation theory. Within the realm of IMSRG theories, BIMSRG provides an interesting alternative to the already existing multi-reference IMSRG (MR-IMSRG) method applicable to open-shell nuclei. The algebraic equations for low-order approximations, i.e., BIMSRG(1) and BIMSRG(2), can be derived manually without much difficulty. However, such a methodology becomes already impractical and error prone for the derivation of the BIMSRG(3) equations, which are eventually needed to reach high accuracy. Based on a diagrammatic formulation of BIMSRG theory, the second objective of the present paper is thus to describe the third version (v3.0) of the code that automatically (1) generates all valid BIMSRG(n) diagrams and (2) evaluates their algebraic expressions in a matter of seconds. This is achieved in such a way that equations can easily be retrieved for both the flow equation and the Magnus expansion formulations of BIMSRG. Expanding on this work, the first future objective is to numerically implement BIMSRG(2) (eventually BIMSRG(3)) equations and perform ab initio calculations of mid-mass open-shell nuclei.