BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20261101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20251001T140000
DTEND;TZID=America/New_York:20251001T150000
DTSTAMP:20260407T192325
CREATED:20250128T214901Z
LAST-MODIFIED:20251002T140605Z
UID:10003710-1759327200-1759330800@cmsa.fas.harvard.edu
SUMMARY:Tropicalized quantum field theory
DESCRIPTION:New Technologies in Mathematics Seminar \nSpeaker: Michael Borinsky\, Perimeter Institute  \nTitle: Tropicalized quantum field theory \nAbstract: Quantum field theory (QFT) is one of the most accurate methods for making phenomenological predictions in physics\, but it has a significant drawback: obtaining concrete predictions from it is computationally very demanding. The standard perturbative approach expands an interacting QFT around a free QFT\, using Feynman diagrams. However\, the number of these diagrams grows superexponentially\, making the approach quickly infeasible. \nI will talk about arXiv:2508.14263\, which introduces an intermediate layer between free and interacting field theories: a tropicalized QFT. Often\, this tropicalized QFT can be solved exactly. The exact solution manifests as a non-linear recursion equation fulfilled by the expansion coefficients of the quantum effective action. Geometrically\, this recursion computes 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\, an algorithm can be constructed that samples points from the moduli space of graphs approximately proportional to their perturbative contribution. Via a standard Monte Carlo approach we can evaluate the original QFT using this algorithm. Remarkably\, this algorithm requires only polynomial time and memory\, suggesting that perturbative quantum field theory computations actually lie in the polynomial-time complexity class\, while all known algorithms for evaluating individual Feynman integrals are at least exponential in time and memory. The (potential) capabilities of this approach are remarkable: For instance\, we can compute perturbative expansions of massive scalar D=3 phi^3 and D=4 phi^4 quantum field theories up to loop orders between 20 and 50 using a basic proof-of-concept implementation. These perturbative orders are completely inaccessible using a naive approach.
URL:https://cmsa.fas.harvard.edu/event/newtech_10125/
LOCATION:Virtual
CATEGORIES:New Technologies in Mathematics Seminar
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-NTM-Seminar-10.1.2025.docx-1-scaled.png
END:VEVENT
END:VCALENDAR