Related papers: Automatic Calculation of SUSY-particle Production
With the development of low order scaling methods for performing Kohn-Sham Density Functional Theory, it is now possible to perform fully quantum mechanical calculations of systems containing tens of thousands of atoms. However, with an…
We propose the reduced-shifted Conjugate-Gradient (RSCG) method, which is numerically efficient to calculate a matrix element of a Green's function defined as a resolvent of a Hamiltonian operator, by solving linear equations with a desired…
Bayesian state and parameter estimation have been automated effectively in a variety of probabilistic programming languages. The process of model comparison on the other hand, which still requires error-prone and time-consuming manual…
We present a multiplication algorithm to recursively construct vertices for the Schroedinger functional in the abelian background field case. The algorithm is suited for automatic perturbative calculations with a variety of actions. As…
We compute the MSSM one-loop contributions to the asymptotic energy behaviour of fermion-antifermion pair production at future lepton-antilepton colliders. Besides the conventional logarithms of Renormalization Group origin, extra SUSY…
An algorithm for the numerical inversion of large matrices, the biconjugate gradient algorithm (BGA), is investigated in view of its use for Monte Carlo simulations of fermionic field theories. It is compared with the usual conjugate…
This paper introduces an innovative approach for representing Gaussian fermionic states, pivotal in quantum spin systems and fermionic models, within a range of alternative quantum bases. We focus on transitioning these states from the…
It is known that computing the permanent of the matrix $1+A$, where $A$ is a finite-rank matrix, requires a number of operations polynomial in the matrix size. Motivated by the boson-sampling proposal of restricted quantum computation, I…
We describe the implementation of the renormalized complex MSSM (cMSSM) in the diagram generator FeynArts and the calculational tool FormCalc. This extension allows to perform UV-finite one-loop calculations of cMSSM processes almost fully…
We consider the production of SUSY scalar pairs at lepton colliders, for c.m. energies much larger than the mass of the heaviest SUSY (real or virtual) particle involved in the process. In that energy regime, we derive the leading and…
Some important applicative problems require the evaluation of functions $\Psi$ of large and sparse and/or \emph{localized} matrices $A$. Popular and interesting techniques for computing $\Psi(A)$ and $\Psi(A)\mathbf{v}$, where $\mathbf{v}$…
In this paper, we discover a new quantum Monte Carlo (QMC) method to solve the fermion sign problem in interacting fermion models by employing Majorana representation of complex fermions. We call it "Majorana QMC" (MQMC). Especially, MQMC…
We present a computer code that analytically evaluates the matrix elements of the microscopic nuclear Hamiltonian and unity operator between Slater determinants of displaced gaussian single particle orbits. Such matrix elements appear in…
Explicit treatment of many-body Fermi statistics in path integral Monte Carlo (PIMC) results in exponentially scaling computational cost due to the near cancellation of contributions to observables from even and odd permutations. Through…
We perform the sewing of two (dual) Ramond reggeon vertices and derive an algorithm by means of which the so obtained four-Ramond reggeon vertex may be explicitly computed at arbitrary oscillator (mass) level. A closed form of the…
We study the potential of high-energy photon colliders for the production of gluino pairs within the Minimal Supersymmetric Standard Model (MSSM). In this model, the process gamma gamma -> gluino gluino is mediated by quark/squark box…
To implement a quantum error correction protocol, we first need a scheme to prepare our state in the correct subspace of the code, and this can be done using a unitary encoding circuit. Majorana codes are special since any gates that…
We introduce a new algorithm which we call the {Rational Hybrid Monte Carlo} Algorithm (RHMC). This method uses a rational approximation to the fermionic kernel together with a noisy Kennedy-Kuti acceptance step to give an efficient…
A new method to construct task graphs for \mcH-matrix arithmetic is introduced, which uses the information associated with all tasks of the standard recursive \mcH-matrix algorithms, e.g., the block index set of the matrix blocks involved…
A number of stochastic methods developed for the calculation of fermion loops are investigated and compared, in particular with respect to their efficiency when implemented on Graphics Processing Units (GPUs). We assess the performance of…