网站大量收购独家精品文档,联系QQ:2885784924

Nested Cluster Algorithm for Frustrated Quantum Antiferromagnets.pdf

Nested Cluster Algorithm for Frustrated Quantum Antiferromagnets.pdf

  1. 1、本文档共5页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Nested Cluster Algorithm for Frustrated Quantum Antiferromagnets

a r X i v : 0 8 0 3 .3 5 3 8 v 1 [ c o n d - m a t .s t r - e l ] 2 5 M a r 2 0 0 8 Nested Cluster Algorithm for Frustrated Quantum Antiferromagnets M. Nyfeler, F.-J. Jiang, F. Ka?mpfer, and U.-J. Wiese Institute for Theoretical Physics, Bern University, Sidlerstrasse 5, 3012 Bern, Switzerland 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 Heisenberg antiferromagnet on a kagome? and on a frustrated square lattice, a nested cluster algorithm eliminates the sign problem for large systems. The method is applicable to general lattice geometries but limited to moderate temperatures. PACS numbers: 75.10Jm, 75.40Mg, 75.50.Ee Monte Carlo calculations are a powerful tool for first principles investigations of strongly coupled quantum systems. Early simulations of quantum spin systems were performed with local Metropolis-type algorithms [1]. They suffered from critical slowing down and were thus limited to rather high temperatures. Cluster al- gorithms perform non-local updates and are capable of substantially reducing critical slowing down. Such al- gorithms were first developed by Swendsen and Wang for discrete classical Ising and Potts spins [2] and then generalized by Wolff [3] to classical spins with a con- tinuous O(N) symmetry. Improved estimators which average over an exponentially large number of configu- rations at polynomial cost are an additional benefit of cluster algorithms. The first cluster algorithm for the spin 12 quantum Heisenberg model was developed in [4]. While that algorithm works efficiently only for quantum spin chains, the loop-cluster algorithm [5] is efficient also in higher dimensions, and was first applied to the 2-d spin 12 Heisenberg antiferromagnet on a square lattice in [6]. The continuous-time variant of the algorithm elim- inates the Suzuki-

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档