相关论文: Cluster algorithms for general-S quantum spin syst…

We present a numerical study using a cluster algorithm for the 1-d $S=1/2$ quantum Heisenberg models. The dynamical critical exponent for anti-ferromagnetic chains is $z=0.0(1)$ such that critical slowing down is eliminated.

Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…

Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…

We begin with a review of the antiferromagnetic spin 1/2 Heisenberg chain. In particular, we show that the model has particle-like excitations with spin 1/2, and we compute the exact bulk S matrix. We then review our recent work which…

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…

We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…

We present a universal quantum Monte Carlo algorithm for simulating arbitrary high-spin (spin greater than 1/2) Hamiltonians, based on the recently developed permutation matrix representation (PMR) framework. Our approach extends a…

We generalize the Fortuin-Kasteleyn (FK) cluster representation of the partition function of the Ising model to represent the partition function of quantum spin models with an arbitrary spin magnitude in arbitrary dimensions. This…

We establish a general framework for developing approximation algorithms for a class of counting problems. Our framework is based on the cluster expansion of abstract polymer models formalism of Koteck\'y and Preiss. We apply our framework…

A cluster of spins $1/2$ of a finite size can be regarded as a basic building block of a spin texture in high-temperature cuprate superconductors. If this texture has the character of a network of weakly coupled spin clusters, then spin…

We present a new high-order coupled cluster method (CCM) formalism for the ground states of lattice quantum spin systems for general spin quantum number, $s$. This new ``general-$s$'' formalism is found to be highly suitable for a…

We show that a wide range of spin clusters with antiferromagnetic intracluster exchange interaction allows one to define a qubit. For these spin cluster qubits, initialization, quantum gate operation, and readout are possible using the same…

Simulations of frustrated quantum antiferromagnets suffer from a severe sign problem. We solve the ergodicity problem of the loop-cluster algorithm in a natural way and apply a powerful strategy to address the sign problem. For the spin 1/2…

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…

Assemblies of interacting quantum particles often surprise us with properties that are difficult to predict. One of the simplest quantum many-body systems is the spin 1/2 Heisenberg antiferromagnetic chain, a linear array of interacting…

Numerical methods in spin-foam models have significantly advanced in the last few years, yet challenges remain in efficiently extracting results for amplitudes with many quantum degrees of freedom. In this paper we sketch a proposal for a…

We present cluster Monte Carlo algorithms for the $XYZ$ quantum spin models. In the special case of $S=1/2$, the new algorithm can be viewed as a cluster algorithm for the 8-vertex model. As an example, we study the $S=1/2$ $XY$ model in…

A model for quantum tunnelling of a cluster comprising A identical particles, coupled by oscillator-type potential, through short-range repulsive potential barriers is introduced for the first time in the new symmetrized-coordinate…

We evaluate the misclustering probability of a spectral clustering algorithm under a Gaussian mixture model with a general covariance structure. The algorithm partitions the data into two groups based on the sign of the first principal…

A spin system is a framework in which the vertices of a graph are assigned spins from a finite set. The interactions between neighbouring spins give rise to weights, so a spin assignment can also be viewed as a weighted graph homomorphism.…