Related papers: Subgroup-based Rank-1 Lattice Quasi-Monte Carlo
We present a universal parameter-free quantum Monte Carlo (QMC) algorithm designed to simulate arbitrary spin-$1/2$ Hamiltonians. To ensure the convergence of the Markov chain to equilibrium for every conceivable case, we devise a clear and…
The $\mathcal{L}_2$ discrepancy is one of several well-known quantitative measures for the equidistribution properties of point sets in the high-dimensional unit cube. The concept of weights was introduced by Sloan and Wo\'{z}niakowski to…
In lattice QCD the calculation of disconnected quark loops from the trace of the inverse quark matrix has large noise variance. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials on a…
We propose a framework based on the concept of the semigroup to understand the fermion sign problem. By using properties of contraction semigroups, we obtain sufficient conditions for quantum lattice fermion models to be sign-problem-free.…
Quasi-Monte Carlo algorithms are studied for designing discrete approximations of two-stage linear stochastic programs. Their integrands are piecewise linear, but neither smooth nor lie in the function spaces considered for QMC error…
We consider the problem of recovering low-rank matrices from random rank-one measurements, which spans numerous applications including covariance sketching, phase retrieval, quantum state tomography, and learning shallow polynomial neural…
We prove upper bounds on the order of convergence of lattice based algorithms for numerical integration in function spaces of dominating mixed smoothness on the unit cube with homogeneous boundary condition. More precisely, we study…
We discuss a Monte Carlo Markov Chain (MCMC) procedure for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We show that an approach inspired by optimal transport allows us to bound…
We provide an extension to lattice systems of the reptation quantum Monte Carlo algorithm, originally devised for continuous Hamiltonians. For systems affected by the sign problem, a method to systematically improve upon the so-called…
We explore a self-learning Markov chain Monte Carlo method based on the Adversarial Non-linear Independent Components Estimation Monte Carlo, which utilizes generative models and artificial neural networks. We apply this method to the…
Machine learning algorithms thrive on large data sets of good quality. Here we show that they can also excel in a typical research setting with little data of limited quality, through an interplay of insights coming from machine, and human…
In this work we introduce a worldline based fermion Monte Carlo algorithm for studying few body quantum mechanics of self-interacting fermions in the Hamiltonian lattice formulation. Our motivation to construct the method comes from our…
In this paper, we examine a compact $U(1)$ lattice gauge theory in $(2+1)$ dimensions and present a strategy for studying the running coupling and extracting the non-perturbative $\Lambda$-parameter. To this end, we combine Monte Carlo…
In this paper, we propose new classes of trapdoor functions to solve the closest vector problem in lattices. Specifically, we construct lattices based on properties of polynomials for which the closest vector problem is hard to solve unless…
We investigate quasi-Monte Carlo (QMC) integration over the $s$-dimensional unit cube based on rank-1 lattice point sets in weighted non-periodic Sobolev spaces $\mathcal{H}(K_{\alpha,\boldsymbol{\gamma},s}^{\mathrm{sob}})$ and their…
We extend approximate next-to-next-to-leading order results for top-pair production to include the semi-leptonic decays of top quarks in the narrow-width approximation. The new hard-scattering kernels are implemented in a fully differential…
Standard Regge Calculus provides an interesting method to explore quantum gravity in a non-perturbative fashion but turns out to be a CPU-time demanding enterprise. One therefore seeks for suitable approximations which retain most of its…
If Gamma is a nonuniform, irreducible lattice in a semisimple Lie group whose real rank is greater than 1, we show Gamma contains a subgroup that is isomorphic to a nonuniform, irreducible lattice in either SL(3,R), SL(3,C), or a direct…
The problem of approximating a matrix by a low-rank one has been extensively studied. This problem assumes, however, that the whole matrix has a low-rank structure. This assumption is often false for real-world matrices. We consider the…
We present an algorithm for the exact computer-aided construction of the Voronoi cells of lattices with known symmetry group. Our algorithm scales better than linearly with the total number of faces and is applicable to dimensions beyond…