Related papers: Implementing the Generalised Hybrid Monte-Carlo Al…

We present an exact dynamical QCD simulation algorithm for the $O(a)$-improved Wilson fermion with odd number of flavors. Our algorithm is an extension of the non-Hermitian polynomials HMC algorithm proposed by Takaishi and de Forcrand…

Hamiltonian Monte Carlo (HMC) has become routinely used for sampling from posterior distributions. Its extension Riemann manifold HMC (RMHMC) modifies the proposal kernel through distortion of local distances by a Riemannian metric. The…

Problems in lattice gauge models with fermions are discussed. A new bosonic Hermitean effective action for lattice QCD with dynamical quarks is presented. In distinction of the previous version, it does not include constraints and is better…

We extend the scope of full configuration interaction quantum Monte Carlo (FCIQMC) to be applied to coupled fermion-boson hamiltonians, alleviating the a priori truncation in boson occupation which is necessary for many other wave function…

Efficient continuous time quantum Monte Carlo (CT-QMC) algorithms that do not suffer from time discretization errors have become the state-of-the-art for most discrete quantum models. They have not been widely used yet for fermionic quantum…

We simulate Quantum Chromodynamics in four Euclidean dimensions with two (degenerate mass) flavors of dynamical quarks. The Dirac operator is the so-called chirally improved operator that has been studied so far in quenched calculations. We…

We evaluate the corrections to the matching coefficient of the vector current between Quantum Chromodynamics (QCD) and Non-Relativistic QCD (NRQCD) to three-loop order containing a closed heavy-fermion loop. The result constitutes a…

Three topics concerning fermion simulation algorithms are discussed: 1.) A performance comparison of the multiboson technique to simulate dynamical fermions and the Kramers equation algorithm, 2.) the question of reversibility in the Hybrid…

Perturbative expansions of several small Wilson loops are computed through next-to-next-to-leading order in unquenched lattice QCD, from Monte Carlo simulations at weak couplings. This approach provides a much simpler alternative to…

We study a variant of the Schwarz-preconditioned HMC algorithm. In contrast to the original proposal of L\"uscher, we apply the domain decomposition in one lattice direction only. This is sufficient to reduce the condition number of the…

In hybrid Monte Carlo evolution, by imposing a physical gauge condition, simple Fourier acceleration can be used to generate conjugate momenta and potentially reduce critical slowing down. This modified gauge evolution algorithm does not…

We compare different conjugate gradient -- like matrix inversion methods (CG, BiCGstab1 and BiCGstab2) employing for this purpose the compact lattice quantum electrodynamics (QED) with Wilson fermions. The main goals of this investigation…

We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a…

Hamiltonian Monte Carlo (HMC) is a popular Markov chain Monte Carlo (MCMC) algorithm that generates proposals for a Metropolis-Hastings algorithm by simulating the dynamics of a Hamiltonian system. However, HMC is sensitive to large time…

We propose a new algorithm which works effectively in global updates in Monte Carlo study. We apply it to the quantum spin chain with next-nearest-neighbor interactions. We observe that Monte Carlo results are in excellent agreement with…

We discuss hybrid Monte Carlo algorithms for odd-flavor lattice QCD simulations. The algorithms include a polynomial approximation which enables us to simulate odd-flavor QCD in the framework of the hybrid Monte Carlo algorithm. In order to…

We enable the automatic construction of Hybrid Monte Carlo (HMC) forces in lattice gauge theory by performing reverse-mode automatic differentiation at the level of optimized LLVM intermediate representation, making the approach applicable…

Quantum computers have a potential for solving quantum chemistry problems with higher accuracy than classical computers. Quantum computing quantum Monte Carlo (QC-QMC) is a QMC with a trial state prepared in quantum circuit, which is…

We show how the hopping parameter expansion at order $\kappa^2$ and $\kappa^4$ can be exploited in the simulation of lattice QCD with two flavours of degenerate Wilson fermions. A natural extension of this idea is a "UV-filtering" by using…

We construct efficient Monte Carlo updating algorithms for two classes of pure SU(N) lattice gauge actions with non-linear dependence on the link variables. Our construction generalises the method of auxiliary variables used by Fabricius…