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:2511.06236 · Journal of Scientific Computing

Quasi-Monte Carlo Time-Splitting Methods for the Schrödinger Equation with Gaussian Random Potential

Zhizhang Wu, Zhiwen Zhang, Xiaofei Zhao

Published Oct 12, 2026• 0 citations
arXivHTMLPDF

Abstract

Abstract In this paper, we study the Schrödinger equation with a Gaussian random potential (SE-GP) and develop an efficient numerical method to approximate the expectation of physical observables. The unboundedness of Gaussian random variables poses significant difficulties in both sampling and error analysis. Under time-splitting discretizations of SE-GP, we establish the regularity of the semi-discrete solution in the random space. Then, we introduce a non-standard weighted Sobolev space with properly chosen weight functions, and obtain a randomly shifted lattice-based quasi-Monte Carlo (QMC) quadrature rule for efficient sampling. This approach leads to a QMC time-splitting (QMC-TS) scheme for solving the SE-GP. We prove that the proposed QMC-TS method achieves a dimension-independent convergence rate that is almost linear with respect to the number of QMC samples. Numerical experiments illustrate the sharpness of the error estimate.

DOI
10.1007/s10915-026-03461-y

Related papers

Monte-Carlo solution of Schrödinger’s equation

R C Grimm, R. G. Storer

Abstract With this paper Grimm and Storer introduced importance sampling to the field of quantum Monte Carlo. They had earlier used numerical quadrature for estimating the integrals required in evaluating energies in a diffusion-like path integral iteration scheme for solving the Schrödinger equation.0 This was extended to larger numbers of particles and higher dimensions with use of Monte Carlo methods. In conjunction with this they recognized they could take advantage of prior knowledge of the general form of a wavefunction to obtain more accurate estimates of the eigenvalue Eo .

Oxford University Press eBooks•Jun 18, 2007•0 citations

Quasi Monte-Carlo methods for the TDSE (Time dependent Schrödinger equation)

Gowri Suryanarayana, Dirk Nuyens, Ronald F. A. Cools

We approximate the solution for the time dependent Schrödinger equation (TDSE) in two steps. We first use a pseudo-spectral collocation method that uses samples of the functions on rank-1 lattice points. We then get a system of ordinary differential equations in time, which we solve approximately by stepping in time using the Strang splitting method.

•Nov 23, 2015•0 citations

QUASI-MONTE CARLO METHODS FOR HIGH-DIMENSIONAL INTEGRATION: THE STANDARD (WEIGHTED HILBERT SPACE) SETTING AND BEYOND

Frances Y. Kuo, Christoph Schwab, Ian H. Sloan

Abstract This paper is a contemporary review of quasi-Monte Carlo (QMC) methods, that is, equal-weight rules for the approximate evaluation of high-dimensional integrals over the unit cube [0,1] s . It first introduces the by-now standard setting of weighted Hilbert spaces of functions with square-integrable mixed first derivatives, and then indicates alternative settings, such as non-Hilbert spaces, that can sometimes be more suitable. Original contributions include the extension of the fast component-by-component (CBC) construction of lattice rules that achieve the optimal convergence order (a rate of almost 1/ N , where N is the number of points, independently of dimension) to so-called “product and order dependent” (POD) weights, as seen in some recent applications. Although the paper has a strong focus on lattice rules, the function space settings are applicable to all QMC methods. Furthermore, the error analysis and construction of lattice rules can be adapted to polynomial lattice rules from the family of digital nets.

ANZIAM Journal•Jul 1, 2011•87 citations

High-dimensional integration: The quasi-Monte Carlo way

Josef Dick, Frances Y. Kuo, Ian H. Sloan

This paper is a contemporary review of QMC (‘quasi-Monte Carlo’) methods, that is, equal-weight rules for the approximate evaluation of high-dimensional integrals over the unit cube [0,1] s , where s may be large, or even infinite. After a general introduction, the paper surveys recent developments in lattice methods, digital nets, and related themes. Among those recent developments are methods of construction of both lattices and digital nets, to yield QMC rules that have a prescribed rate of convergence for sufficiently smooth functions, and ideally also guaranteed slow growth (or no growth) of the worst-case error as s increases. A crucial role is played by parameters called ‘weights’, since a careful use of the weight parameters is needed to ensure that the worst-case errors in an appropriately weighted function space are bounded, or grow only slowly, as the dimension s increases. Important tools for the analysis are weighted function spaces, reproducing kernel Hilbert spaces, and discrepancy, all of which are discussed with an appropriate level of detail.

Acta Numerica•Apr 2, 2013•648 citations

Quasi-Monte Carlo methods for simulation

Pierre L’Ecuyer

Quasi-Monte Carlo (QMC) methods are numerical techniques for estimating large-dimensional integrals, usually over the unit hypercube. They can be applied, at least in principle, to any simulation whose aim is to estimate a mathematical expectation. This covers a very wide range of applications. In this paper, we review some of the key ideas of quasi-Monte Carlo methods from a broad perspective, with emphasis on some recent results. We visit lattice rules in different types of spaces and make the connections between these rules and digital nets, thus covering the two most widely used QMC methods.

International Conference on Machine Learning and Cybernetics•May 6, 2004•4 citations

Optimum and efficient sampling for variational quantum Monte Carlo

J. R. Trail, Ryo Maezono

Quantum mechanics for many-body systems may be reduced to the evaluation of integrals in 3N dimensions using Monte Carlo, providing the Quantum Monte Carlo ab initio methods. Here we limit ourselves to expectation values for trial wave functions, that is to variational quantum Monte Carlo. Almost all previous implementations employ samples distributed as the physical probability density of the trial wave function, and assume the central limit theorem to be valid. In this paper we provide an analysis of random error in estimation and optimization that leads naturally to new sampling strategies with improved computational and statistical properties. A rigorous lower limit to the random error is derived, and an efficient sampling strategy presented that significantly increases computational efficiency. In addition the infinite variance heavy tailed random errors of optimum parameters in conventional methods are replaced with a Normal random error, strengthening the theoretical basis of optimization. The method is applied to a number of first row systems and compared with previously published results.

arXiv:1011.4344•The Journal of Chemical Physics•Nov 4, 2010•8 citations
Abstract In this paper, we study the Schrödinger equation with a Gaussian random potential (SE-GP) and develop an efficient numerical method to approximate the expectation of physical observables. The unboundedness of Gaussian random variables poses significant difficulties in both sampling and error analysis. Under time-splitting discretizations of SE-GP, we establish the regularity of the semi-discrete solution in the random space. Then, we introduce a non-standard weighted Sobolev space with properly chosen weight functions, and obtain a randomly shifted lattice-based quasi-Monte Carlo (QMC) quadrature rule for efficient sampling. This approach leads to a QMC time-splitting (QMC-TS) scheme for solving the SE-GP. We prove that the proposed QMC-TS method achieves a dimension-independent convergence rate that is almost linear with respect to the number of QMC samples. Numerical experiments illustrate the sharpness of the error estimate.
Abstract With this paper Grimm and Storer introduced importance sampling to the field of quantum Monte Carlo. They had earlier used numerical quadrature for estimating the integrals required in evaluating energies in a diffusion-like path integral iteration scheme for solving the Schrödinger equation.0 This was extended to larger numbers of particles and higher dimensions with use of Monte Carlo methods. In conjunction with this they recognized they could take advantage of prior knowledge of the general form of a wavefunction to obtain more accurate estimates of the eigenvalue Eo .
Abstract This paper is a contemporary review of quasi-Monte Carlo (QMC) methods, that is, equal-weight rules for the approximate evaluation of high-dimensional integrals over the unit cube [0,1] s . It first introduces the by-now standard setting of weighted Hilbert spaces of functions with square-integrable mixed first derivatives, and then indicates alternative settings, such as non-Hilbert spaces, that can sometimes be more suitable. Original contributions include the extension of the fast component-by-component (CBC) construction of lattice rules that achieve the optimal convergence order (a rate of almost 1/ N , where N is the number of points, independently of dimension) to so-called “product and order dependent” (POD) weights, as seen in some recent applications. Although the paper has a strong focus on lattice rules, the function space settings are applicable to all QMC methods. Furthermore, the error analysis and construction of lattice rules can be adapted to polynomial lattice rules from the family of digital nets.
This paper is a contemporary review of QMC (‘quasi-Monte Carlo’) methods, that is, equal-weight rules for the approximate evaluation of high-dimensional integrals over the unit cube [0,1] s , where s may be large, or even infinite. After a general introduction, the paper surveys recent developments in lattice methods, digital nets, and related themes. Among those recent developments are methods of construction of both lattices and digital nets, to yield QMC rules that have a prescribed rate of convergence for sufficiently smooth functions, and ideally also guaranteed slow growth (or no growth) of the worst-case error as s increases. A crucial role is played by parameters called ‘weights’, since a careful use of the weight parameters is needed to ensure that the worst-case errors in an appropriately weighted function space are bounded, or grow only slowly, as the dimension s increases. Important tools for the analysis are weighted function spaces, reproducing kernel Hilbert spaces, and discrepancy, all of which are discussed with an appropriate level of detail.
Quasi-Monte Carlo (QMC) methods are numerical techniques for estimating large-dimensional integrals, usually over the unit hypercube. They can be applied, at least in principle, to any simulation whose aim is to estimate a mathematical expectation. This covers a very wide range of applications. In this paper, we review some of the key ideas of quasi-Monte Carlo methods from a broad perspective, with emphasis on some recent results. We visit lattice rules in different types of spaces and make the connections between these rules and digital nets, thus covering the two most widely used QMC methods.
Quantum mechanics for many-body systems may be reduced to the evaluation of integrals in 3N dimensions using Monte Carlo, providing the Quantum Monte Carlo ab initio methods. Here we limit ourselves to expectation values for trial wave functions, that is to variational quantum Monte Carlo. Almost all previous implementations employ samples distributed as the physical probability density of the trial wave function, and assume the central limit theorem to be valid. In this paper we provide an analysis of random error in estimation and optimization that leads naturally to new sampling strategies with improved computational and statistical properties. A rigorous lower limit to the random error is derived, and an efficient sampling strategy presented that significantly increases computational efficiency. In addition the infinite variance heavy tailed random errors of optimum parameters in conventional methods are replaced with a Normal random error, strengthening the theoretical basis of optimization. The method is applied to a number of first row systems and compared with previously published results.