相关论文: Graphical Representations and Worm Algorithms for …

We apply a worm algorithm to simulate the quantum transverse-field Ising model in a path-integral representation of which the expansion basis is taken as the spin component along the external-field direction. In such a representation, a…

An efficient algorithm is presented to simulate the O(N) loop model on the square lattice for arbitrary values of $N>0$. The scheme combines the worm algorithm with a new data structure to resolve both the problem of loop crossings and the…

We present a Markov-chain Monte Carlo algorithm of "worm"type that correctly simulates the O(n) loop model on any (finite and connected) bipartite cubic graph, for any real n>0, and any edge weight, including the fully-packed limit of…

We study a class of loop models, parameterized by a continuously varying loop fugacity n, on the hydrogen-peroxide lattice, which is a three-dimensional cubic lattice of coordination number 3. For integer n > 0, these loop models provide…

We study the lattice O(2N) Gross-Neveu model with Wilson fermions in the fermion loop formulation. Employing a worm algorithm for an open fermionic string, we simulate fluctuating topological boundary conditions and use them to tune the…

The CP(N-1) model in 2D is an interesting toy model for 4D QCD as it possesses confinement, asymptotic freedom and a non-trivial vacuum structure. Due to the lower dimensionality and the absence of fermions, the computational cost for…

The classical spin $O(n)$ model is a model on a $d$-dimensional lattice in which a vector on the $(n-1)$-dimensional sphere is assigned to every lattice site and the vectors at adjacent sites interact ferromagnetically via their inner…

We pursue an analogy of the Schur-Weyl reciprocity for the spinor groups and pick up the irreducible spin representations in the tensor space $\Delta \textstyle{\bigotimes \bigotimes^k V}$. Here $\Delta$ is the fundamental representation of…

We present a graph-based deep learning framework for predicting the magnetic properties of quasi-one-dimensional Ising spin systems. The lattice geometry is encoded as a graph and processed by a graph neural network (GNN) followed by fully…

We present a novel and open-source implementation of the worm algorithm, which is an algorithm to simulate Bose-Hubbard and sign-positive spin models using a path integral representation of the partition function. The code can deal with…

Learning system dynamics directly from observations is a promising direction in machine learning due to its potential to significantly enhance our ability to understand physical systems. However, the dynamics of many real-world systems are…

Graph spanners are sparse subgraphs that faithfully preserve the distances in the original graph up to small stretch. Spanner have been studied extensively as they have a wide range of applications ranging from distance oracles, labeling…

We study the O(N) loop model on the Honeycomb lattice with real value $N \geq 1$ by means of a cluster algorithm. The formulation of the algorithm is based on the equivalence of the O(N) loop model and the low-temperature graphical…

Motivated by the prospect of quantum simulation of quantum field theories, we formulate the $O(N)$ nonlinear sigma model as a "qubit" model with an $(N+1)$-dimensional local Hilbert space at each lattice site. Using an efficient worm…

The CP(N-1) model in 2D is an interesting toy model for 4D QCD as it possesses confinement, asymptotic freedom and a non-trivial vacuum structure. Due to the lower dimensionality and the absence of fermions, the computational cost for…

An efficient O(N) cluster Monte Carlo method for Ising models with long-range interactions is presented. Our novel algorithm does not introduce any cutoff for interaction range and thus it strictly fulfills the detailed balance. The…

This is the first in a series of papers devoted to generalisations of statistical loop models. We define a lattice model of $U_q(\mathfrak{sl}_n)$ webs on the honeycomb lattice, for $n \ge 2$. It is a statistical model of closed, cubic…

A graph $G$ with $n$ vertices is called an outerstring graph if it has an intersection representation of a set of $n$ curves inside a disk such that one endpoint of every curve is attached to the boundary of the disk. Given an outerstring…

$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…

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…