Related papers: Cluster algorithms for frustrated two dimensional …
We map a geometrically frustrated Ising system with transversal field generated quantum dynamics to a strongly anisotropic lattice of non-crossing elastic strings. The combined effect of frustration, quantum and thermal spin fluctuations is…
The low-energy magnetic configurations of artificial frustrated spin chains are investigated using magnetic force microscopy and micromagnetic simulations. Contrary to most studies on two-dimensional artificial spin systems where…
Recently, Syljuasen and Sandvik proposed a new framework for constructing algorithms of quantum Monte Carlo simulation. While it includes new classes of powerful algorithms, it is not straightforward to find an efficient algorithm for a…
The interplay between geometric frustration (GF) and bond disorder is studied in the Ising kagome lattice within a cluster approach. The model considers antiferromagnetic (AF) short-range couplings and long-range intercluster disordered…
The emergence of specialized optimization hardware such as CMOS annealers and adiabatic quantum computers carries the promise of solving hard combinatorial optimization problems more efficiently in hardware. Recent work has focused on…
A prominent approach to solving combinatorial optimization problems on parallel hardware is Ising machines, i.e., hardware implementations of networks of interacting binary spin variables. Most Ising machines leverage second-order…
We prove rapid mixing of the worm process for the zero-field ferromagnetic Ising model, on all finite connected graphs, and at all temperatures. As a corollary, we obtain a fully-polynomial randomized approximation scheme for the Ising…
We use a Monte Carlo simulation to study the diluted antiferromagnetic Ising model on the frustrated lattices including the pyrochlore lattice to show the dilution effects. Using the Wang-Landau algorithm, which directly calculates the…
Frustration, that is, the impossibility of satisfying the energetic preferences between all spin pairs simultaneously, underlies the complexity of many fundamental properties in spin systems, including the computational difficulty in…
Geometric frustration effects were studied systematically with the Ising antiferromagnet on the 11 Archimedean lattices using the Monte-Carlo methods. The Wang-Landau algorithm for static properties (specific heat and residual entropy) and…
We have studied the Heisenberg antiferromagnets on two-dimensional frustrated lattices, triangular and kagome lattices using linear spin-wave theory. A collinear ground state ordering is possible if one of the three bonds in each triangular…
Ising machines (IM) are physics-inspired alternatives to von Neumann architectures for solving hard optimization tasks. By mapping binary variables to coupled Ising spins, IMs can naturally solve unconstrained combinatorial optimization…
We design an irreversible worm algorithm for the zero-field ferromagnetic Ising model by using the lifting technique. We study the dynamic critical behavior of an energy estimator on both the complete graph and toroidal grids, and compare…
Based on the scheme of variational Monte Carlo sampling, we develop an accurate and efficient two-dimensional tensor-network algorithm to simulate quantum lattice models. We find that Monte Carlo sampling shows huge advantages in dealing…
We outline how the coupled cluster method of microscopic quantum many-body theory can be utilized in practice to give highly accurate results for the ground-state properties of a wide variety of highly frustrated and strongly correlated…
We find an exact mapping from the generalized Ising models with many-spin interactions to equivalent Boltzmann machines, i.e., the models with only two-spin interactions between physical and auxiliary binary variables accompanied by local…
The study of quantum frustrated systems remains one of the most challenging subjects of quantum magnetism, as they can hold quantum spin liquids, whose characterization is quite elusive. The presence of gapped quantum spin liquids…
We present a new type of cluster algorithm that strongly reduces critical slowing down in simulations of vertex models. Since the clusters are closed paths of bonds, we call it the {\em loop algorithm}. The basic steps in constructing a…
We present the results of Monte Carlo simulations for the critical dynamics of the three-dimensional site-diluted quenched Ising model. Three different dynamics are considered, these correspond to the local update Metropolis scheme as well…
We study the critical breakdown of two-dimensional quantum magnets in the presence of algebraically decaying long-range interactions by investigating the transverse-field Ising model on the square and triangular lattice. This is achieved…