Related papers: Stability of lattice rules and polynomial lattice …
Fault-tolerant quantum computation (FTQC) is expected to address a wide range of computational problems. To realize large-scale FTQC, it is essential to encode logical qubits using quantum error-correcting codes. High-rate concatenated…
We study equal weight numerical integration, or Quasi Monte Carlo (QMC) rules, for functions in a Sobolev space $H^s(S^d)$ with smoothness parameter $s>d/2$ defined over the unit sphere $S^d$ in $R^{d+1}$. Focusing on $N$-point sets that…
The Cooperative Motion Algorithm is an efficient lattice method to simulate dense polymer systems and is often used with two different criteria to generate a Markov chain in the configuration space. While the first method is the…
We present a new exact algorithm for estimating all elements of the quark propagator. The advantage of the method is that the exact all-to-all propagator is reproduced in a large but finite number of inversions. The efficacy of the…
We present the complete 1-loop perturbative computation of the renormalization constants and mixing coefficients of the operators that measure the first moment of deep inelastic scattering structure functions, employing the nearest neighbor…
This paper provides the theoretical foundation for the construction of lattice algorithms for multivariate $L_2$ approximation in the worst case setting, for functions in a periodic space with general weight parameters. Our construction…
Reverse Monte Carlo (RMC) is an algorithm that incorporates stochastic modification of the action as part of the process that updates the fields in a Monte Carlo simulation. Such update moves have the potential of lowering or eliminating…
We discuss an algorithm for Tchakaloff-like compression of Quasi-MonteCarlo (QMC) volume/surface integration on union of balls (multibubbles). The key tools are Davis-Wilhelmsen theorem on the so-called Tchakaloff sets for positive linear…
The effect of different move sets on the folding kinetics of the Monte Carlo simulations is analysed based on the conformation-network and the temperature-dependent folding kinetics. A new scheme of implementing Metropolis algorithm is…
This article provides an overview of some interfaces between the theory of quasi-Monte Carlo (QMC) methods and applications. We summarize three QMC theoretical settings: first order QMC methods in the unit cube $[0,1]^s$ and in…
The quantum Monte Carlo (QMC) is one of the most promising many-body electronic structure approaches. It employs stochastic techniques for solving the stationary Schr\" odinger equation and for evaluation of expectation values. The key…
In lattice field theory, the interactions of elementary particles can be computed via high-dimensional integrals. Markov-chain Monte Carlo (MCMC) methods based on importance sampling are normally efficient to solve most of these integrals.…
There is a class of statistical problems that arises in several contexts, the Lattice QCD problem of particle physics being one that has attracted the most attention. In essence, the problem boils down to the estimation of an infinite…
We analyze combined Quasi-Monte Carlo quadrature and Finite Element approximations in Bayesian estimation of solutions to countably-parametric operator equations with holomorphic dependence on the parameters as considered in [Cl.~Schillings…
The slow microstructural evolution of materials often plays a key role in determining material properties. When the unit steps of the evolution process are slow, direct simulation approaches such as molecular dynamics become prohibitive and…
In previous work (Kuo, Nuyens, Wilkes, 2023), we showed that a lattice rule with a pre-determined generating vector but random number of points can achieve the near optimal convergence of $O(n^{-\alpha-1/2+\epsilon})$, $\epsilon > 0$, for…
Large Momentum Effective Theory (LaMET) provides a general framework for computing the multi-dimensional partonic structure of the proton from first principles using lattice quantum chromodynamics (QCD). In this effective field theory…
Understanding the microscopic mechanism of coexisting long-range orders (such as lattice supersolidity) in strongly correlated systems is a subject of immense interest. We study the possible manifestations of long-range orders, including…
Higher order digital nets are special classes of point sets for quasi-Monte Carlo rules which achieve the optimal convergence rate for numerical integration of smooth functions. An explicit construction of higher order digital nets was…
The basic idea of fast Monte Carlo (MC) simulations is to perform particle-based MC simulations with the excluded-volume interactions modeled by "soft" repulsive potentials that allow particle overlapping. This gives much faster system…