Aguilera-Verdugo, J. J., Driencourt-Mangin, F., Hernandez-Pinto, R. J., Plenter, J., Ramirez-Uribe, S., Renteria-Olivo, A. E., et al. (2020). Open Loop Amplitudes and Causality to All Orders and Powers from the Loop-Tree Duality. Phys. Rev. Lett., 124(21), 211602–6pp.
Abstract: Multiloop scattering amplitudes describing the quantum fluctuations at high-energy scattering processes are the main bottleneck in perturbative quantum field theory. The loop-tree duality is a novel method aimed at overcoming this bottleneck by opening the loop amplitudes into trees and combining them at integrand level with the real-emission matrix elements. In this Letter, we generalize the loop-tree duality to all orders in the perturbative expansion by using the complex Lorentz-covariant prescription of the original one-loop formulation. We introduce a series of mutiloop topologies with arbitrary internal configurations and derive very compact and factorizable expressions of their open-to-trees representation in the loop-tree duality formalism. Furthermore, these expressions are entirely independent at integrand level of the initial assignments of momentum flows in the Feynman representation and remarkably free of noncausal singularities. These properties, that we conjecture to hold to other topologies at all orders, provide integrand representations of scattering amplitudes that exhibit manifest causal singular structures and better numerical stability than in other representations.
|
Driencourt-Mangin, F., Rodrigo, G., Sborlini, G. F. R., & Torres Bobadilla, W. J. (2022). Interplay between the loop-tree duality and helicity amplitudes. Phys. Rev. D, 105(1), 016012–13pp.
Abstract: The spinor-helicity formalism has proven to be very efficient in the calculation of scattering amplitudes in quantum field theory, while the loop-tree duality (LTD) representation of multiloop integrals exhibits appealing and interesting advantages with respect to other approaches. In view of the most recent developments in LTD, we exploit the synergies with the spinor-helicity formalism to analyze illustrative one- and two-loop scattering processes. We focus our discussion on the local UV renormalization of IR and UV finite helicity amplitudes and present a fully automated numerical implementation that provides efficient expressions, which are integrable directly in four space-time dimensions.
|
Aparisi, J., Fuster, J., Irles, A., Rodrigo, G., Vos, M., Yamamoto, H., et al. (2022). m(b) at m(H): The Running Bottom Quark Mass and the Higgs Boson. Phys. Rev. Lett., 128(12), 122001–7pp.
Abstract: We present a new measurement of the bottom quark mass in the MS scheme at the renormalization scale of the Higgs boson mass from measurements of Higgs boson decay rates at the LHC: -0.31 GeV. The measurement has a negligible theory uncertainty and excellent prospects to improve at the HL-LHC and a future Higgs factory. Confronting this result and mb(mb) from low-energy measurements and mb(mZ) from Z-pole data, with the prediction of the scale evolution of the renormalization group equations, we find strong evidence for the “running” of the bottom quark mass.
|
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.
|
Clemente, G., Crippa, A., Jansen, K., Ramirez-Uribe, S., Renteria-Olivo, A. E., Rodrigo, G., et al. (2023). Variational quantum eigensolver for causal loop Feynman diagrams and directed acyclic graphs. Phys. Rev. D, 108(9), 096035–19pp.
Abstract: We present a variational quantum eigensolver (VQE) algorithm for the efficient bootstrapping of the causal representation of multiloop Feynman diagrams in the loop-tree duality or, equivalently, the selection of acyclic configurations in directed graphs. A loop Hamiltonian based on the adjacency matrix describing a multiloop topology, and whose different energy levels correspond to the number of cycles, is minimized by VQE to identify the causal or acyclic configurations. The algorithm has been adapted to select multiple degenerated minima and thus achieves higher detection rates. A performance comparison with a Grover's based algorithm is discussed in detail. The VQE approach requires, in general, fewer qubits and shorter circuits for its implementation, albeit with lesser success rates.
|
