Related papers: Fast mixing of operator-loop path-integral quantum…

The directed-loop quantum Monte Carlo method is generalized to the case of retarded interactions. Using the path integral, fermion-boson or spin-boson models are mapped to actions with retarded interactions by analytically integrating out…

Markov chain Monte Carlo (MCMC) algorithms are indispensable when sampling from a complex, high-dimensional distribution by a conventional method is intractable. Even though MCMC is a powerful tool, it is also hard to control and tune in…

Muon ionization cooling involves passing particles through solid or liquid absorbers. Careful simulations are required to design muon cooling channels. New features have been developed for inclusion in the transfer map code COSY Infinity to…

We present a continuous-variable photonic quantum algorithm for the Monte Carlo evaluation of multi-dimensional integrals. Our algorithm encodes n-dimensional integration into n+3 modes and can provide a quadratic speedup in runtime…

By leveraging the natural geometry of a smooth probabilistic system, Hamiltonian Monte Carlo yields computationally efficient Markov Chain Monte Carlo estimation. At least provided that the algorithm is sufficiently well-tuned. In this…

We develop a real-time Full Configuration Interaction Quantum Monte Carlo approach for the modeling of driven-dissipative open quantum systems. The method enables stochastic sampling of the Liouville-von-Neumann time evolution of the…

We present an efficient algorithm for the inference of stochastic block models in large networks. The algorithm can be used as an optimized Markov chain Monte Carlo (MCMC) method, with a fast mixing time and a much reduced susceptibility to…

The Hybrid Monte Carlo (HMC) algorithm currently is the favorite scheme to simulate quantum chromodynamics including dynamical fermions. In this talk-which is intended for a non-expert audience--I want to bring together methodical and…

We present a Hamiltonian Monte Carlo algorithm to sample from multivariate Gaussian distributions in which the target space is constrained by linear and quadratic inequalities or products thereof. The Hamiltonian equations of motion can be…

Markov chain Monte Carlo is an inherently serial algorithm. Although likelihood calculations for individual steps can sometimes be parallelized, the serial evolution of the process is widely viewed as incompatible with parallelization,…

We present an implementation of Quantum Computing for a Markov Chain Monte Carlo method with an application to cosmological functions, to derive posterior distributions from cosmological probes. The algorithm proposes new steps in the…

Markov Chain Monte Carlo (MCMC) algorithms are often used for approximate inference inside learning, but their slow mixing can be difficult to diagnose and the approximations can seriously degrade learning. To alleviate these issues, we…

In this work, we present a quantum Markov chain algorithm for many-body systems that utilizes a special phase of matter known as the Many-Body Localized (MBL) phase. We show how the properties of the MBL phase enable one to address the…

Hamiltonian Monte Carlo (HMC) and related algorithms have become routinely used in Bayesian computation. In this article, we present a simple and provably accurate method to improve the efficiency of HMC and related algorithms with…

A novel class of non-reversible Markov chain Monte Carlo schemes relying on continuous-time piecewise-deterministic Markov Processes has recently emerged. In these algorithms, the state of the Markov process evolves according to a…

For spin rotational symmetric models with a positive-definite high-temperature expansion of the partition function, a stochastic sampling of the series expansion upon partial resummation becomes logically equivalent to sampling an…

In nuclear fusion and fission, fluctuation and dissipation arise due to the coupling of collective degrees of freedom with internal excitations. Close to the barrier, both quantum, statistical and non-Markovian effects are expected to be…

The Hamiltonian Monte Carlo (HMC) sampling algorithm exploits Hamiltonian dynamics to construct efficient Markov Chain Monte Carlo (MCMC), which has become increasingly popular in machine learning and statistics. Since HMC uses the gradient…

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…

We introduce a general Monte Carlo scheme for achieving atomistic simulations with monoelectronic Hamiltonians including the thermalization of both nuclear and electronic degrees of freedom. The kinetic Monte Carlo algorithm is used to…