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

Rivista Del Nuovo Cimento

Fermionic loops in a many-body theory: Evaluation of an infinite class of diagrams

R. Cenni, F. Conte, A. Cornacchia, Paolo Saracco

Published Dec 1, 1992• 10 citations
Publisher
DOI
10.1007/bf02898727

Related papers

Fermionic many-body models

Joel Feldman, J Magnen, Vincent Rivasseau +1 more

CRM proceedings & lecture notes•Dec 19, 1994•8 citations

Study of the Perturbation Series for the Ground-State Energy of a Many-Fermion System

George Allen Baker Jr., J. L. Gammel, Bob Hill

In order to investigate the validity of the Brueckner and the simple sum of the ladder diagrams approximations to the energy of an infinite system of fermions, we have calculated as a function of density all the terms in the perturbation expansion through the fourth order in the strength of the potential. We have done this for a repulsive, square-well, two-body potential spin-\textonehalf{} fermions. We are able to construct rigorous upper and lower bounds from the coefficients for the value of the ladder approximation and find that the standard solution procedures give reasonably accurate results (within a few percent). We find that the error in the solution as obtained in practice to the equations of the Brueckner approximation is large compared to the size of its departure from the ladder approximation. We further find for low-to-moderate densities and for low-to-moderate potential strengths that the Brueckner approximation both as a sum of a certain class of diagrams and as computed in practice lies above the ladder approximation while the complete perturbation theory lies below it. This result arises from the neglect of the ring diagrams by the Brueckner approximation.

Physical Review•Nov 1, 1963•29 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•53 citations

Many-Body Theory of Correlated Fermion Systems

José M. Arias, María Isabel Gallardo, Manuel Lozano

•May 1, 1998•3 citations

Many-body topology in parity-preserving tensor networks

Maksimilian Usoltcev, Nguyen Hanh Dung, Carolin Wille +2 more

Planar parity-preserving tensor networks (ppTNs) admit a fermionic formulation in which the Gaussian, efficiently contractible limit is deformed by local interactions. We investigate how many-body methods can be used to analyze such contractions in a minimal two-parameter ppTN. Its contraction is simultaneously an interacting fermionic partition function, a loop gas, a deformed toric-code norm, and a quartic Ising model, allowing the same phase diagram to be approached with complementary tools. At its center lies a `topological island', characterized beyond the Gaussian limit by a boundary-twist $\mathbb Z_2$ indicator that reduces to Chern-number parity and admits a loop-winding interpretation under duality. Fermionic perturbation theory predicts the interacting phase boundaries, tensor-network numerics establish their critical behavior, and the loop and spin descriptions reveal a self-dual line with a $c=1$ four-state-Potts multicritical fixed point.

cond-mat.stat-mechCross-listedarXiv:2609.40004•Oct 1, 2026•0 citations

Comparison of many-body theories for correlated fermion systems

C.H. Harzer, H. Muether, Markus Stauf +1 more

Verhandlungen der Deutschen Physikalischen Gesellschaft•Jan 1, 1999•0 citations
In order to investigate the validity of the Brueckner and the simple sum of the ladder diagrams approximations to the energy of an infinite system of fermions, we have calculated as a function of density all the terms in the perturbation expansion through the fourth order in the strength of the potential. We have done this for a repulsive, square-well, two-body potential spin-\textonehalf{} fermions. We are able to construct rigorous upper and lower bounds from the coefficients for the value of the ladder approximation and find that the standard solution procedures give reasonably accurate results (within a few percent). We find that the error in the solution as obtained in practice to the equations of the Brueckner approximation is large compared to the size of its departure from the ladder approximation. We further find for low-to-moderate densities and for low-to-moderate potential strengths that the Brueckner approximation both as a sum of a certain class of diagrams and as computed in practice lies above the ladder approximation while the complete perturbation theory lies below it. This result arises from the neglect of the ring diagrams by the Brueckner approximation.
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.
Planar parity-preserving tensor networks (ppTNs) admit a fermionic formulation in which the Gaussian, efficiently contractible limit is deformed by local interactions. We investigate how many-body methods can be used to analyze such contractions in a minimal two-parameter ppTN. Its contraction is simultaneously an interacting fermionic partition function, a loop gas, a deformed toric-code norm, and a quartic Ising model, allowing the same phase diagram to be approached with complementary tools. At its center lies a `topological island', characterized beyond the Gaussian limit by a boundary-twist Z2\mathbb Z_2Z2​ indicator that reduces to Chern-number parity and admits a loop-winding interpretation under duality. Fermionic perturbation theory predicts the interacting phase boundaries, tensor-network numerics establish their critical behavior, and the loop and spin descriptions reveal a self-dual line with a c=1c=1c=1 four-state-Potts multicritical fixed point.