|
|
Sborlini, G. F. R., de Florian, D., & Rodrigo, G. (2015). Polarized triple-collinear splitting functions at NLO for processes with photons. J. High Energy Phys., 03(3), 021–30pp.
Abstract: We compute the polarized splitting functions in the triple collinear limit at next-to-leading order accuracy (NLO) in the strong coupling alpha(S), for the splitting processes gamma -> qq gamma, gamma -> qqg and g -> qq gamma. The divergent structure of each splitting function was compared to the predicted behaviour according to Catani's formula. The results obtained in this paper are compatible with the unpolarized splitting functions computed in a previous article. Explicit results for NLO corrections are presented in the context of conventional dimensional regularization (CDR).
|
|
|
|
Driencourt-Mangin, F., Rodrigo, G., & Sborlini, G. F. R. (2018). Universal dual amplitudes and asymptotic expansions for gg -> H and H -> gamma gamma in four dimensions. Eur. Phys. J. C, 78(3), 231–7pp.
Abstract: Though the one-loop amplitudes of the Higgs boson to massless gauge bosons are finite because there is no direct interaction at tree level in the Standard Model, a well-defined regularization scheme is still required for their correct evaluation. We reanalyze these amplitudes in the framework of the four-dimensional unsubtraction and the loop-tree duality (EDU/LTD), and show how a local renormalization solves potential regularization ambiguities. The Higgs boson interactions are also used to illustrate new additional advantages of this formalism. We show that LTD naturally leads to very compact integrand expressions in four space-time dimensions of the one-loop amplitude with virtual electroweak gauge bosons. They exhibit the same functional form as the amplitudes with top quarks and charged scalars, thus opening further possibilities for simplifications in higher-order computations. Another outstanding application is the straightforward implementation of asymptotic expansions by using dual amplitudes. One of the main benefits of the LTD representation is that it is supported in a Euclidean space. This characteristic feature naturally leads to simpler asymptotic expansions.
|
|
|
|
Torres Bobadilla, W. J. et al, Driencourt-Mangin, F., & Rodrigo, G. (2021). May the four be with you: novel IR-subtraction methods to tackle NNLO calculations. Eur. Phys. J. C, 81(3), 250–61pp.
Abstract: In this manuscript, we report the outcome of the topical workshop: paving the way to alternative NNLO strategies (https://indico.ific.uv.es/e/WorkStop-ThinkStart_3.0), by presenting a discussion about different frameworks to perform precise higher-order computations for high-energy physics. These approaches implement novel strategies to deal with infrared and ultraviolet singularities in quantum field theories. A special emphasis is devoted to the local cancellation of these singularities, which can enhance the efficiency of computations and lead to discover novel mathematical properties in quantum field theories.
|
|
|
|
Martinez de Lejarza, J. J., Cieri, L., & Rodrigo, G. (2022). Quantum clustering and jet reconstruction at the LHC. Phys. Rev. D, 106(3), 036021–16pp.
Abstract: Clustering is one of the most frequent problems in many domains, in particular, in particle physics where jet reconstruction is central in experimental analyses. Jet clustering at the CERN's Large Hadron Collider (LHC) is computationally expensive and the difficulty of this task will increase with the upcoming High-Luminosity LHC (HL-LHC). In this paper, we study the case in which quantum computing algorithms might improve jet clustering by considering two novel quantum algorithms which may speed up the classical jet clustering algorithms. The first one is a quantum subroutine to compute a Minkowski-based distance between two data points, whereas the second one consists of a quantum circuit to track the maximum into a list of unsorted data. The latter algorithm could be of value beyond particle physics, for instance in statistics. When one or both of these algorithms are implemented into the classical versions of well-known clustering algorithms (K-means, affinity propagation, and k(T) -jet) we obtain efficiencies comparable to those of their classical counterparts. Even more, exponential speed-up could be achieved, in the first two algorithms, in data dimensionality and data length when the distance algorithm or the maximum searching algorithm are applied.
|
|
|
|
Actis, S. et al, & Rodrigo, G. (2010). Quest for precision in hadronic cross sections at low energy: Monte Carlo tools vs. experimental data. Eur. Phys. J. C, 66(3-4), 585–686.
Abstract: We present the achievements of the last years of the experimental and theoretical groups working on hadronic cross section measurements at the low-energy e (+) e (-) colliders in Beijing, Frascati, Ithaca, Novosibirsk, Stanford and Tsukuba and on tau decays. We sketch the prospects in these fields for the years to come. We emphasise the status and the precision of the Monte Carlo generators used to analyse the hadronic cross section measurements obtained as well with energy scans as with radiative return, to determine luminosities and tau decays. The radiative corrections fully or approximately implemented in the various codes and the contribution of the vacuum polarisation are discussed.
|
|
