Related papers: Efficient continuous-time quantum Monte Carlo algo…
We present an exact version of the local bosonic algorithm for the simulation of dynamical quarks in lattice QCD. This version is based on a non-hermitian polynomial approximation of the inverse of the quark matrix. A Metropolis test…
An extension of the synchronous parallel kinetic Monte Carlo (pkMC) algorithm developed by Martinez {\it et al} [{\it J.\ Comp.\ Phys.} {\bf 227} (2008) 3804] to discrete lattices is presented. The method solves the master equation…
Using trial wavefunctions prepared on quantum devices to reduce the bias of auxiliary-field quantum Monte Carlo (QC-AFQMC) has established itself as a promising hybrid approach to the simulation of strongly correlated many body systems.…
We discuss finite temperature quantum Monte Carlo methods in the framework of the interacting nuclear shell model. The methods are based on a representation of the imaginary-time many-body propagator as a superposition of one-body…
We present a polynomial Hybrid Monte Carlo (PHMC) algorithm as an exact simulation algorithm with dynamical Kogut-Susskind fermions. The algorithm uses a Hermitian polynomial approximation for the fractional power of the KS fermion matrix.…
We present clear numerical evidence for the coexistence of metallic and insulating dynamical mean field theory(DMFT) solutions in a half-filled single-band Hubbard model with bare semicircular density of states at finite temperatures.…
Monte Carlo simulations applied to the lattice formulation of quantum chromodynamics (QCD) enable a study of the theory from first principles, in a nonperturbative way. After over two decades of developments in the methodology for this…
We study signal processing tasks in which the signal is mapped via some generalized time-frequency transform to a higher dimensional time-frequency space, processed there, and synthesized to an output signal. We show how to approximate such…
The standard kinetic Monte Carlo algorithm is an extremely efficient method to carry out serial simulations of dynamical processes such as thin-film growth. However, in some cases it is necessary to study systems over extended time and…
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…
We introduce a new algorithm which we call the {Rational Hybrid Monte Carlo} Algorithm (RHMC). This method uses a rational approximation to the fermionic kernel together with a noisy Kennedy-Kuti acceptance step to give an efficient…
By precisely writing down the matrix element of the local Boltzmann operator, we have proposed a new path integral formulation for quantum field theory and developed a corresponding Monte Carlo algorithm. With current formula, the…
We propose Kernel Hamiltonian Monte Carlo (KMC), a gradient-free adaptive MCMC algorithm based on Hamiltonian Monte Carlo (HMC). On target densities where classical HMC is not an option due to intractable gradients, KMC adaptively learns…
Recent advances in automated algebra for dilute Fermi gases in the virial expansion, where coarse temporal lattices were found advantageous, motivate the study of more general computational schemes that could be applied to arbitrary…
When performing a Monte Carlo calculation, the running time should in principle be much longer than the autocorrelation time in order to get reliable results. Among different lattice fermion models, the Holstein model is notorious for its…
Computing accurate yet efficient approximations to the solutions of the electronic Schr\"odinger equation has been a paramount challenge of computational chemistry for decades. Quantum Monte Carlo methods are a promising avenue of…
We present an exact local bosonic algorithm for the simulation of dynamical fermions in lattice QCD. We show that this algorithm is a viable alternative to the Hybrid Monte Carlo algorithm.
We assess numerical stabilization methods employed in fermion many-body quantum Monte Carlo simulations. In particular, we empirically compare various matrix decomposition and inversion schemes to gain control over numerical instabilities…
We propose a quantum Monte Carlo algorithm capable of simulating the Bose-Hubbard model on arbitrary graphs, obviating the need for devising lattice-specific updates for different input graphs. We show that with our method, which is based…
The behavior of a Lattice Monte Carlo algorithm (if it is designed correctly) must approach that of the continuum system that it is designed to simulate as the time step and the mesh step tend to zero. However, we show for an algorithm for…