Related papers: Numerically Computing QCD Laplace Sum-Rules Using …
Within recent years, considerable progress has been made regarding high-performance solvers for Partial Differential Equations (PDEs), yielding potential gains in efficiency compared to industry standard tools. However, the latter largely…
This work deals with special nested objects arising in massive higher order perturbative calculations in renormalizable quantum field theories. On the one hand we work with nested sums such as harmonic sums and their generalizations…
We explore the combination of deterministic and Monte Carlo methods to facilitate efficient automatic numerical computation of multidimensional integrals with singular integrands. Two adaptive algorithms are presented that employ recursion…
QCD sum rules are overviewed with an emphasize on the practical applications of this method to the physics of light and heavy hadrons.
We use QCD sum rules to test the nature of the recently observed mesons Y(4260), Y(4350) and Y(4660), assumed to be exotic four-quark $(c\bar{c}q\bar{q})$ or $(c\bar{c}s\bar{s})$ states with $J^{PC}=1^{--}$. We work at leading order in…
Modern particle physics is increasingly becoming a precision science that relies on advanced theoretical predictions for the analysis and interpretation of experimental results. The planned physics program at the LHC and future colliders…
\texttt{DiscoTEX} is a highly accurate numerical algorithm for computing numerical weak-form solutions to distributionally sourced partial differential equations (PDE)s. The aim of this second paper, succeeding \cite{da2024discotex}, is to…
We present the software library libCreme which we have previously used to successfully calculate convex-roof entanglement measures of mixed quantum states appearing in realistic physical systems. Evaluating the amount of entanglement in…
Semidefinite relaxations are widely used to compute upper bounds on the objective of optimization problems involving noncommutative polynomials. Such optimization problems are prevalent in quantum information. We present an algorithm able…
In the framework of risk assessment in nuclear accident analysis, best-estimatecomputer codes, associated to a probabilistic modeling of the uncertain input variables,are used to estimate safety margins. A first step in such uncertainty…
In this article, we assume that the nonet scalar mesons below $1\,\rm{ GeV}$ are the two-quark-tetraquark mixed states and study their masses and pole residues using the QCD sum rules. In calculation, we take into account the vacuum…
In this paper we propose a very simple but powerful self-correction method for the Min-Sum decoding of LPDC codes. Unlike other correction methods known in the literature, our method does not try to correct the check node processing…
A C99 program is presented which calculates the Clausen sums for non-negative integer indices j and real arguments x. The implementation is split into three major cases. For large j, a direct, truncated summation of the sum is performed.…
Probabilistic programs are key to deal with uncertainty in e.g. controller synthesis. They are typically small but intricate. Their development is complex and error prone requiring quantitative reasoning over a myriad of alternative…
In this paper the computational aspects of probability calculations for dynamical partial sum expressions are discussed. Such dynamical partial sum expressions have many important applications, and examples are provided in the fields of…
In this work, we study the mass spectrum of the hidden-charm hybrid states with the $J^{PC}=0^{-+}$, $0^{++}$, $0^{--}$, $1^{++}$, $1^{+-}$, $1^{-+}$, $1^{--}$, $2^{-+}$ and $2^{++}$ via the QCD sum rules in a consistent way. We calculate…
Fundamental inequalities for QCD sum-rules are applied to resolve a paradox recently encountered in a sum-rule calculation. This paradox was encountered in a toy model known to be free of resonances that yields an apparent resonance using a…
Quantum computers use quantum mechanical phenomena to perform conventionally intractable calculations for specific problems. Despite being universal machines, quantum computers are not expected to replace classical computers, but rather, to…
We describe the construction of a high performance parallel computer composed of PC components, present some physical results for light hadron and hybrid meson masses from lattice QCD. We also show that the smearing technique is very useful…
We consider private polynomial computation (PPC) over noncolluding coded databases. In such a setting a user wishes to compute a multivariate polynomial of degree at most $g$ over $f$ variables (or messages) stored in multiple databases…