Related papers: Towards a Complete Feynman Diagrams Automatic Comp…
We present a diagrammatic formulation of recently-revived covariant functional approaches to one-loop matching from an ultraviolet (UV) theory to a low-energy effective field theory. Various terms following from a covariant derivative…
We present a review of the Bielefeld-Dubna activities on the multiloop calculations. In the first part a C-program DIANA (DIagram ANAlyser) for the automation of Feynman diagram evaluations is presented, in the second part various…
Graphs are widespread data structures used to model a wide variety of problems. The sheer amount of data to be processed has prompted the creation of a myriad of systems that help us cope with massive scale graphs. The pressure to deliver…
The ability to represent perturbative expansions of interacting quantum field theories in terms of simple diagrammatic rules has revolutionized calculations in particle physics (and elsewhere). Moreover, these rules are readily automated, a…
Some problems related to the structure of higher terms of the epsilon-expansion of Feynman diagrams are discussed.
We present a new Mathematica package that provides a platform to perform multi-loop computations. ANATAR integrates several existing tools designed for higher-order computations. In particular, it uses QGRAF to generate Feynman diagrams and…
There is currently a high demand for theoretical predictions for processes at next-to-next-to-leading order (NNLO) and beyond, mainly due to the large amount of data which has already been collected at LHC. This requires practical methods…
We present new results on FeynOnium, an ongoing project to develop a general purpose software toolkit for semi-automatic symbolic calculations in nonrelativistic Effective Field Theories (EFTs). Building upon FeynCalc, an existing…
Feynmf is a LaTeX package for easy drawing of professional quality Feynman diagrams with Metafont (or Metapost). Feynmf lays out most diagrams satisfactorily from the structure of the graph without any need for manual intervention.…
A method of Feynman diagrams summation, based on using Schwinger-Dyson equations and Ward identities, is verified by calculating some four-loop diagrams in N=1 supersymmetric electrodynamics, regularized by higher derivatives. In…
Envisioned by Richard Feynman in the early 1980s, quantum simulation has received dramatic impetus thanks to the development of a variety of plateforms able to emulate a wide class of quantum Hamiltonians. During the past decade, most of…
During the past decades, quantum mechanical methods have undergone an amazing transition from pioneering investigations of experts into a wide range of practical applications, made by a vast community of researchers. First principles…
Controlling complex dynamical systems has been a topic of considerable interest in academic circles in recent decades. While existing works have primarily focused on closed-loop control schemes with infinite-time durations, this paper…
We present a historiographical review of algorithms and computer codes developed for solving integration-by-parts relations for Feynman integrals. This procedure is one of the key steps in the evaluation of Feynman integrals, since it…
We discuss a progress in calculation of Feynman integrals which has been done with help of the Differential Equation Method and demonstrate the results for a class of two-point two-loop diagrams.
By symbolic summation methods based on difference fields we present a general strategy that transforms definite multi-sums, e.g., in terms of hypergeometric terms and harmonic sums, to indefinite nested sums and products. We succeeded in…
Graph is a well known data structure to represent the associated relationships in a variety of applications, e.g., data science and machine learning. Despite a wealth of existing efforts on developing graph processing systems for improving…
The derivation of the Feynman rules for lattice perturbation theory from actions and operators is complicated, especially for highly improved actions such as HISQ. This task is, however, both important and particularly suitable for…
We present a user-friendly software for photonic analog quantum computing with an installable MATLAB package and the graphical user interface (GUI) that allows for convenient operation without requiring programming skills. Arbitrary…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…