Related papers: Light Front Ensemble Projector Mont Carlo
We investigate the performance of the hybrid Monte Carlo algorithm, the standard algorithm used for lattice QCD simulations involving fermions, in updating non-trivial global topological structures. We find that the hybrid Monte Carlo…
We suggest an efficient method to resolve electronic cusps in electronic structure calculations by using an effective transcorrelated Hamiltonian. This effective Hamiltonian takes a simple form for plane wave bases, containing up to…
The classical Langevin Monte Carlo method looks for samples from a target distribution by descending the samples along the gradient of the target distribution. The method enjoys a fast convergence rate. However, the numerical cost is…
Recently, a Monte Carlo approach was proposed for processing highly redundant continuous frames. In this paper we present and analyze applications of this new theory. The computational complexity of the Monte Carlo method relies on the…
We present the ground state extension of the efficient quantum Monte Carlo algorithm for lattice fermions of arXiv:1411.0683. Based on continuous-time expansion of imaginary-time projection operator, the algorithm is free of systematic…
We present an elementary and self-contained account of the analogies existing between classical diffusion and the imaginary-time evolution of quantum systems. These analogies are used to develop a new quantum simulation method which allows…
We give an introduction to the calculation of path integrals on a lattice, with the quantum harmonic oscillator as an example. In addition to providing an explicit computational setup and corresponding pseudocode, we pay particular…
A wide variety of methods have been used to compute percolation thresholds. In lattice percolation, the most powerful of these methods consists of microcanonical simulations using the union-find algorithm to efficiently determine the…
The Diffusion Monte Carlo method with constant number of walkers, also called Stochastic Reconfiguration as well as Sequential Monte Carlo, is a widely used Monte Carlo methodology for computing the ground-state energy and wave function of…
Finite temperature auxiliary field-based Quantum Monte Carlo methods, including Determinant Quantum Monte Carlo (DQMC) and Auxiliary Field Quantum Monte Carlo (AFQMC), have historically assumed pivotal roles in the investigation of the…
We provide an extension to lattice systems of the reptation quantum Monte Carlo algorithm, originally devised for continuous Hamiltonians. For systems affected by the sign problem, a method to systematically improve upon the so-called…
The transverse folding algorithm [Phys. Rev. Lett. 102, 240603] is a tensor network method to compute time-dependent local observables in out-of-equilibrium quantum spin chains that can sometimes overcome the limitations of matrix product…
We describe recent results obtained as part of the High Energy Monte Carlo Grand Challenge (HEMCGC) project concerning the behaviour of lattice QCD with light dynamical Wilson quarks. We show that it is possible to reach regions of…
The Picard-Lefschetz theory has been attracting much attention as a tool to evaluate a multi-variable integral with a complex weight, which appears in various important problems in theoretical physics. The idea is to deform the integration…
We offer a new proposal for the Monte Carlo treatment of many-fermion systems in continuous space. It is based upon Diffusion Monte Carlo with significant modifications: correlated pairs of random walkers that carry opposite signs;…
The Diffusion Monte Carlo method is devoted to the computation of electronic ground-state energies of molecules. In this paper, we focus on implementations of this method which consist in exploring the configuration space with a {\bf fixed}…
We report on a new capability added to our general relativistic radiation-magnetohydrodynamics code, Cosmos++: an implicit Monte Carlo (IMC) treatment for radiation transport. The method is based on a Fleck-type implicit discretization of…
We describe a regression-based method, generally referred to as the Least Squares Monte Carlo (LSMC) method, to speed up exposure calculations of a portfolio. We assume that the portfolio contains several exotic derivatives that are priced…
We present a new Monte Carlo algorithm for studying site or bond percolation on any lattice. The algorithm allows us to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond…
Lattice simulations are an important class of problems in crystalline solids, surface science, alloys, adsorption, absorption, separation, catalysis, to name a few. We describe a fast computational method for performing lattice…