Related papers: Cluster algorithms for general-S quantum spin syst…
Within a general cluster framework, we discuss the loop-algorithm, a new type of cluster algorithm that reduces critical slowing down in vertex models and in quantum spin systems. We cover the example of the 6-vertex model in detail. For…
We develop a generalized pseudo-fermion functional renormalization group (PFFRG) approach that can be applied to arbitrary Heisenberg models with spins ranging from the quantum case $S=1/2$ to the classical limit $S\rightarrow\infty$.…
We consider a quantum many-body system made of $N$ interacting $S{=}1/2$ spins on a lattice, and develop a formalism which allows to extract, out of conventional magnetic observables, the quantum probabilities for any selected spin pair to…
We propose a generalization of the linked-cluster expansions to study driven-dissipative quantum lattice models, directly accessing the thermodynamic limit of the system. Our method leads to the evaluation of the desired extensive property…
We establish a polynomial-time approximation algorithm for partition functions of quantum spin models at high temperature. Our algorithm is based on the quantum cluster expansion of Neto\v{c}n\'y and Redig and the cluster expansion approach…
State-of-the-art algorithms for simulating fermions coupled to gauge fields often rely on integrating fermion degrees of freedom. While successful in simulating QCD at zero chemical potential, at finite density these approaches are hindered…
Spin squeezing plays a crucial role in quantum metrology and quantum information science. Its generation is the prerequisite for further applications but still faces an enormous challenge since the existing physical systems rarely contain…
An efficient and intuitive framework for universal quantum computation is presented that uses pairs of spin-1/2 particles to form logical qubits and a single physical interaction, Heisenberg exchange, to produce all gate operations. Only…
We establish efficient algorithms for weakly-interacting quantum spin systems at arbitrary temperature. In particular, we obtain a fully polynomial-time approximation scheme for the partition function and an efficient approximate sampling…
Simulating quantum circuits (QC) on high-performance computing (HPC) systems has become an essential method to benchmark algorithms and probe the potential of large-scale quantum computation despite the limitations of current quantum…
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…
A cluster algorithm is presented for the simulation of the q-state Potts models in which the number of spins is conserved in each state. The algorithm constructs Fortuin-Kasteleyn cluster configurations from spin configurations, in a way…
We consider a large quantum system with spins $\frac{1}{2}$ whose dynamics is driven entirely by measurements of the total spin of spin pairs. This gives rise to a dissipative coupling to the environment. When one averages over the…
Generalized rules for building and flipping clusters in the quantum Monte Carlo loop algorithm are presented for the XXZ-model in a uniform magnetic field along the Z-axis. As is demonstrated for the Heisenberg antiferromagnet it is…
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…
Cluster algorithms for classical and quantum spin systems are discussed. In particular, the cluster algorithm is applied to classical O(N) lattice actions containing interactions of more than two spins. The performance of the multi-cluster…
We discuss the development of cluster algorithms from the viewpoint of probability theory and not from the usual viewpoint of a particular model. By using the perspective of probability theory, we detail the nature of a cluster algorithm,…
This work presents an algorithm for calculating high temperature series expansions (HTSE) of Heisenberg spin models with spin $S=1/2$ in the thermodynamic limit. This algorithm accounts for the presence of a magnetic field. The paper begins…
Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the…
We present an optimized version of a cluster labeling algorithm previously introduced by the authors. This algorithm is well suited for large-scale Monte Carlo simulations of spin models using cluster dynamics on parallel computers with…