Related papers: Efficient reduction of Feynman integrals on superc…
We find that all Feynman integrals (FIs), having any number of loops, can be completely determined once linear relations between FIs are provided. Therefore, FIs computation is conceptually changed to a linear algebraic problem. Examples up…
We present a detailed description of the recent idea for a direct decomposition of Feynman integrals onto a basis of master integrals by projections, as well as a direct derivation of the differential equations satisfied by the master…
We present the powerful module-intersection integration-by-parts (IBP) method, suitable for multi-loop and multi-scale Feynman integral reduction. Utilizing modern computational algebraic geometry techniques, this new method successfully…
In this paper, we describe a numerical approach to evaluate Feynman loop integrals. In this approach the key technique is a combination of a numerical integration method and a numerical extrapolation method. Since the computation is carried…
The evaluation of multi-loop Feynman integrals is one of the main challenges in the computation of precise theoretical predictions for the cross sections measured at the LHC. In recent years, the method of differential equations has proven…
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…
In this work, we developed an efficient quantum algorithm for the simulation of non-Markovian quantum dynamics, based on the Feynman path integral formulation. The algorithm scales polynomially with the number of native gates and the number…
Over the last year significant progress was made in the understanding of the computation of Feynman integrals using differential equations. These lectures give a review of these developments, while not assuming any prior knowledge of the…
A practical criterion for the irreducibility (with respect to integration by part identities) of a particular Feynman integral to a given set of integrals is presented. The irreducibility is shown to be related to the existence of stable…
We address the problem of unambiguous reconstruction of rational functions of many variables. This is particularly relevant for recovery of exact expansion coefficients in integration-by-parts identites (IBPs) based on modular arithmetic.…
An algorithm for the systematic analytical approximation of multi-scale Feynman integrals is presented. The algorithm produces algebraic expressions as functions of the kinematical parameters and mass scales appearing in the Feynman…
We revisit the idea of numerically integrating the differential form of Feynman integrals. With a novel approach for the treatment of branch cuts, we develop an integrator capable of evaluating a basis of master integrals in double and…
We show that the computational effort for the numerical solution of fermionic quantum systems, occurring e.g., in quantum chemistry, solid state physics, field theory in principle grows with less than the square of the particle number for…
Using integration by parts relations, Feynman integrals can be represented in terms of coupled systems of differential equations. In the following we suppose that the unknown Feynman integrals can be given in power series representations,…
Integration by parts is used to reduce scalar Feynman integrals to master integrals.
Deriving a comprehensive set of reduction rules for Feynman integrals has been a longstanding challenge. In this paper, we present a proposed solution to this problem utilizing generating functions of Feynman integrals. By establishing and…
We review an approach for the computation of Feynman integrals by use of multiple polylogarithms, with an emphasis on the related criterion of linear reducibility of the graph. We show that the set of graphs which satisfies the linear…
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…
We derive useful reduction formulae which express one-loop Feynman integrals with a large number of external momenta in terms of lower-point integrals carrying easily derivable kinematic coefficients which are symmetric in the external…
As we begin to reach the limits of classical computing, quantum computing has emerged as a technology that has captured the imagination of the scientific world. While for many years, the ability to execute quantum algorithms was only a…