Related papers: GLoop: A Monte Carlo program to construct higher-l…
We have developed a new parallel supercomputer code based on Henon's Monte Carlo method for simulating the dynamical evolution of globular clusters. This new code allows us to calculate the evolution of a cluster containing a realistic…
The program package GoSam is presented which aims at the automated calculation of one-loop amplitudes for multi-particle processes. The amplitudes are generated in terms of Feynman diagrams and can be reduced using either D-dimensional…
The Graphical Lasso (GLasso) algorithm is fast and widely used for estimating sparse precision matrices (Friedman et al., 2008). Its central role in the literature of high-dimensional covariance estimation rivals that of Lasso regression…
In this review, we address the use of Monte Carlo methods for approximating definite integrals of the form $Z = \int L(x) d P(x)$, where $L$ is a target function (often a likelihood) and $P$ a finite measure. We present vertical-likelihood…
A numerical program is presented which facilitates the computation of the full set of one-gluon loop diagrams (including ghost loop contributions), with M attached external gluon lines in all possible ways. The feasibility of such a task…
Monte Carlo studies of many quantum systems face exponentially severe signal-to-noise problems. We show that noise arising from complex phase fluctuations of observables can be reduced without introducing bias using path integral contour…
A formalism for the numerical integration of one- and two-loop integrals is presented. It is based on subtraction terms which remove the soft, collinear and some of the ultraviolet divergences from the integrand. The numerical integral is…
Standard quantum amplitude estimation algorithms provide quadratic speedup to Monte-Carlo simulations but require a circuit depth that scales as inverse of the estimation error. In view of the shallow depth in near-term devices, the…
Starting from the parametric representation of a Feynman diagram, we obtain it's well defined value in dimensional regularisation by changing the integrals over parameters into contour integrals. That way we eventually arrive at a…
In this paper, we study systematically scalar one-loop two-, three-, and four-point Feynman integrals with complex internal masses. Our analytic results presented in this report are valid for both real and complex internal masses. The…
Recently, the concept of generating function has been employed in one-loop reduction. For one-loop integrals encompassing arbitrary tensor ranks and higher-pole contributions, the generating function can be decomposed into a tensor part and…
We investigate in this work a recently proposed diagrammatic quantum Monte Carlo method --- the inchworm Monte Carlo method --- for open quantum systems. We establish its validity rigorously based on resummation of Dyson series. Moreover,…
Construction of a QCD cascade at the NLO level requires recalculation of the splitting functions in a different manner [1]. We describe the calculation of some of the virtual contributions to the non-singlet splitting function. In order to…
The purpose of this note is to extend the divergences analyzed in a previous work by application of the Deformed Logarithm in its most general form. In a study on entropic divergences, we have analyzed the different forms of the deformed…
An efficient and robust linear scaling method is presented for large scale {\it ab initio} electronic structure calculations of a wide variety of materials including metals. The detailed short range and the effective long range…
Linear algebra expressions, which play a central role in countless scientific computations, are often computed via a sequence of calls to existing libraries of building blocks (such as those provided by BLAS and LAPACK). A sequence…
We define a general scheme for the evolution of fragmentation functions which resums both soft gluon logarithms and mass singularities in a consistent manner and to any order, and requires no additional theoretical assumptions. Using the…
Computational color constancy is a preprocessing step used in many camera systems. The main aim is to discount the effect of the illumination on the colors in the scene and restore the original colors of the objects. Recently, several deep…
We present a new method to compute higher-order corrections to physical cross-sections, at Next-to-Leading Order and beyond. This method, based on the Loop Tree Duality, leads to locally integrable expressions in four dimensions. By…
The Monte Carlo method is a thriving and mathematically beautiful numerical technique used extensively, nowadays, to deal with many demanding problems in diverse fields. Here, we present an iterative Monte Carlo algorithm to work out very…