Related papers: Embedding Z(3) in SU(3)
We investigate the critical properties of the spin-3/2 Blume-Capel model in two dimensions on a random lattice with quenched connectivity disorder. The disordered system is simulated by applying the cluster hybrid Monte Carlo update…
Efficient discretisations of gauge groups are crucial with the long term perspective of using tensor networks or quantum computers for lattice gauge theory simulations. For any Lie group other than U$(1)$, however, there is no class of…
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…
We present an algorithm for Monte Carlo simulations of a nearest-neighbor spin ice model based on its cluster representation. To assess its performance, we estimate a relaxation time, and find that, in contrast to the Metropolis algorithm,…
The triangular lattice model with nearest-neighbor attraction and third-neighbor repulsion, introduced in [J. Pekalski, A. Ciach and N. G. Almarza, arXiv:1401.0801 [cond-mat.soft]] is studied by Monte Carlo simulation. Introduction of…
It is shown how to adapt the non-perturbative coupled cluster method of many-body theory so that it may be successfully applied to Hamiltonian lattice $SU(N)$ gauge theories. The procedure involves first writing the wavefunctions for the…
Two cluster algorithms, based on constructing and flipping loops, are presented for worldline quantum Monte Carlo simulations of fermions and are tested on the one-dimensional repulsive Hubbard model. We call these algorithms the loop-flip…
In this paper we present a dynamical Monte Carlo algorithm which is applicable to systems satisfying a clustering condition: during the dynamical evolution the system is mostly trapped in deep local minima (as happens in glasses, pinning…
State-of-the-art algorithms for simulating fermions coupled to gauge fields often rely on integrating fermion degrees of freedom. While successful in simulating QCD at zero chemical potential, at finite density these approaches are hindered…
The deconfinement transition is studied close to the continuum limit of SO(3) lattice gauge theory. High barriers for tunnelling among different twist sectors causing loss of ergodicity for local update algorithms are circumvented by means…
A versatile and numerically inexpensive method is presented allowing the accurate calculation of phase diagrams for bosonic lattice models. By treating clusters within the Gutzwiller theory, a surprisingly good description of quantum…
We present a new Monte Carlo algorithm for studying site or bond percolation on any lattice. The algorithm allows us to calculate quantities such as the cluster size distribution or spanning probability over the entire range of site or bond…
In this paper, we present a cluster algorithm for the numerical simulations of non-additive hard-core mixtures. This algorithm allows one to simulate and equilibrate systems with a number of particles two orders of magnitude larger than…
We present the loop algorithm, a new type of cluster algorithm that we recently introduced for the F model. Using the framework of Kandel and Domany, we show how to GENERALIZE the algorithm to the arrow flip symmetric 6 vertex model. We…
We study uniform 3-star polymers with one branch tethered to an attractive surface and another branch pulled by a force away from the surface. Each branch of the 3-star lattice is modelled as a self-avoiding walk on the simple cubic lattice…
The definition and computation of the topological susceptibility in non-abelian gauge theories is complicated by the presence of non-integrable short-distance singularities. Recently, alternative representations of the susceptibility were…
We develop a direct diagrammatic Monte Carlo framework for the Renyi entanglement entropy of interacting lattice fermions. The method starts from the fermionic graded-swap representation of Z_n[A]=Tr_A\rho_A^n, which converts the entropy…
We consider the implementation of a parallel Monte Carlo code for high-performance simulations on PC clusters with MPI. We carry out tests of speedup and efficiency. The code is used for numerical simulations of pure SU(2) lattice gauge…
We develop cluster algorithms for a broad class of loop models on two-dimensional lattices, including several standard O(n) loop models at n \ge 1. We show that our algorithm has little or no critical slowing-down when 1 \le n \le 2. We use…
We present a reduced-dimension, ballistic deposition, Monte Carlo particle packing algorithm and discuss its application to the analysis of the microstructure of hard-sphere systems with broad particle size distributions. We extend our…