Related papers: An optimised algorithm for ionized impurity scatte…
Randomized smoothing has emerged as a potent certifiable defense against adversarial attacks by employing smoothing noises from specific distributions to ensure the robustness of a smoothed classifier. However, the utilization of Monte…
We introduce Markov chain Monte Carlo (MCMC) algorithms based on numerical approximations of piecewise-deterministic Markov processes obtained with the framework of splitting schemes. We present unadjusted as well as adjusted algorithms,…
A classical Monte Carlo algorithm based on the quasi-classical approximation is applied to the pseudospin Hamiltonian of the model cuprate. The model takes into account both local and non-local correlations, Heisenberg spin-exchange…
Due to manufacturing defects or wear and tear, industrial components may have uncertainties. In order to evaluate the performance of machined components, it is crucial to quantify the uncertainty of the scattering surface. This brings up an…
Monte Carlo simulations are performed to study the in-plane transport of spin-polarized electrons in III-V semiconductor quantum wells. The density matrix description of the spin polarization is incorporated in the simulation algorithm. The…
In dynamic Monte Carlo simulations, using for example the Metropolis dynamic, it is often required to simulate for long times and to simulate large systems. We present an overview of advanced algorithms to simulate for larger times and to…
A quantum Monte Carlo method with non-local update scheme is presented. The method is based on a path-integral decomposition and a worm operator which is local in imaginary time. It generates states with a fixed number of particles and…
The physics of crystalline membranes, i.e. fixed-connectivity surfaces embedded in three dimensions and with an extrinsic curvature term, is very rich and of great theoretical interest. To understand their behavior, numerical simulations…
We present a hybrid method for time-dependent particle transport that combines Monte Carlo (MC) estimation with a deterministic discrete ordinates (\(S_N\)) solve, augmented by quasi-Monte Carlo (QMC) sampling. For spatial discretizations,…
Monte Carlo methods represent the "de facto" standard for approximating complicated integrals involving multidimensional target distributions. In order to generate random realizations from the target distribution, Monte Carlo techniques use…
Radiative transfer (RT) simulations are a powerful tool that enables the calculation of synthetic images of a wide range of astrophysical objects. These simulations are often based on the Monte Carlo (MC) method, as it provides the needed…
Strongly correlated quantum impurity problems appear in a wide variety of contexts ranging from nanoscience and surface physics to material science and the theory of strongly correlated lattice models, where they appear as auxiliary systems…
The worm algorithm is a versatile technique in the Markov chain Monte Carlo method for both classical and quantum systems. The algorithm substantially alleviates critical slowing down and reduces the dynamic critical exponents of various…
Presented here is an algorithm for a type-II quantum computer which simulates the Ising model in one and two dimensions. It is equivalent to the Metropolis Monte-Carlo method and takes advantage of quantum superposition for random number…
Time evolution and scattering simulation in phenomenological models are of great interest for testing and validating the potential for near-term quantum computers to simulate quantum field theories. Here, we simulate one-particle…
By considering the effect of varying the target radii and detector aperture width on the scattering angle in experimental Compton scattering, mathematical models were developed and subsequently incorporated into Monte Carlo simulations. By…
Monte Carlo simulations are a powerful tool to investigate the thermodynamic properties of atomic systems. In practice however, sampling of the complete configuration space is often hindered by high energy barriers between different regions…
McSAS3 is the refactored successor to the original McSAS Monte Carlo small-angle scattering analysis software. It is intended to be integrated in automated data processing pipelines, but can also be used to process individual (batches of)…
We design and implement a novel algorithm for computing a multilevel Monte Carlo (MLMC) estimator of the cumulative distribution function of a quantity of interest in problems with random input parameters or initial conditions. Our approach…
We study an optimal control problem under uncertainty, where the target function is the solution of an elliptic partial differential equation with random coefficients, steered by a control function. The robust formulation of the…