Related papers: A Novel Multiple-Time Scale Integrator for the Hyb…
The use of APE smearing or other blocking techniques in lattice fermion actions can provide many advantages. There are many variants of these fat link actions in lattice QCD currently, such as FLIC fermions. The FLIC fermion formalism makes…
Despite their exceptional flexibility and popularity, the Monte Carlo methods often suffer from slow mixing times for challenging statistical physics problems. We present a general strategy to overcome this difficulty by adopting ideas and…
The advantages of using Multi-Step corrections for simulations of lattice gauge theories with dynamical fermions will be discussed. This technique is suited for algorithms based on the Multi-Boson representation of the dynamical fermions as…
We consider several issues related to the multidimensional integration using a network of heterogeneous computers. Based on these considerations, we develop a new general purpose scheme which can significantly reduce the time needed for…
Nested Monte Carlo is widely used for risk estimation, but its efficiency is limited by the discontinuity of the indicator function and high computational cost. This paper proposes a nested Multilevel Monte Carlo (MLMC) method combined with…
Riemannian manifold Hamiltonian Monte Carlo (RMHMC) is a powerful method of Bayesian inference that exploits underlying geometric information of the posterior distribution in order to efficiently traverse the parameter space. However, the…
Parallel tempering simulates at many quark masses simultaneously, by changing the mass during the simulation while remaining in equilibrium. The algorithm is faster than pure HMC if more than one mass is needed, and works better the smaller…
We develop the self-learning Monte Carlo (SLMC) method, a general-purpose numerical method recently introduced to simulate many-body systems, for studying interacting fermion systems. Our method uses a highly-efficient update algorithm,…
The probability of accepting a candidate move in the hybrid Monte Carlo algorithm can be increased by considering a transition to be between windows of several states at the beginning and end of the trajectory, with a state within the…
In this article we present our implementation of a Hybrid Monte Carlo algorithm for Lattice Gauge Theory using two degenerate flavours of Wilson-Dirac fermions on a Fermi GPU. We find that using registers instead of global memory speeds up…
We study aspects concerning numerical simulations of Lattice QCD with two flavors of dynamical Ginsparg-Wilson quarks with degenerate masses. A Hybrid Monte Carlo algorithm is described and the formula for the fermionic force is derived for…
The Wilson fermion determinant can be written as product of the determinants of two hermitian positive definite matrices. This formulation allows to simulate non-degenerate quark flavors by means of the hybrid Monte Carlo algorithm. A major…
We introduce a novel time-homogeneous Markov embedding of a class of time inhomogeneous Markov chains widely used in the context of Monte Carlo sampling algorithms which allows us to answer one of the most basic, yet hard, question about…
The entanglement entropy probing novel phases and phase transitions numerically via quantum Monte Carlo has made great achievements in large-scale interacting spin/boson systems. In contrast, the numerical exploration in interacting fermion…
Quantum computing is a promising way to systematically solve the longstanding computational problem, the ground state of a many-body fermion system. Many efforts have been made to realise certain forms of quantum advantage in this problem,…
Force-gradient decomposition methods are used to improve the energy preservation of symplectic schemes applied to Hamiltonian systems. If the potential is composed of different parts with strongly varying dynamics, this multirate potential…
This paper considers the problem of real-time mode scheduling in linear time-varying switched systems subject to a quadratic cost functional. The execution time of hybrid control algorithms is often prohibitive for real-time applications…
Symplectic integration algorithms have become popular in recent years in long-term orbital integrations because these algorithms enforce certain conservation laws that are intrinsic to Hamiltonian systems. For problems with large variations…
Self-learning Monte Carlo method [arXiv:1610.03137, 1611.09364] is a powerful general-purpose numerical method recently introduced to simulate many-body systems. In this work, we implement this method in the framework of determinantal…
Continuous-time determinantal algorithm is proposed for the quantum Monte Carlo simulation of the interacting fermions. The scheme does not invoke Hubbard-Stratonovich transformation. The fermionic action is divided into two parts. One of…