arXiv subjects

Ben Ruijl

Publications and source records attributed to Ben Ruijl.

15 recordsLinked to original sources

arXiv2025

NNLO QCD corrections to $\gamma \gamma \rightarrow Q\bar{Q}$ from Local Unitarity combined with Coulomb resummation and NLO EW effects

The Local Unitarity (LU) formalism provides a constructive, integrand-level realisation of the Kinoshita-Lee-Nauenberg (KLN) theorem, by combining loop and phase-space integrals appearing in scattering cross-sections in such a way that their final-state infrared singularities cancel before integration. Supplemented with localised ultraviolet renormalisation, it enables the direct Monte Carlo integration of cross sections at arbitrary perturbative order in four-dimensional spacetime. In this paper, we present its application to the next-to-next-to-leading order (NNLO) QCD total cross sections for heavy-quark pair production in direct photon fusion, involving the contribution from 138 distinct forward-scattering diagrams where external photons couple only to heavy quarks. By combining NNLO QCD with next-to-leading order (NLO) electroweak (EW) corrections and next-to-leading power (NLP) Coulomb resummation, we obtain state-of-the-art predictions for top-, bottom-, and charm-quark production in ultraperipheral hadron collisions and at $e^+ e^-$ colliders.

hep-ph↗

arXiv2022

Local Unitarity: cutting raised propagators and localising renormalisation

The Local Unitarity (LU) representation of differential cross-sections locally realises the cancellations of infrared singularities predicted by the Kinoshita-Lee-Nauenberg theorem. In this work we solve the two remaining challenges to enable practical higher-loop computations within the LU formalism. The first concerns the generalisation of the LU representation to graphs with raised propagators. The solution to this problem results in a generalisation of distributional Cutkosky rules. The second concerns the regularisation of ultraviolet and spurious soft singularities, solved using a fully automated and local renormalisation procedure based on Bogoliubov's R-operation. We detail an all-order construction for the hybrid $\overline{\text{MS}}$ and On-Shell scheme whose only analytic input is single-scale vacuum diagrams. Using this novel technology, we provide (semi-)inclusive results for two multi-leg processes at NLO, study limits of individual supergraphs up to N3LO and present the first physical NNLO cross-sections computed fully numerically in momentum-space, namely for the processes $\gamma^* \rightarrow j j$ and $\gamma^* \rightarrow t \bar{t}$.

hep-ph↗

arXiv2020

Numerical Loop-Tree Duality: contour deformation and subtraction

We introduce a novel construction of a contour deformation within the framework of Loop-Tree Duality for the numerical computation of loop integrals featuring threshold singularities in momentum space. The functional form of our contour deformation automatically satisfies all constraints without the need for fine-tuning. We demonstrate that our construction is systematic and efficient by applying it to more than 100 examples of finite scalar integrals featuring up to six loops. We also showcase a first step towards handling non-integrable singularities by applying our work to one-loop infrared divergent scalar integrals and to the one-loop amplitude for the ordered production of two and three photons. This requires the combination of our contour deformation with local counterterms that regulate soft, collinear and ultraviolet divergences. This work is an important step towards computing higher-order corrections to relevant scattering cross-sections in a fully numerical fashion.

hep-ph↗

arXiv2020

Local Unitarity: a representation of differential cross-sections that is locally free of infrared singularities at any order

We propose a novel representation of differential scattering cross-sections that locally realises the direct cancellation of infrared singularities exhibited by its so-called real-emission and virtual degrees of freedom. We take advantage of the Loop-Tree Duality representation of each individual forward-scattering diagram and we prove that the ensuing expression is locally free of infrared divergences, applies at any perturbative order and for any process without initial-state collinear singularities. Divergences for loop momenta with large magnitudes are regulated using local ultraviolet counterterms that reproduce the usual Lagrangian renormalisation procedure of quantum field theories. Our representation is especially suited for a numerical implementation and we demonstrate its practical potential by computing fully numerically and without any IR counterterm the next-to-leading order accurate differential cross-section for the process $e^+ e^- \rightarrow d \bar{d}$. We also show first results beyond next-to-leading order by computing interference terms part of the N4LO-accurate inclusive cross-section of a $1\rightarrow 2+X$ scalar scattering process.

hep-ph↗

arXiv2020

Manifestly Causal Loop-Tree Duality

Loop-Tree Duality (LTD) is a framework in which the energy components of all loop momenta of a Feynman integral are integrated out using residue theorem, resulting in a sum over tree-like structures. Originally, the LTD expression exhibits cancellations of non-causal thresholds between summands, also known as dual cancellations. As a result, the expression exhibits numerical instabilities in the vicinity of non-causal thresholds and for large loop momenta. In this work we derive a novel, generically applicable, Manifestly Causal LTD (cLTD) representation whose only thresholds are causal thresholds, i.e. it manifestly realizes dual cancellations. Consequently, this result also serves as a general proof for dual cancellations. We show that LTD, cLTD, and the expression stemming from Time Ordered Perturbation Theory (TOPT) are locally equivalent. TOPT and cLTD both feature only causal threshold singularities, however LTD features better scaling with the number of propagators. On top of the new theoretical perspectives offered by our representation, it has the useful property that the ultraviolet (UV) behaviour of the original 4D integrand is maintained for every summand. We show that the resulting LTD integrand expression is completely stable in the UV region which is key for practical applications of LTD to the computation of amplitudes and cross sections. We present explicit examples of the LTD expression for a variety of up to four-loop integrals and show that its increased computational complexity can be efficiently mitigated by optimising its numerical implementation. Finally, we provide computer code that automatically generates the LTD expression for an arbitrary topology.

hep-ph↗

arXiv2020

Two- and three-loop anomalous dimensions of Weinberg's dimension-six CP-odd gluonic operator

We apply a fully automated extension of the $R^*$-operation capable of calculating higher-loop anomalous dimensions of n-point Green's functions of arbitrary, possibly non-renormalisable, local Quantum Field Theories. We focus on the case of the CP-violating Weinberg operator of the Standard Model Effective Field Theory whose anomalous dimension is so far known only at one loop. We calculate the two-loop anomalous dimension in full QCD and the three-loop anomalous dimensions in the limit of pure Yang-Mills theory. We find sizeable two-loop and large three-loop corrections, due to the appearance of a new quartic group invariant. We discuss phenomenological implications for electric dipole moments and future applications of the method.

hep-ph↗

arXiv2019

Loop Tree Duality for multi-loop numerical integration

Loop Tree Duality (LTD) offers a promising avenue to numerically integrate multi-loop integrals directly in momentum space. It is well-established at one loop, but there have been only sparse numerical results at two loops. We provide a formal derivation for a novel multi-loop LTD expression and study its threshold singularity structure. We apply our findings numerically to a diverse set of up to four-loop finite topologies with kinematics for which no contour deformation is needed. We also lay down the ground work for constructing such a deformation. Our results serve as an important stepping stone towards a generalised and efficient numerical implementation of LTD, applicable to the computation of virtual corrections.

hep-ph↗

arXiv2018

The R*-operation for Feynman graphs with generic numerators

The R*-operation by Chetyrkin, Tkachov, and Smirnov is a generalisation of the BPHZ R-operation, which subtracts both ultraviolet and infrared divergences of euclidean Feynman graphs with non-exceptional external momenta. It can be used to compute the divergent parts of such Feynman graphs from products of simpler Feynman graphs of lower loops. In this paper we extend the R*-operation to Feynman graphs with arbitrary numerators, including tensors. We also provide a novel way of defining infrared counterterms which closely resembles the definition of its ultraviolet counterpart. We further express both infrared and ultraviolet counterterms in terms of scaleless vacuum graphs with a logarithmic degree of divergence. By exploiting symmetries, integrand and integral relations, which the counterterms of scaleless vacuum graphs satisfy, we can vastly reduce their number and complexity. A FORM implementation of this method was used to compute the five loop beta function in QCD for a general gauge group. To illustrate the procedure, we compute the poles in the dimensional regulator of all top-level propagator graphs at five loops in four dimensional phi^3 theory.

hep-th↗

arXiv2017

FORM version 4.2

We introduce FORM 4.2, a new minor release of the symbolic manipulation toolkit. We demonstrate several new features, such as a new pattern matching option, new output optimization, and automatic expansion of rational functions.

hep-ph↗

arXiv2016

FORM, Diagrams and Topologies

We discuss a number of FORM features that are essential in the automatic processing of very large numbers of diagrams as used in the Forcer program for 4-loop massless propagator diagrams. Most of these features are new.

hep-ph↗

arXiv2015

Locally Causal Dynamical Triangulations in Two Dimensions

We analyze the universal properties of a new two-dimensional quantum gravity model defined in terms of Locally Causal Dynamical Triangulations (LCDT). Measuring the Hausdorff and spectral dimensions of the dynamical geometrical ensemble, we find numerical evidence that the continuum limit of the model lies in a new universality class of two-dimensional quantum gravity theories, inequivalent to both Euclidean and Causal Dynamical Triangulations.

hep-th↗

arXiv2015

The diamond rule for multi-loop Feynman diagrams

An important aspect of improving perturbative predictions in high energy physics is efficiently reducing dimensionally regularised Feynman integrals through integration by parts (IBP) relations. The well-known triangle rule has been used to achieve simple reduction schemes. In this work we introduce an extensible, multi-loop version of the triangle rule, which we refer to as the diamond rule. Such a structure appears frequently in higher-loop calculations. We derive an explicit solution for the recursion, which prevents spurious poles in intermediate steps of the computations. Applications for massless propagator type diagrams at three, four, and five loops are discussed.

hep-ph↗

arXiv2014

Why Local Search Excels in Expression Simplification

Simplifying expressions is important to make numerical integration of large expressions from High Energy Physics tractable. To this end, Horner's method can be used. Finding suitable Horner schemes is assumed to be hard, due to the lack of local heuristics. Recently, MCTS was reported to be able to find near optimal schemes. However, several parameters had to be fine-tuned manually. In this work, we investigate the state space properties of Horner schemes and find that the domain is relatively flat and contains only a few local minima. As a result, the Horner space is appropriate to be explored by Stochastic Local Search (SLS), which has only two parameters: the number of iterations (computation time) and the neighborhood structure. We found a suitable neighborhood structure, leaving only the allowed computation time as a parameter. We performed a range of experiments. The results obtained by SLS are similar or better than those obtained by MCTS. Furthermore, we show that SLS obtains the good results at least 10 times faster. Using SLS, we can speed up numerical integration of many real-world large expressions by at least a factor of 24. For High Energy Physics this means that numerical integrations that took weeks can now be done in hours.

cs.AI↗

arXiv2014

HEPGAME and the Simplification of Expressions

Advances in high energy physics have created the need to increase computational capacity. Project HEPGAME was composed to address this challenge. One of the issues is that numerical integration of expressions of current interest have millions of terms and takes weeks to compute. We have investigated ways to simplify these expressions, using Horner schemes and common subexpression elimination. Our approach applies MCTS, a search procedure that has been successful in AI. We use it to find near-optimal Horner schemes. Although MCTS finds better solutions, this approach gives rise to two further challenges. (1) MCTS (with UCT) introduces a constant, $C_p$ that governs the balance between exploration and exploitation. This constant has to be tuned manually. (2) There should be more guided exploration at the bottom of the tree, since the current approach reduces the quality of the solution towards the end of the expression. We investigate NMCS (Nested Monte Carlo Search) to address both issues, but find that NMCS is computationally unfeasible for our problem. Then, we modify the MCTS formula by introducing a dynamic exploration-exploitation parameter $T$ that decreases linearly with the iteration number. Consequently, we provide a performance analysis. We observe that a variable $C_p$ solves our domain: it yields more exploration at the bottom and as a result the tuning problem has been simplified. The region in $C_p$ for which good values are found is increased by more than a tenfold. This result encourages us to continue our research to solve other prominent problems in High Energy Physics.

cs.AI↗

arXiv2013

Combining Simulated Annealing and Monte Carlo Tree Search for Expression Simplification

In many applications of computer algebra large expressions must be simplified to make repeated numerical evaluations tractable. Previous works presented heuristically guided improvements, e.g., for Horner schemes. The remaining expression is then further reduced by common subexpression elimination. A recent approach successfully applied a relatively new algorithm, Monte Carlo Tree Search (MCTS) with UCT as the selection criterion, to find better variable orderings. Yet, this approach is fit for further improvements since it is sensitive to the so-called exploration-exploitation constant $C_p$ and the number of tree updates $N$. In this paper we propose a new selection criterion called Simulated Annealing UCT (SA-UCT) that has a dynamic exploration-exploitation parameter, which decreases with the iteration number $i$ and thus reduces the importance of exploration over time. First, we provide an intuitive explanation in terms of the exploration-exploitation behavior of the algorithm. Then, we test our algorithm on three large expressions of different origins. We observe that SA-UCT widens the interval of good initial values $C_p$ where best results are achieved. The improvement is large (more than a tenfold) and facilitates the selection of an appropriate $C_p$.

cs.AI↗