Ramirez-Uribe, S., Renteria-Olivo, A. E., Rodrigo, G., Sborlini, G. F. R., & Vale Silva, L. (2022). Quantum algorithm for Feynman loop integrals. J. High Energy Phys., 05(5), 100–32pp.
Abstract: We present a novel benchmark application of a quantum algorithm to Feynman loop integrals. The two on-shell states of a Feynman propagator are identified with the two states of a qubit and a quantum algorithm is used to unfold the causal singular configurations of multiloop Feynman diagrams. To identify such configurations, we exploit Grover's algorithm for querying multiple solutions over unstructured datasets, which presents a quadratic speed-up over classical algorithms when the number of solutions is much smaller than the number of possible configurations. A suitable modification is introduced to deal with topologies in which the number of causal states to be identified is nearly half of the total number of states. The output of the quantum algorithm in IBM Quantum and QUTE Testbed simulators is used to bootstrap the causal representation in the loop-tree duality of representative multiloop topologies. The algorithm may also find application and interest in graph theory to solve problems involving directed acyclic graphs.
|
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.
|
Chachamis, G., Deak, M., Hentschinski, M., Rodrigo, G., & Sabio Vera, A. (2015). Single bottom quark production in kT-factorisation. J. High Energy Phys., 09(9), 123–17pp.
Abstract: We present a study within the k(T)-factorisation scheme on single bottom quark production at the LHC. In particular, we calculate the rapidity and transverse momentum differential distributions for single bottom quark/anti-quark production. In our setup, the unintegrated gluon density is obtained from the NLx BFKL Green function whereas we included mass effects to the Lx heavy quark jet vertex. We compare our results to the corresponding distributions predicted by the usual collinear factorisation scheme. The latter were produced with Pythia 8.1.
|
Catani, S., de Florian, D., & Rodrigo, G. (2012). Space-like (vs. time-like) collinear limits in QCD: is factorization violated? J. High Energy Phys., 07(7), 026–88pp.
Abstract: We consider the singular behaviour of QCD scattering amplitudes in kinematical configurations where two or more momenta of the external partons become collinear. At the tree level, this behaviour is known to be controlled by factorization formulae in which the singular collinear factor is universal (process independent). We show that this strict (process-independent) factorization is not valid at one-loop and higher-loop orders in the case of the collinear limit in space-like regions (e. g., collinear radiation from initial-state partons). We introduce a generalized version of all-order collinear factorization, in which the space-like singular factors retain some dependence on the momentum and colour charge of the non-collinear partons. We present explicit results on one-loop and two-loop amplitudes for both the two-parton and multiparton collinear limits. At the level of squared amplitudes and, more generally, cross sections in hadron-hadron collisions, the violation of strict collinear factorization has implications on the non-abelian structure of logarithmically-enhanced terms in perturbative calculations (starting from the next-to-next-to-leading order) and on various factorization issues of mass singularities (starting from the next-to-next-to-next-to-leading order).
|
