Related papers: A New Algorithm For The Generation Of Unitarity-Co…
Clustering attempts to partition data instances into several distinctive groups, while the similarities among data belonging to the common partition can be principally reserved. Furthermore, incomplete data frequently occurs in many…
This paper proposes new factorizations for computing the Neumann series. The factorizations are based on fast algorithms for small prime sizes series and the splitting of large sizes into several smaller ones. We propose a different basis…
Tensor factorizations are computationally hard problems, and in particular, are often significantly harder than their matrix counterparts. In case of Boolean tensor factorizations -- where the input tensor and all the factors are required…
Reductions combine collections of inputs with an associative (and here, also commutative) operator to produce collections of outputs. When the same value contributes to multiple outputs, there is an opportunity to reuse partial results,…
Feynman loop integrals are a key ingredient for the calculation of higher order radiation effects, and are responsible for reliable and accurate theoretical prediction. We improve the efficiency of numerical integration in sector…
The most efficient known quantum circuits for preparing unitary coupled cluster states and applying Trotter steps of the arbitrary basis electronic structure Hamiltonian involve interleaved sequences of fermionic Gaussian circuits and Ising…
Four-dimensional renormalized (FDR) integrals play an increasingly important role in perturbative loop calculations. Thanks to them, loop computations can be performed directly in four dimensions and with no ultraviolet (UV) counterterms.…
In this talk, we use several examples to elaborate on how a recently proposed algorithm can turn non-trivial Feynman integrals into an $\varepsilon $-factorised manner, regardless of their hidden geometric essence. In particular, some extra…
It is by now well established that, by means of the integration by part identities, all the integrals occurring in the evaluation of a Feynman graph of given topology can be expressed in terms of a few independent master integrals. It is…
We motivate the use of quantum algorithms in particle physics and provide a brief overview of the most recent applications at high-energy colliders. In particular, we discuss in detail how a quantum approach reduces the complexity of jet…
A method of functional reduction for the dimensionally regularized one-loop Feynman integrals with massive propagators is described in detail. The method is based on a repeated application of the functional relations proposed by the author.…
Single scale Feynman integrals in quantum field theories obey difference or differential equations with respect to their discrete parameter $N$ or continuous parameter $x$. The analysis of these equations reveals to which order they…
We present a simplification of the recursive algorithm for the evaluation of intersection numbers for differential $n$-forms, by combining the advantages emerging from the choice of delta-forms as generators of relative twisted cohomology…
We analyze the preservation properties of a family of reversible splitting methods when they are applied to the numerical time integration of linear differential equations defined in the unitary group. The schemes involve complex…
We define linearly reducible elliptic Feynman integrals, and we show that they can be algorithmically solved up to arbitrary order of the dimensional regulator in terms of a 1-dimensional integral over a polylogarithmic integrand, which we…
We present an algorithm for determining the minimal order differential equations associated to a given Feynman integral in dimensional or analytic regularisation. The algorithm is an extension of the Griffiths-Dwork pole reduction adapted…
We propose new primal-dual decomposition algorithms for solving systems of inclusions involving sums of linearly composed maximally monotone operators. The principal innovation in these algorithms is that they are block-iterative in the…
We describe the unitarity approach for the numerical computation of two-loop integral coefficients of scattering amplitudes. It is well known that the leading propagator singularities of an amplitude's integrand are related to products of…
We use filtrations of the Grassmannian model to produce explicit algebraic formulae for all harmonic maps of finite uniton number from a Riemann surface, and so all harmonic maps from the 2-sphere, to the unitary group for a general class…
We discuss the computational complexity of solving linear programming problems by means of an analog computer. The latter is modeled by a dynamical system which converges to the optimal vertex solution. We analyze various probability…