Related papers: A Batch Power Iteration Approach for the Iterative…
We propose nested sequential Monte Carlo (NSMC), a methodology to sample from sequences of probability distributions, even where the random variables are high-dimensional. NSMC generalises the SMC framework by requiring only approximate,…
Neural-network quantum states (NQS) offer a versatile and expressive alternative to traditional variational ans\"atze for simulating physical systems. Energy-based frameworks, like Hopfield networks and Restricted Boltzmann Machines,…
This paper is devoted to studying the global and finite convergence of the semi-smooth Newton method for solving a piecewise linear system that arises in cone-constrained quadratic programming problems and absolute value equations. We first…
Quantum Monte Carlo (QMC) methods can very accurately compute ground state properties of quantum systems. We applied these methods to a system of boson hard spheres to get exact, infinite system size results for the ground state at several…
Implicit Monte Carlo (IMC) and Discrete Diffusion Monte Carlo (DDMC) are methods used to stochastically solve the radiative transport and diffusion equations, respectively. These methods combine into a hybrid transport-diffusion method we…
A massively parallel kinetic Monte Carlo (kMC) approach is proposed for simulating ionic migration in a crystal system by introducing the atomic fragmentation scheme (fragment kMC). The fragment kMC method achieved a reasonable parallel…
Random samples of quantum states with specific properties are useful for various applications, such as Monte Carlo integration over the state space. In the high-dimensional situations that one encounters already for a few qubits, the…
Monte Carlo criticality simulations are widely used in nuclear safety demonstrations, as they offer an arbitrarily precise estimation of global and local tallies while making very few assumptions. However, since the inception of such…
Monte Carlo (MC) and Quasi-Monte Carlo (QMC) methods are classical approaches for the numerical integration of functions $f$ over $[0,1]^d$. While QMC methods can achieve faster convergence rates than MC in moderate dimensions, their…
The Random Batch Method (RBM) proposed in [Jin et al. J Comput Phys, 2020] is an efficient algorithm for simulating interacting particle systems (IPS). In this paper, we investigate the Random Batch Method with replacement (RBM-r), which is…
We study the application of a quasi-Monte Carlo (QMC) method to a class of semi-linear parabolic reaction-diffusion partial differential equations used to model tumor growth. Mathematical models of tumor growth are largely phenomenological…
In this study, we propose quantum annealing-enhanced Markov Chain Monte Carlo (QAEMCMC), where QA is integrated into the MCMC subroutine. QA efficiently explores low-energy configurations and overcomes local minima, enabling the generation…
Variational Monte Carlo (VMC) methods are used to sample classically from distributions corresponding to quantum states which have an efficient classical description. VMC methods are based on performing a number of steps of a Markov chain…
The task of Monte Carlo simulation of the evolution of the parton distributions in QCD and of constructing new parton shower Monte Carlo algorithms requires new way of organizing solutions of the QCD evolution equations, in which…
When approximating the expectations of a functional of a solution to a stochastic differential equation, the numerical performance of deterministic quadrature methods, such as sparse grid quadrature and quasi-Monte Carlo (QMC) methods, may…
Current and imminent quantum hardware lacks reliability and applicability due to noise and limited qubit counts. Quantum circuit cutting -- a technique dividing large quantum circuits into smaller subcircuits with sizes appropriate for the…
Value function based reinforcement learning (RL) algorithms, for example, $Q$-learning, learn optimal policies from datasets of actions, rewards, and state transitions. However, when the underlying state transition dynamics are stochastic…
Maximum simulated likelihood estimation of mixed multinomial logit (MMNL) or probit models requires evaluation of a multidimensional integral. Quasi-Monte Carlo (QMC) methods such as shuffled and scrambled Halton sequences and modified…
The random numbers driving Markov chain Monte Carlo (MCMC) simulation are usually modeled as independent U(0,1) random variables. Tribble [Markov chain Monte Carlo algorithms using completely uniformly distributed driving sequences (2007)…
We have reformulated the quantum Monte Carlo (QMC) technique so that a large part of the calculation scales linearly with the number of atoms. The reformulation is related to a recent alternative proposal for achieving linear-scaling QMC,…