Related papers: New polynomially exact integration rules on U(N) a…
We investigate the performance of the hybrid Monte Carlo algorithm, the standard algorithm used for lattice QCD simulations involving fermions, in updating non-trivial global topological structures. We find that the hybrid Monte Carlo…
Monte Carlo methods cannot probe far into the QCD phase diagram with a real chemical potential, due to the famous sign problem. Complex Langevin simulations, using adaptive step-size scaling and gauge cooling, are suited for sampling path…
In this paper we propose a novel numerical approach for the Boltzmann equation with uncertainties. The method combines the efficiency of classical direct simulation Monte Carlo (DSMC) schemes in the phase space together with the accuracy of…
We give new rounding schemes for SDP relaxations for the problems of maximizing cubic polynomials over the unit sphere and the $n$-dimensional hypercube. In both cases, the resulting algorithms yield a $O(\sqrt{n/k})$ multiplicative…
We establish a deterministic and stochastic spherical quasi-interpolation framework featuring scaled zonal kernels derived from radial basis functions on the ambient Euclidean space. The method incorporates both quasi-Monte Carlo and Monte…
We present a numerically exact Inchworm Monte Carlo method for equilibrium multiorbital quantum impurity problems with general interactions and hybridizations. We show that the method, originally developed to overcome the dynamical sign…
We report on a study of the supersymmetric anharmonic oscillator computed using a euclidean lattice path integral. Our numerical work utilizes a Fourier accelerated hybrid Monte Carlo scheme to sample the path integral. Using this we are…
We perform simulations for long hard-sphere polymer chains using a recently developed binary-tree based Monte Carlo method. Systems in two to five dimensions with free and periodic boundary conditions and up to $10^7$ repeat units are…
Quasi-Monte Carlo (QMC) methods are being adopted in statistical applications due to the increasingly challenging nature of numerical integrals that are now routinely encountered. For integrands with $d$-dimensions and derivatives of order…
In this paper we investigate multivariate integration in weighted unanchored Sobolev spaces of smoothness of arbitrarily high order. As quadrature points we employ higher order polynomial lattice point sets over $\mathbb{F}_{2}$ which are…
In this paper, we develop and test a fast numerical algorithm, called MDI-LR, for efficient implementation of quasi-Monte Carlo lattice rules for computing $d$-dimensional integrals of a given function. It is based on the idea of converting…
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an $n\times n$ matrix over a finite field that requires $O(n^3)$ field operations and O(n) random vectors, and is well suited for successful practical…
We present a new approach for Monte Carlo simulations of lattice quantum spin systems which is able to eliminate the negative sign problem. Its complexity is linear in the volume of the lattice. Its efficiency is tested on a simple…
In this work, we introduce new families of nonconforming approximation methods for reconstructing functions on general polygonal meshes. These methods are defined using degrees of freedom based on weighted moments of orthogonal polynomials…
A new technique based on H\"older's integral inequality is applied to QCD sum-rules to provide fundamental constraints on the sum-rule parameters. These constraints must be satisfied if the sum-rules are to consistently describe integrated…
We obtain a new formula to relate the value of a Schur polynomial with variables $(x_1,\ldots,x_N)$ with values of Schur polynomials at $(1,\ldots,1)$. This allows to study the limit shape of perfect matchings on a square hexagon lattice…
We present a continuous-variable photonic quantum algorithm for the Monte Carlo evaluation of multi-dimensional integrals. Our algorithm encodes n-dimensional integration into n+3 modes and can provide a quadratic speedup in runtime…
Ab-initio Monte Carlo simulations of strongly-interacting fermionic systems are plagued by the fermion sign problem, making the non-perturbative study of many interesting regimes of dense quantum matter, or of theories of odd numbers of…
Quantum Monte Carlo simulations, while being efficient for bosons, suffer from the "negative sign problem'' when applied to fermions - causing an exponential increase of the computing time with the number of particles. A polynomial time…
For quantum field theories with topological sectors, Monte Carlo simulations on fine lattices tend to be obstructed by an extremely long auto-correlation time with respect to the topological charge. Then reliable numerical measurements are…