Efficient Color-Dressed Calculation of Virtual Corrections
Walter Giele, Zoltan Kunszt, Jan Winter
TL;DR
The paper addresses the challenge of including QCD color in NLO Monte Carlo calculations by extending color dressing to one-loop generalized unitarity. It develops a color-dressed LO recursion and extends it to color-dressed one-loop amplitudes, using partition-based unitarity cuts and residues that factorize into color-dressed tree amplitudes. It provides extensive numerical results for n-gluon scattering, demonstrating favorable exponential scaling and improved accuracy compared to color-ordered approaches, and analyzes Monte Carlo color-sampling convergence. The work suggests that color-dressed methods are particularly advantageous for high-multiplicity processes and can naturally accommodate quarks and electroweak particles, potentially enabling scalable, color-inclusive NLO event generation with parallelizable computation.
Abstract
With the advent of generalized unitarity and parametric integration techniques, the construction of a generic Next-to-Leading Order Monte Carlo becomes feasible. Such a generator will entail the treatment of QCD color in the amplitudes. We extend the concept of color dressing to one-loop amplitudes, resulting in the formulation of an explicit algorithmic solution for the calculation of arbitrary scattering processes at Next-to-Leading order. The resulting algorithm is of exponential complexity, that is the numerical evaluation time of the virtual corrections grows by a constant multiplicative factor as the number of external partons is increased. To study the properties of the method, we calculate the virtual corrections to $n$-gluon scattering.
