Blockspin Cluster Algorithms for Quantum Spin Systems
U. -J. Wiese, H. -P. Ying
Abstract
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 maped to blockspin models with two-blockspin interactions. Clusters of blockspins are updated collectively. The efficiency of the method is investigated in detail for one-dimensional spin chains. Then in most cases the new algorithms solve the problems of slowing down from which standard algorithms are suffering.
Create a lesson
Related papers
Efficient Quantum Simulations of Yang-Mills theory with Maximal-tree Gauge
Tianyin Li, Ying-Ying Li, Xiaoyang Wang et al.
Physics-informed quantum algorithms for glueball-like excitations in a Z2 lattice gauge theory
Dan-Bo Zhang
Anomalous behavior of Wilson fermions in the presence of monopoles
Manuel Cortina, Rajamani Narayanan, Ray Romero
Direct lattice QCD calculation of the θ-induced CP-violating pion-nucleon coupling
Chuan-Yang Li, Jun Hua, Jian Liang et al.
Calculation of neutron electric dipole moment from Lattice QCD
Thomas Blum, Fangcheng He, Taku Izubuchi et al.
Exponential-in-Nc2 cost reduction of product-formula-based quantum simulations of quantum chromodynamics
Zohreh Davoudi, Jesse R. Stryker