Combinatorial summation of Feynman diagrams
Year: 2024
Type: article
Abstract: Feynman's diagrammatic series is a common language for a formally exact theoretical description of systems of infinitely-many interacting quantum particles, as well as a foundation for precision computational techniques. Here we introduce a universal framework for efficient summation of connected or skeleton Feynman diagrams for generic quantum many-body systems. It is based on an explicit combinatorial construction of the sum of the integrands by dynamic programming, at a computational cost that can be made only exponential in the diagram order on a classical computer and potentially polynomial on a quantum computer. We illustrate the technique by an unbiased diagrammatic Monte Carlo calculation of the equation of state of the 2D SU(N) Hubbard model in an experimentally relevant regime, which has remained challenging for state-of-the-art numerical methods.
Source: Nature Communications
Author: Evgeny Kozik
Institution: King's College London
Language: English
Topic: Quantum many-body systems
Subfield: Atomic and Molecular Physics, and Optics
Field: Physics and Astronomy
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $6,790
OpenAlex ID: W4402409241
