Combinatorial summation of Feynman diagrams: Equation of state of the 2D SU(N) Hubbard model
arxiv(2023)
摘要
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.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要