Related papers: A development of an accelerator board dedicated fo…
Matrix multiplication is a fundamental operation in both training of neural networks and inference. To accelerate matrix multiplication, Graphical Processing Units (GPUs) provide it implemented in hardware. Due to the increased throughput…
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…
I describe a mathematical framework for the efficient processing of the very large sets of Feynman diagrams contributing to the scattering of many particles. I reexpress the established numerical methods for the recursive construction of…
Graph partitioning is a fundamental combinatorial optimization problem that attracts a lot of attention from theoreticians and practitioners due to its broad applications. From multilevel graph partitioning to more general-purpose…
Quantum algorithms are a promising framework for unfolding the causal configurations of multiloop Feynman diagrams, which is equivalent to querying the \textit{directed acyclic graph} (DAG) configurations of undirected graphs in graph…
We give an algorithm for obtaining expansions of massive two-loop Feynman graphs in powers of the external momentum around a finite, nonzero value of the momentum. This is based on our general two-loop formalism to reduce massive two-loop…
This study is targeted to the NLO corrections of multileg processes, very important for the LHC. Starting from the construction of Feynman diagrams, the analytical reduction of general one-loop integrals to scalar master ones, the…
FeynMaster is a multi-tasking software for particle physics studies. By making use of already existing programs (FeynRules, QGRAF, FeynCalc), FeynMaster automatically generates Feynman rules, generates and draws Feynman diagrams, generates…
We report some improvements to the gradient ascent pulse engineering (GRAPE) algorithm for optimal control of quantum systems. These include more accurate gradients, convergence acceleration using the BFGS quasi-Newton algorithm as well as…
This text reviews, hopefully in a pedagogical manner, a series of work on the automatic calculations of Feynman diagrams in the context of quantum nanoelectronics (Keldysh formalism) with an application to the Kondo effect in the…
In modern quantum field theory, one of the most important tasks is the calculation of loop integrals. Loop integrals appear when evaluating the Feynman diagrams with one or more loops by integrating over the internal momenta. Even though…
Using a Mellin-Barnes representation, we compute the on-shell massless planar double box Feynman diagram with an irreducible scalar product of loop momenta in the numerator. This diagram is needed in calculations of two loop corrections to…
For the investigation of higher order Feynman integrals, potentially with tensor structure, it is highly desirable to have numerical methods and automated tools for dedicated, but sufficiently 'simple' numerical approaches. We elaborate two…
We present a variational quantum eigensolver (VQE) algorithm for the efficient bootstrapping of the causal representation of multiloop Feynman diagrams in the Loop-Tree Duality (LTD) or, equivalently, the selection of acyclic configurations…
In this work, we systematically analyse Feynman integrals in the `t Hooft-Veltman scheme. We write an explicit reduction resulting from partial fractioning the high-multiplicity integrands to a finite basis of topologies at any given loop…
The Strassen algorithm and Winograd's variant accelerate matrix multiplication by using fewer arithmetic operations than standard matrix multiplication. Although many papers have been published to accelerate single- as well as…
We compute systematically for the planar double box Feynman integral relevant to top pair production with a closed top loop the Laurent expansion in the dimensional regularisation parameter $\varepsilon$. This is done by transforming the…
A typical optimization of customized accelerators for error-tolerant applications such as multimedia, recognition, and classification is to replace traditional arithmetic units like multipliers and adders with the approximate ones to…
We describe the application of differential reduction algorithms for Feynman Diagram calculation. We illustrate the procedure in the context of generalized hypergeometric functions, and give an example for a type of q-loop bubble diagram.
We present an algorithm to evaluate multiloop Feynman integrals with an arbitrary number of internal massive lines, with the masses being in general complex-valued, and its implementation in the \textsc{Mathematica} package…