Related papers: A simple algorithm for automatic Feynman diagram g…
Classical simulations of quantum computations are vital for the future development of this emerging technology. To this end, decision diagrams have been proposed as a complementary technique which frequently allows to tackle the inherent…
We present a nearly-linear time algorithm for counting and randomly generating simple graphs with a given degree sequence in a certain range. For degree sequence $(d_i)_{i=1}^n$ with maximum degree $d_{\max}=O(m^{1/4-\tau})$, our algorithm…
A scheme for systematically achieving accurate numerical evaluation of multi-loop Feynman diagrams is developed. This shows the feasibility of a project aimed to produce a complete calculation for two-loop predictions in the Standard Model.…
"The Spin Foams for People Without the 3d/4d Imagination" could be an alternative title of our work. We derive spin foams from operator spin network diagrams} we introduce. Our diagrams are the spin network analogy of the Feynman diagrams.…
We introduce a machine-learning framework based on symbolic regression to extract the full symbol alphabet of multi-loop Feynman integrals. By targeting the analytic structure rather than reduction, the method is broadly applicable and…
The standard procedure when evaluating integrals of a given family of Feynman integrals, corresponding to some Feynman graph, is to construct an algorithm which provides the possibility to write any particular integral as a linear…
Analytical explorations on complex networks and cubes (i.e., multi-dimensional datasets) are currently two separate research fields with different strategies. To gain more insights into cube dynamics via unique network-domain methodologies…
First-order automatic differentiation is a ubiquitous tool across statistics, machine learning, and computer science. Higher-order implementations of automatic differentiation, however, have yet to realize the same utility. In this paper I…
Click-through rate (CTR) prediction plays important role in personalized advertising and recommender systems. Though many models have been proposed such as FM, FFM and DeepFM in recent years, feature engineering is still a very important…
We discuss the program EXP used to automate the successive application of asymptotic expansions to Feynman diagrams. We focus on the generation of the relevant subgraphs and the determination of the topologies for the remaining integrals.…
A package for drawing publication-quality Feynman diagrams written in GLE is described.
Non-deterministic Finite Automata (NFA) represent regular languages concisely, increasing their appeal for applications such as word recognition. This paper proposes a new approach to generate NFA from an interaction language such as UML…
The LanHEP program for Feynman rules generation in momentum representation is presented. It reads the Lagrangian written in a compact form, close to the one used in publications. It means that Lagrangian terms can be written with summation…
Particle symbols and Feynman diagrams often used in particle physics can be generated by a word document processor. Standard office packages have their built in symbols such as solid-line, dashed-line, arrows, etc. which are also used in…
We present a simple derivation of a Feynman-Kac type formula to study fermionic systems. In this approach the real time or the imaginary time dynamics is expressed in terms of the evolution of a collection of Poisson processes. A computer…
This note describes an algorithm for enumerating all the elements in a finite set based on uniformly random sampling from the set. This algorithm can be used for enumeration by fair sampling with quantum annealing. Our algorithm is based on…
By using an approach of the invariant theory we obtain a new formula for the ordinary generating function of the numbers of the simple graphs with $n$ nodes.
We introduce an algorithm to generate multivariate series of symbols from a finite alphabet with a given hierarchical structure of similarities. The target hierarchical structure of similarities is arbitrary, for instance the one obtained…
We invent an automated method for computing the divergent part of Feynman integrals in dimensional regularization. Our method exploits simplifications from four-dimensional integration-by-parts identities. Leveraging algorithms from the…
Unlike most classical algorithms that take an input and give the solution directly as an output, quantum algorithms produce a quantum circuit that works as an indirect solution to computationally hard problems. In the full quantum computing…