Related papers: Monte Carlo Algorithms For Reduced Lattices, Mixed…
We construct exact duality transformations in pure SU(N) Hamiltonian lattice gauge theory in (2+1) dimension. This duality is obtained by making a series of iterative canonical transformations on the SU(N) electric vector fields and their…
We present a new approach to sample from generic binary distributions, based on an exact Hamiltonian Monte Carlo algorithm applied to a piecewise continuous augmentation of the binary distribution of interest. An extension of this idea to…
Using Standard Euclidean Monte Carlo techniques, we discuss in detail the extraction of the glueball masses of 4-dimensional SU(3) lattice gauge theory in the Hamiltonian limit, where the temporal lattice spacing is zero. By taking into…
An overview is given over the recently developed and now widely used Monte Carlo algorithms with reduced or eliminated critical slowing down. The basic techniques are overrelaxation, cluster algorithms and multigrid methods. With these…
We review a recent approach for the simulation of many-body interacting systems based on an efficient generalization of the Lanczos method for Quantum Monte Carlo simulations. This technique allows to perform systematic corrections to a…
We present a simulation algorithm for Hamiltonian fermion lattice models. A guiding trial wave function is adaptively optimized during Monte Carlo evolution. We apply the method to the two dimensional Gross-Neveu model and analyze systematc…
We propose improved versions of the standard diffusion Monte Carlo (DMC) and the lattice regularized diffusion Monte Carlo (LRDMC) algorithms. For the DMC method, we refine a scheme recently devised to treat non-local pseudopotential in a…
Fixed point lattice actions are designed to have continuum classical properties unaffected by discretization effects and reduced lattice artifacts at the quantum level. They provide a possible way to extract continuum physics with coarser…
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…
We introduce an efficient, scalable Monte Carlo algorithm to simulate cross-linked architectures of freely-jointed and discrete worm-like chains. Bond movement is based on the discrete tractrix construction, which effects conformational…
At fine lattice spacings, Markov chain Monte Carlo simulations of QCD and other gauge theories with or without fermions are plagued by slow modes that give rise to large autocorrelation times. This can lead to simulation runs that are…
Recent years have seen a growing interest in the thermodynamic cost of dissipative structures formed by active particles. Given the strong finite-size effects of such systems, it is essential to develop efficient numerical approaches that…
The Cooperative Motion Algorithm is an efficient lattice method to simulate dense polymer systems and is often used with two different criteria to generate a Markov chain in the configuration space. While the first method is the…
A novel family of dynamical Monte Carlo algorithms for lattice polymers is proposed. Our central idea is to simulate an extended ensemble in which the self-avoiding condition is systematically weakened. The degree of the self-overlap is…
I describe a generalization of the hybrid Monte Carlo (HMC) algorithm in which the molecular dynamics (MD) steps utilize Nambu generalized Hamiltonian dynamics. Characterized by multiple Hamiltonian functions, this formalism allows me to…
Combinatorial optimization problems are central to both practical applications and the development of optimization methods. While classical and quantum algorithms have been refined over decades, machine learning--assisted approaches are…
Variational minimization of tensor network states enables the exploration of low energy states of lattice gauge theories. However, the exact numerical evaluation of high-dimensional tensor network states remains challenging in general. In…
We present a trainable framework for efficiently generating gauge configurations, and discuss ongoing work in this direction. In particular, we consider the problem of sampling configurations from a 4D $SU(3)$ lattice gauge theory, and…
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…
In lattice QCD the calculation of disconnected quark loops from the trace of the inverse quark matrix has large noise variance. A multilevel Monte Carlo method is proposed for this problem that uses different degree polynomials on a…