相关论文: Cluster algorithms for general-S quantum spin syst…
A new approximate scheme, DSUB$m$, is described for the coupled cluster method. We then apply it to two well-studied (spin-1/2 Heisenberg antiferromagnet) spin-lattice models, namely: the $XXZ$ and the $XY$ models on the square lattice in…
Beisert et al. have identified an integrable SU(2,2) quantum spin chain which gives the one-loop anomalous dimensions of certain operators in large N QCD. We derive a set of nonlinear integral equations (NLIEs) for this model, and compute…
A major barrier in semiclassical calculations is the sheer number of terms that contribute as time increases; for classically chaotic dynamics, the proliferation is exponential. We have been able to overcome this ``exponential wall'' for…
Using results on the mass gap in the sine-Gordon model combined with the exact amplitudes in the bosonized representation of the Heisenberg spin-1/2 chain and one-loop renormalization group, we derive a quantitative expression for the gap…
We propose a general tensor network method for simulating quantum circuits. The method is massively more efficient in computing a large number of correlated bitstring amplitudes and probabilities than existing methods. As an application, we…
Here we present a quantum algorithm for clustering data based on a variational quantum circuit. The algorithm allows to classify data into many clusters, and can easily be implemented in few-qubit Noisy Intermediate-Scale Quantum (NISQ)…
We study a Hamiltonian system describing a three-spin-1/2 cluster-like interaction competing with an Ising-like anti-ferromagnetic interaction. We compute free energy, spin correlation functions and entanglement both in the ground and in…
A two-replica graphical representation and associated cluster algorithm is described that is applicable to ferromagnetic Ising systems with arbitrary fields. Critical points are associated with the percolation threshold of the graphical…
Using the quantum Monte Carlo Loop algorithm, we calculate the temperature dependence of the uniform susceptibility, the specific heat, the correlation length, the generalized staggered susceptibility and magnetization of a spin-1/2 chain…
For special coupling ratios, the one-dimensional (1D) s=1/2 Heisenberg model with antiferromagnetic nearest and next-nearest neighbor interactions has a pure dimer ground state, and the 1D s=1 Heisenberg model with antiferromagnetic…
Spin, $s$ in quantum theory can assume only half odd integer or integer values. For a given $s$, there exist $n=2s+1$ states $|s,m\rangle$, $m=s,s-1,........,-s$. A statistical assembly of particles (like a beam or target employed in…
We carry out a numerical study of the bi-partite entanglement entropy in the gapped regime of two paradigmatic quantum spin chain models: the Ising chain in an external magnetic field and the anti-ferromagnetic XXZ model. The universal…
We study the system size dependence of the singlet-triplet excitation gap in the $S=1/2$ kagome-lattice Heisenberg antiferromagnet by numerical diagonalization. We successfully obtain a new result of a cluster of 42 sites. The two sequences…
Simulating quantum systems using classical computing equipment has been a significant research focus. This work demonstrates that circuits as large and complex as the random circuit sampling (RCS) circuits published as a part of Google's…
The antiferromagnetic Heisenberg chain is expected to have an extended symmetry, [SU(2)xSU(2)]/Z 2 , in the infrared limit, whose physical interpretation is that the spin and dimer order parameters form the components of a common…
We derive the exact dual representation of the bosonic Hubbard model which takes the form of conserved current loops. The hardcore limit, which corresponds to the quantum spin-${1\over 2}$ Heisenberg antiferromagnet, is also obtained. In…
Quantum-chemical calculations aimed at deriving magnetic coupling constants in exchange-coupled spin clusters commonly utilize a broken-symmetry (BS) approach. This involves calculating several distinct collinear spin configurations,…
We establish an efficient approximation algorithm for the partition functions of a class of quantum spin systems at low temperature, which can be viewed as stable quantum perturbations of classical spin systems. Our algorithm is based on…
We study the computational complexity of approximately computing the partition function of a spin system. Techniques based on standard counting-to-sampling reductions yield $\tilde{O}(n^2)$-time algorithms, where $n$ is the size of the…
The recent solution to the fermion sign problem allows, for the first time, the use of cluster algorithm techniques to compute certain fermionic path integrals. To illustrate the underlying ideas behind the progress, a cluster algorithm is…