<p>We explain how to tropicalize scalar quantum field theory and show that tropicalized massive scalar quantum field theory is exactly solvable. This exact solution manifests as a non-linear recursion equation fulfilled by the expansion coefficients of the quantum effective action. Geometrically, this recursion computes specific volumes of moduli spaces of metric graphs and is thereby analogous to Mirzakhani’s volume recursions on the moduli space of curves. Building on this exact solution, we construct an algorithm that samples points from the moduli space of graphs approximately proportional to their perturbative contribution. Remarkably, this algorithm requires only polynomial time and memory, suggesting that perturbative quantum field theory computations lie in the polynomial-time complexity class, while all known algorithms for evaluating individual Feynman integrals are exponential in time and memory. To demonstrate the capabilities of the algorithm, we evaluate the primitive contribution to the <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\phi ^4\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mi>ϕ</mi> <mn>4</mn> </msup> </math></EquationSource> </InlineEquation> beta function at 50 loops with a proof-of-concept implementation.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Tropicalized Quantum Field Theory and Global Tropical Sampling

  • Michael Borinsky

摘要

We explain how to tropicalize scalar quantum field theory and show that tropicalized massive scalar quantum field theory is exactly solvable. This exact solution manifests as a non-linear recursion equation fulfilled by the expansion coefficients of the quantum effective action. Geometrically, this recursion computes specific volumes of moduli spaces of metric graphs and is thereby analogous to Mirzakhani’s volume recursions on the moduli space of curves. Building on this exact solution, we construct an algorithm that samples points from the moduli space of graphs approximately proportional to their perturbative contribution. Remarkably, this algorithm requires only polynomial time and memory, suggesting that perturbative quantum field theory computations lie in the polynomial-time complexity class, while all known algorithms for evaluating individual Feynman integrals are exponential in time and memory. To demonstrate the capabilities of the algorithm, we evaluate the primitive contribution to the \(\phi ^4\) ϕ 4 beta function at 50 loops with a proof-of-concept implementation.