Related papers: Quasi-Monte Carlo methods for lattice systems: a f…
In this paper, we study quasi-Monte Carlo (QMC) integration in weighted Sobolev spaces. In contrast to many previous results the QMC algorithms considered here are of open type, i.e., they are extensible in the number of sample points…
In order to solve quantum field theory in a non-perturbative way, Lagrangian lattice simulations have been very successful. Here we discuss a recently proposed alternative Hamiltonian lattice formulation - the Monte Carlo Hamiltonian. In…
Quantum field theories underlie all of our understanding of the fundamental forces of nature. The are relatively few first principles approaches to the study of quantum field theories [such as quantum chromodynamics (QCD) relevant to the…
This article presents a novel and practically useful link between geometric integration, low-discrepancy sampling and code coupling for Lagrangian and Eulerian Vlasov-Poisson solvers. Low-discrepancy sequences, also called quasi-random…
Quantum Monte Carlo (QMC) methods offer exact solutions for quantum many-body systems but face severe limitations in fermionic systems like atomic nuclei due to the sign problem. While sign-problem-free QMC algorithms exist and provide…
We extend the continuous-time interaction-expansion quantum Monte Carlo method with respect to measuring observables for fermion-boson lattice models. Using generating functionals, we express expectation values involving boson operators,…
We formulate a path-integral Monte Carlo algorithm for simulating lattice systems consisting of fictitious particles governed by a generalized exchange statistics. This method, initially proposed for continuum systems, introduces a…
We describe a Fourier Accelerated Hybrid Monte Carlo algorithm suitable for dynamical fermion simulations of non-gauge models. We test the algorithm in supersymmetric quantum mechanics viewed as a one-dimensional Euclidean lattice field…
We propose quantum algorithms that provide provable speedups for Markov Chain Monte Carlo (MCMC) methods commonly used for sampling from probability distributions of the form $\pi \propto e^{-f}$, where $f$ is a potential function. Our…
We consider the problem of simulating loss probabilities and conditional excesses for linear asset portfolios under the t-copula model. Although in the literature on market risk management there are papers proposing efficient variance…
Sequential Monte Carlo algorithms (also known as particle filters) are popular methods to approximate filtering (and related) distributions of state-space models. However, they converge at the slow $1/\sqrt{N}$ rate, which may be an issue…
We propose a new Monte Carlo algorithm for the numerical study of general lattice models in Hamiltonian form. The algorithm is based on an initial Ansatz for the ground state wave function depending on a set of free parameters which are…
Programmable quantum simulators based on Rydberg atom arrays are a fast-emerging quantum platform, bringing together long coherence times, high-fidelity operations, and large numbers of interacting qubits deterministically arranged in…
Lattice studies of spontaneous supersymmetry breaking suffer from a sign problem that in principle can be evaded through novel methods enabled by quantum computing. Focusing on lower-dimensional lattice systems with more modest resource…
We review a recent approach for the simulation of many-body interacting systems based on an efficient generalization of the Lanczos method for Quantum Monte Carlo simulations. This technique allows to perform systematic corrections to a…
In this paper, we extend our analysis of lattice systems using the wavelet transform to systems for which exact enumeration is impractical. For such systems, we illustrate a wavelet-accelerated Monte Carlo (WAMC) algorithm, which…
In Monte Carlo calculations of expectation values in lattice quantum field theories, the stochastic variance of the sampling procedure that is used defines the precision of the calculation for a fixed number of samples. If the variance of…
We consider the problem of improving the efficiency of randomized Fourier feature maps to accelerate training and testing speed of kernel methods on large datasets. These approximate feature maps arise as Monte Carlo approximations to…
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…
It has become increasingly feasible to use quantum Monte Carlo (QMC) methods to study correlated fermion systems for realistic Hamiltonians. We give a summary of these techniques targeted at researchers in the field of correlated electrons,…