Related papers: A New Algorithm For The Generation Of Unitarity-Co…
Modern inference and learning often hinge on identifying low-dimensional structures that approximate large scale data. Subspace clustering achieves this through a union of linear subspaces. However, in contemporary applications data is…
High precision calculations in perturbative QFT often require evaluation of big collection of Feynman integrals. Complexity of this task can be greatly reduced via the usage of linear identities among Feynman integrals. Based on…
A numerical program is presented which facilitates a computation pertaining to the full set of one-gluon loop diagrams (including ghost loop contributions), with M attached external gluon lines in all possible ways. The feasibility of such…
A framework to represent and compute two-loop $N$-point Feynman diagrams as double-integrals is discussed. The integrands are 'generalised one-loop type" multi-point functions multiplied by simple weighting factors. The final integrations…
We evaluate the three-loop five-point pentagon-box-box massless integral family in the dimensional regularization scheme, via canonical differential equation. We use tools from computational algebraic geometry to enable the necessary…
Scattering amplitudes at loop level can be reduced to a basis of linearly independent Feynman integrals. The integral coefficients are extracted from generalized unitarity cuts which define algebraic varieties. The topology of an algebraic…
The first paper of this series introduced objects (elements of twisted relative cohomology) that are Poincar\'e dual to Feynman integrals. We show how to use the pairing between these spaces -- an algebraic invariant called the intersection…
Some more general "inheritance conditions" have been found for a given set of symmetry generators $\{\mathbf{Z}_{\bar{l}}\}$ acting on some set of coupled ordinary differential equations, once the "first integration method" has been applied…
New methods for obtaining functional equations for Feynman integrals are presented. Application of these methods for finding functional equations for various one- and two- loop integrals described in detail. It is shown that with the aid of…
An analytical-numeric calculation method of extremely complicated integrals is presented. These integrals appear often in magnet soliton theory. The appropriate analytical continuation and a corresponding integration contour allow to reduce…
In this manuscript, which is to appear in the proceedings of the conference "MathemAmplitude 2019" in Padova, Italy, we provide an overview of the module intersection method for the the integration-by-parts (IBP) reduction of multi-loop…
We evaluate a four-loop conformal integral, i.e. an integral over four four-dimensional coordinates, by turning to its dimensionally regularized version and applying differential equations for the set of the corresponding 213 master…
We present a new algorithm for integration-by-parts (IBP) reduction of Feynman integrals with high powers of numerators or propagators, a demanding computational step in evaluating multi-loop scattering amplitudes. The algorithm starts with…
This paper presents a deep reinforcement learning approach for synthesizing unitaries into quantum circuits. Unitary synthesis aims to identify a quantum circuit that represents a given unitary while minimizing circuit depth, total gate…
Answering connectivity queries in semi-algebraic sets is a long-standing and challenging computational issue with applications in robotics, in particular for the analysis of kinematic singularities. One task there is to compute the number…
We present algorithms to solve coupled systems of linear differential equations, arising in the calculation of massive Feynman diagrams with local operator insertions at 3-loop order, which do {\it not} request special choices of bases.…
A scheme for systematically achieving accurate numerical evaluation of multi-loop Feynman diagrams is developed. This shows the feasibility of a project aimed to produce a complete calculation for two-loop predictions in the Standard Model.…
This article presents a validation of a recently proposed strongly polynomial-time algorithm for the general linear programming problem. The proposed algorithm is an implicit reduction procedure that combines primal and dual linear…
In this paper we propose a fast algorithm for trivariate interpolation, which is based on the partition of unity method for constructing a global interpolant by blending local radial basis function interpolants and using locally supported…
The reduction of a large number of scalar integrals to a small set of master integrals via Laporta's algorithm is common practice in multi-loop calculations. It is also a major bottleneck in terms of running time and memory consumption. It…