QFT automation

Evaluation of Feynman diagrams in perturbative QFTs often consists of applying the same algebraic identities multiple times in order to simplify the resulting expressions. In principle, every such calculation can be done by pen and paper. In practice, many processes are just too complex (i.e. they involve hundreds of diagrams that result into thousands of terms) to be carried out by hand. This is why software tools that are designed to automatize QFT computations are indispensable in the modern particle physics.

Over the years people have developed multiple algorithms to carry out different steps of the Feynman diagram evaluation in the most effective way. This includes simplification of the Dirac and SU(N) algebra, loop integral reduction and the computation of the matrix element squared. Most of those are tailored to manifestly Lorentz-covariant theories like Standard Model or Supersymmetry. Unfortunately, only some of them are also applicable to field theories that are formulated in a non-covariant way (e.g. NRQCD, pNRQCD, many theories used in condensed matter physics). At T30f we contribute to the development of FeynCalc, a Mathematica package for automatic and semi-automatic algebraic computations in QFT. Our aim is to provide an interface to FeynCalc that would allow to automatize computations in non-relativistic field theories.
Written by V. Shtabovenko.

People

Vladyslav Shtabovenko

Some related publications

V. Shtabovenko et al.
New Developments in FeynCalc 9.0
Comput.Phys.Commun. 207 (2016) 432-444
arXiv:1601.01167 Inspire

V. Shtabovenko
FeynHelpers: Connecting FeynCalc to FIRE and Package-X
arXiv:1611.06793 Inspire