Related papers: Untangling the IBP Equations
Convergence problems in coupled-cluster iterations are discussed, and a new iteration scheme is proposed. Whereas the Jacobi method inverts only the diagonal part of the large matrix of equation coefficients, we invert a matrix which also…
We report our experiences with the generalized integration-by-parts algorithm [hep-ph/9609429] in the context of calculations of a realistic one-loop subset of diagrams.
In this paper we show how to improve and extend the Integration by Fractional Expansion technique (IBFE) by applying it to certain families of scalar massive Feynman diagrams. The strategy is based on combining this method together with the…
We propose a novel method to compute multi-loop master integrals by constructing and numerically solving a system of ordinary differential equations, with almost trivial boundary conditions. Thus it can be systematically applied to problems…
Diagonalization of a large matrix is the computational bottleneck in many applications such as electronic structure calculations. We show that a speedup of over 30% can be achieved by exploiting 32-bit floating point operations, while…
This work proposes double-bracket iterations as a framework for obtaining diagonalizing quantum circuits. Their implementation on a quantum computer consists of interlacing evolutions generated by the input Hamiltonian with diagonal…
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations of these tools focusing on solutions of the real analogue:…
We report on an approach to integration-by-parts reduction based on Gr\"obner bases. We establish the underlying noncommutative rational double-shift algebra wherein the integration-by-parts relations form a left ideal. We describe in…
We solve the integration-by-parts (IBP) identities needed for the computation of any planar two-loop five-point massless amplitude in QCD. We also derive some new results for the most complicated non-planar topology with irreducible…
Many probabilistic inference tasks involve summations over exponentially large sets. Recently, it has been shown that these problems can be reduced to solving a polynomial number of MAP inference queries for a model augmented with randomly…
A general framework of Numerical Singular Integrals (NSI) method based on the Integration By Parts (IBP) has been developed for integrals involving singular and nearly singular integrands, or NSI-IBP. Through a general integration by parts…
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…
Systems of integration-by-parts identities play an important role in simplifying the higher-loop Feynman integrals that arise in quantum field theory. Solving these systems is equivalent to reducing integrals containing numerator products…
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 show that the integration-by-parts reductions of various two-loop integral topologies can be efficiently obtained by applying unitarity cuts to a specific set of subgraphs and solving associated polynomial (syzygy) equations.
The ideas behind the concept of algebraic ("integration-by-parts") algorithms for multiloop calculations are reviewed. For any topology and mass pattern, a finite iterative algebraic procedure is proved to exist which transforms the…
In this paper, we construct a uniform formula that can iteratively reduce all auxiliary scalar product numerators of arbitrary multi-loop Feynman integrals. Integrals with such numerators commonly appear in Integration-By-Parts (IBP)…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
We discuss recent progress in multi-loop integrand reduction methods. Motivated by the possibility of an automated construction of multi-loop amplitudes via generalized unitarity cuts we describe a procedure to obtain a general…