Abstract: Characterizing multiloop topologies is an important step towards developing novel methods at high perturbative orders in quantum field theory. In this article, we exploit the Loop-Tree Duality (LTD) formalism to analyse multiloop topologies that appear for the first time at five loops. Explicitly, we open the loops into connected trees and group them according to their topological properties. Then, we identify a kernel generator, the so-called N7MLT universal topology, that allows us to describe any scattering amplitude of up to five loops. Furthermore, we provide factorization and recursion relations that enable us to write these multiloop topologies in terms of simpler subtopologies, including several subsets of Feynman diagrams with an arbitrary number of loops. Our approach takes advantage of many symmetries present in the graphical description of the original fundamental five-loop topologies. The results obtained in this article might shed light into a more efficient determination of higher-order corrections to the running couplings, which are crucial in the current and future precision physics program.

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.

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.

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.

Abstract: The perturbative approach to quantum field theories has made it possible to obtain incredibly accurate theoretical predictions in high-energy physics. Although various techniques have been developed to boost the efficiency of these calculations, some ingredients remain specially challenging. This is the case of multiloop scattering amplitudes that constitute a hard bottleneck to solve. In this paper, we delve into the application of a disruptive technique based on the loop-tree duality theorem, which is aimed at an efficient computation of such objects by opening the loops to nondisjoint trees. We study the multiloop topologies that first appear at four loops and assemble them in a clever and general expression, the (NMLT)-M-4 universal topology. This general expression enables to open any scattering amplitude of up to four loops, and also describes a subset of higher order configurations to all orders. These results confirm the conjecture of a factorized opening in terms of simpler known subtopologies, which also determines how the causal structure of the entire loop amplitude is characterized by the causal structure of its subtopologies. In addition, we confirm that the loop-tree duality representation of the (NMLT)-M-4 universal topology is manifestly free of noncausal thresholds, thus pointing towards a remarkably more stable numerical implementation of multiloop scattering amplitudes.