Related papers: Cluster algorithms for frustrated two dimensional …
Nonreversible Markov chains can outperform reversible chains in the Markov chain Monte Carlo method. Lifting is a versatile approach to introducing net stochastic flow in state space and constructing a nonreversible Markov chain. We present…
We apply a set of machine-learning (ML) techniques for the global exploration of the phase diagrams of two frustrated 2D Ising models with competing interactions. Based on raw Monte Carlo spin configurations generated for random system…
We explore the phase diagram and the low-energy physics of three Heisenberg antiferromagnets which, like the kagome lattice, are networks of corner-sharing triangles but contain two sets of inequivalent short-distance resonance loops. We…
Frustration, or the competition between interacting components of a network, is often responsible for the complexity of many body systems, from social and neural networks to protein folding and magnetism. In quantum magnetic systems,…
The phase transition of a random mixed-bond Ising ferromagnet on a cubic lattice model is studied both numerically and analytically. In this work, we use the Cluster algorithms of Wolff and Glauber to simulate the dynamics of the system. We…
Ab-initio studies of strongly interacting bosonic and fermionic systems is greatly facilitated by efficient Monte Carlo algorithms. This article emphasizes this requirement, and outlines the ideas behind the construction of the cluster…
Monte Carlo simulations are methods for simulating statistical systems. The aim is to generate a representative ensemble of configurations to access thermodynamical quantities without the need to solve the system analytically or to perform…
Realizing compact and scalable Ising machines that are compatible with CMOS-process technology is crucial to the effectiveness and practicality of using such hardware platforms for accelerating computationally intractable problems. Besides…
Using a lattice-gas description of the low-energy degrees of freedom of the quantum Heisenberg antiferromagnet on the frustrated two-leg ladder and bilayer lattices we examine the magnetization process at low temperatures for these spin…
We simulate single and multiple Ising models coupled to 2-d gravity using both the Swendsen-Wang and Wolff algorithms to update the spins. We study the integrated autocorrelation time and find that there is considerable critical slowing…
In this work we generalize and subsequently apply the Effective Field Renormalization Group technique to the problem of ferro- and antiferromagnetically coupled Ising spins with local anisotropy axes in geometrically frustrated geometries…
We discuss the sign problem arising in Monte Carlo simulations of frustrated quantum spin systems. We show that for a class of ``semi-frustrated'' systems (Heisenberg models with ferromagnetic couplings $J_z(r) < 0$ along the $z$-axis and…
We introduce a Metropolis-Hastings Markov chain for Boltzmann distributions of classical spin systems. It relies on approximate tensor network contractions to propose correlated collective updates at each step of the evolution. We present…
We study a classical fully-frustrated honeycomb lattice Ising model using Markov chain Monte Carlo methods and exact calculations . The Hamiltonian realizes a degenerate ground state manifold of equal-energy states, where each hexagonal…
We investigate the efficiency of different quantum Monte Carlo simulations of a pair of antiferromagnetically coupled qubits in an Ohmic dissipative environment. Using a Trotter-Suzuky decomposition and integrating out the degrees of…
In recent years, a better understanding of the Monte Carlo method has provided us with many new techniques in different areas of statistical physics. Of particular interest are so called cluster methods, which exploit the considerable…
We exactly rewrite the Z(2) lattice gauge theory with standard plaquette action as a random surface model equivalent to the untruncated set of its strong coupling graphs. By extending the worm approach applied to spin models we simulate…
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…
Critical properties of the Ising model on a stacked triangular lattice, with antiferromagnetic first and second-neighbor in-plane interactions, are studied by extensive histogram Monte Carlo simulations. The results, in conjunction with the…
We study Ising antiferromagnets that have nearest-neighbour interactions on multilayer triangular lattices with frustrated ($abc$ and $abab$) stacking, and make comparisons with the unfrustrated ($aaa$) stacking. If interlayer couplings are…