Feynman Diagrams as Computational Graphs
arxiv(2024)
摘要
We propose a computational graph representation of high-order Feynman
diagrams in Quantum Field Theory (QFT), applicable to any combination of
spatial, temporal, momentum, and frequency domains. Utilizing the
Dyson-Schwinger and parquet equations, our approach effectively organizes these
diagrams into a fractal structure of tensor operations, significantly reducing
computational redundancy. This approach not only streamlines the evaluation of
complex diagrams but also facilitates an efficient implementation of the
field-theoretic renormalization scheme, crucial for enhancing perturbative QFT
calculations. Key to this advancement is the integration of Taylor-mode
automatic differentiation, a key technique employed in machine learning
packages to compute higher-order derivatives efficiently on computational
graphs. To operationalize these concepts, we develop a Feynman diagram compiler
that optimizes diagrams for various computational platforms, utilizing machine
learning frameworks. Demonstrating this methodology's effectiveness, we apply
it to the three-dimensional uniform electron gas problem, achieving
unprecedented accuracy in calculating the quasiparticle effective mass at metal
density. Our work demonstrates the synergy between QFT and machine learning,
establishing a new avenue for applying AI techniques to complex quantum
many-body problems.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要