Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1302.6419 · Computer Physics Communications

Quasi-Monte Carlo methods for lattice systems: A first look

Karl Jansen, Hernan Leövey, A. Ammon, Andreas Griewank, Michael Muller-Preussker

Published Oct 24, 2013• 15 citations
arXivHTMLPDF
DOI
10.1016/j.cpc.2013.10.011

Related papers

Lattice Rules and Randomized Quasi-Monte Carlo

Pierre L’Ecuyer

Lecture notes in computer science•Jan 1, 2001•0 citations

Randomized Quasi-Monte Carlo: An Introduction for Practitioners

Pierre L’Ecuyer

We survey basic ideas and results on randomized quasi-Monte Carlo (RQMC) methods, discuss their practical aspects, and give numerical illustrations. RQMC can improve accuracy compared with standard Monte Carlo (MC) when estimating an integral interpreted as a mathematical expectation. RQMC estimators are unbiased and their variance converges at a faster rate (under certain conditions) than MC estimators, as a function of the sample size. Variants of RQMC also work for the simulation of Markov chains, for function approximation and optimization, for solving partial differential equations, etc. In this introductory survey, we look at how RQMC point sets and sequences are constructed, how we measure their uniformity, why they can work for high-dimensional integrals, and how can they work when simulating Markov chains over a large number of steps.

•Aug 14, 2016•2 citations

Applicability of Quasi-Monte Carlo for lattice systems

Andreas Ammon, Tobias Hartung, Karl Jansen +3 more

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.

arXiv:1311.4726•Nov 19, 2013•1 citation

Some current issues in quasi-Monte Carlo methods

Harald Niederreiter

Journal of Complexity•Mar 25, 2003•14 citations

Determinantal and worldline quantum Monte Carlo methods for many-body systems

Marco Vekić, Steven R. White

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.

Physical review. B, Condensed matter•Jun 15, 1993•2 citations

Recent Advances in Randomized Quasi-Monte Carlo Methods

Pierre L’Ecuyer, Christiane Lemieux

International series in management science/operations research/International series in operations research & management science•Jan 1, 2002•260 citations
We survey basic ideas and results on randomized quasi-Monte Carlo (RQMC) methods, discuss their practical aspects, and give numerical illustrations. RQMC can improve accuracy compared with standard Monte Carlo (MC) when estimating an integral interpreted as a mathematical expectation. RQMC estimators are unbiased and their variance converges at a faster rate (under certain conditions) than MC estimators, as a function of the sample size. Variants of RQMC also work for the simulation of Markov chains, for function approximation and optimization, for solving partial differential equations, etc. In this introductory survey, we look at how RQMC point sets and sequences are constructed, how we measure their uniformity, why they can work for high-dimensional integrals, and how can they work when simulating Markov chains over a large number of steps.
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/2N^{-1/2}N−1/2, where NNN is the number of observations. By means of quasi-Monte Carlo methods it is possible to improve this scaling for certain problems to N−1N^{-1}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.