Related papers: Cluster algorithms for frustrated two dimensional …
An effective-field theory based on the single-spin cluster has been used to study of a diluted spin-$1/2$ Ising antiferromagnet on the Kagome lattice with nearest-neighbor interactions. We observe five plateaus in the magnetization curve of…
An introduction to the application of combinatorial optimization methods to ground state calculations of frustrated, disordered systems is given. We discuss the interface problem in the random bond Ising ferromagnet, the random field Ising…
We have developed an efficient Monte Carlo algorithm, which accelerates slow Monte Carlo dynamics in quasi-one-dimensional Ising spin systems. The loop algorithm of the quantum Monte Carlo method is applied to the classical spin models with…
Here we present a new perspective to the breakdown of ferromagnetic order in two-dimensional spin-lattice models employing the rotation of the underlying lattice. Using an Ising spin system on a square lattice as a prototype, we demonstrate…
We introduce a Generalized Loop Move (GLM) update for Monte Carlo simulations of frustrated Ising models on two-dimensional lattices with bond-sharing plaquettes. The GLM updates are designed to enhance Monte Carlo sampling efficiency when…
The worm algorithm is a versatile technique in the Markov chain Monte Carlo method for both classical and quantum systems. The algorithm substantially alleviates critical slowing down and reduces the dynamic critical exponents of various…
We report on recent results for strongly frustrated quantum $J_1$-$J_2$ antiferromagnets in dimensionality d=1,2,3 obtained by the coupled cluster method (CCM). We demonstrate that the CCM in high orders of approximation allows us to…
Monte Carlo simulation using the standard single-spin flip algorithm often fails to sample over the entire configuration space at low temperatures for frustrated spin systems. A typical example is a class of spin-ice type Ising models. In…
We have studied the anisotropic three-dimensional nearest-neighbor Ising model with competitive interactions in an uniform longitudinal magnetic field $H$. The model consists of ferromagnetic interaction $J_{x}(J_{z})$ in the $x(z)$…
Geometrically frustrated clusters of Ising spins of different shapes on a triangular lattice are studied by exact enumeration and Monte Carlo simulation. The focus is laid on the ground-state energy and residual entropy behaviors as…
We use the effective-field theory with correlations based on different cluster sizes to investigate phase diagrams of the frustrated Ising antiferromagnet on the honeycomb lattice with isotropic interactions of the strength $J_1 < 0$…
Geometrical frustration in correlated systems can give rise to a plethora of novel ordered states and intriguing phases. Here, we analyze theoretically vertex-sharing frustrated Kagome lattice of Josephson junctions and identify various…
Spin systems with frustration and disorder are notoriously difficult to study both analytically and numerically. While the simulation of ferromagnetic statistical mechanical models benefits greatly from cluster algorithms, these accelerated…
Simulating frustrated quantum magnets is among the most challenging tasks in computational physics. We apply String-Bond States, a recently introduced ansatz which combines Tensor Networks with Monte Carlo based methods, to the simulation…
We investigate a frustrated Ising spin system on the garnet lattice composed of a specific network of corner-sharing triangles. By means of Monte Carlo simulations with the heat bath algorithm, we discuss the magnetic properties at finite…
Motivated by recent experiments with a Penning ion trap quantum simulator, we perform numerically exact Stochastic Series Expansion quantum Monte Carlo simulations of long-range transverse-field Ising models on a triangular lattice for…
We present a procedure to solve the inverse Ising problem, that is to find the interactions between a set of binary variables from the measure of their equilibrium correlations. The method consists in constructing and selecting specific…
The self-organized Monte Carlo simulations of 2D Ising ferromagnet on the square lattice are performed. The essence of devised simulation method is the artificial dynamics consisting of the single-spin-flip algorithm of Metropolis…
In this paper, we present a parallel algorithm for Monte Carlo simulation of the 2D Ising Model to perform efficiently on a cluster computer using MPI. We use C++ programming language to implement the algorithm. In our algorithm, every…
We derive the improved estimators for general interactions and employ these for the continuous-time quantum Monte Carlo method. Using a worm algorithm we show how measuring higher-ordered correlators leads to an improved high-frequency…