Related papers: Tackling Feynman integrals with quantum minimizati…

In this paper, we give a detailed account of the algorithm outlined in [1] for Feynman integral reduction and $\varepsilon$-factorised differential equations. The algorithm consists of two steps. In the first step, we use a new geometric…

Scattering amplitudes at loop level can be expressed in terms of Feynman integrals. The latter satisfy partial differential equations in the kinematical variables. We argue that a good choice of basis for (multi-)loop integrals can lead to…

The method of differential equations has been proven to be a powerful tool for the computation of multi-loop Feynman integrals appearing in quantum field theory. It has been observed that in many instances a canonical basis can be chosen,…

We present the integrand reduction via multivariate polynomial division as a natural technique to encode the unitarity conditions of Feynman amplitudes. We derive a recursive formula for the integrand reduction, valid for arbitrary…

An impressive effort is being placed in order to develop new strategies that allow an efficient computation of multi-loop multi-leg Feynman integrals and scattering amplitudes, with a particular emphasis on removing spurious singularities…

The Loop-Tree Duality (LTD) is a novel perturbative method in QFT that establishes a relation between loop-level and tree-level scattering amplitudes. This is achieved by directly applying the Residue Theorem to the loop-energy-integration.…

We present an efficient algorithm for calculating multiloop Feynman integrals perturbatively.

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…

Compilation optimizes quantum algorithms performances on real-world quantum computers. To date, it is performed via classical optimization strategies. We introduce a class of quantum algorithms to perform compilation via quantum computers,…

Multiloop scattering amplitudes describing the quantum fluctuations at high-energy scattering processes are the main bottleneck in perturbative quantum field theory. The loop-tree duality is a novel method aimed at overcoming this…

We present a novel approach to optimizing the reduction of Feynman integrals using integration-by-parts identities. By developing a priority function through the FunSearch algorithm, which combines large language models and genetic…

Recent advances in quantum technology have led to the development and manufacturing of experimental programmable quantum annealers that promise to solve certain combinatorial optimization problems of practical relevance faster than their…

We present a new method for the numerical evaluation of loop integrals which is based on the Feynman Tree Theorem. The loop integrals are replaced by phase-space integration over fictitious extra on-shell particles. This integration can be…

Here we explore which heuristic quantum algorithms for combinatorial optimization might be most practical to try out on a small fault-tolerant quantum computer. We compile circuits for several variants of quantum accelerated simulated…

We show how a large class of Feynman integrals can be efficiently reduced to master integrals by suitable covariant differentiation on the vector space dual to the one spanned by the master integrals. The connections needed in the covariant…

We report on a new method for the numerical evaluation of loop integrals, based on the Feynman Tree Theorem. The loop integrals are replaced by phase-space integration over fictitious extra on-shell particles. This integration can be…

Integer relation algorithms can convert numerical results for Feynman integrals to exact evaluations, when one has reason to suspect the existence of reductions to linear combinations of a basis, with rational or algebraic coefficients.…

Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational…

Unveiling hidden symmetries within Feynman diagrams is crucial for achieving more efficient computations in high-energy physics. In this paper, we study the symmetries underlying the causal Loop-Tree Duality (LTD) representations through a…

We present the first quantum computation of a total decay rate in high-energy physics at second order in perturbative quantum field theory. This work underscores the confluence of two recent cutting-edge advances. On the one hand, the…