This project investigates the applicability of quasi-Monte Carlo methods to Euclidean lattice systems in order to improve the asymptotic error scaling of observables for such theories. The error of an observable calculated by averaging over random observations generated from ordinary Monte Carlo simulations scales like
N−1/2, where
N is the number of observations. By means of quasi-Monte Carlo methods it is possible to improve this scaling for certain problems to
N−1, or even further if the problems are regular enough. We adapted and applied this approach to simple systems like the quantum harmonic and anharmonic oscillator and verified an improved error scaling of all investigated observables in both cases.
We examine three different quantum Monte Carlo methods for studying systems of interacting particles. The determinantal quantum Monte Carlo method is compared to two different worldline simulations. The first worldline method consists of a simulation carried out in the real-space basis, while the second method is implemented using as basis the eigenstates of the Hamiltonian on blocks of the two-dimensional lattice. We look, in particular, at the Hubbard model on a 4\ifmmode\times\else\texttimes\fi{}4 lattice with periodic boundary conditions. The block method is superior to the real-space method in terms of the computational cost of the simulation, but shows a much worse negative sign problem. For larger values of U and away from half-filling it is found that the real-space method can provide results at lower temperatures than the determinantal method. We show that the sign problem in the block method can be slightly improved by an appropriate choice of basis.
Recently, quasi-Monte Carlo methods have been successfully used for approximating multiple integrals in hundreds of dimensions in mathematical finance, and were significantly more efficient than Monte Carlo methods. To understand the apparent success of quasi-Monte Carlo methods for multiple integration, one popular approach is to study worst-case error bounds in weighted function spaces in which the importance of the variables is moderated by some sequences of weights. Ideally, a family of quasi-Monte Carlo methods in some weighted function space should be strongly tractable. Strong tractability means that the minimal number of quadrature points n needed to reduce the initial error by a factor of ε is bounded by a polynomial in ε⁻¹ independently of the dimension d. Several recent publications show the existence of lattice rules that satisfy the strong tractability error bounds in weighted Korobov spaces of periodic integrands and weighted Sobolev spaces of non-periodic integrands. However, those results were non-constructive and thus give no clues as to how to actually construct these lattice rules. In this thesis, we focus on the construction of quasi-Monte Carlo methods that are strongly tractable. We develop and justify algorithms for the construction of lattice rules that achieve strong tractability error bounds in weighted Korobov and Sobolev spaces. The parameters characterizing these lattice rules are found ‘component-by-component’: the (d + 1)-th components are obtained by successive 1-dimensional searches, with the previous d components kept unchanged. The cost of these algorithms vary from O(nd²) to O(n³d²) operations. With currently available technology, they allow construction of rules easily with values of n up to several million and dimensions d up to several hundred.