DAG Optimizations for Feynman Diagrams of High-Multiplicity Scattering Processes in Julia

The description of scattering processes in high-energy physics is usually done with Feynman Diagrams. The number of Feynman Diagrams that can be generated for a given process explodes factorially with the number of particles. We discuss a possible approach enabling the calculation of higher-multiplicity scattering processes. We propose representing the calculation for a process as a directed acyclic graph (DAG) of small computation tasks. Using Julia, we can optimize this graph using subgraph replacement strategies together with an optimization algorithm. Finally, efficient code targeting arbitrary heterogeneous HPC systems can be generated from the optimized DAG.