标题： 一个针对 CP(N-1) 模型的有效聚类算法 显示英文标题

标题： An Efficient Cluster Algorithm for CP(N-1) Models

摘要： 我们为铁磁性SU(N)对称量子自旋系统构建了一个高效的聚类算法。 这类系统在D理论框架下为CP(N-1)模型提供了新的正则化方法，D理论是一种替代的非微扰量子场论方法，用离散量子变量代替经典场来表述。 尽管有过多次尝试，但在标准的格点场论表述中，针对CP(N-1)模型尚未构建出有效的聚类算法。 实际上，甚至存在一个不可能定理，阻止了Wolff型嵌入算法的高效构造。 我们展示了不同相关长度、耦合强度和格子尺寸下的各种模拟结果。 我们已经在最大尺寸为640×640的格子上模拟了高达250个格点间距的相关长度，并未观察到临界减速的迹象。 显示英文摘要

摘要： We construct an efficient cluster algorithm for ferromagnetic SU(N)-symmetric quantum spin systems. Such systems provide a new regularization for CP(N-1) models in the framework of D-theory, which is an alternative non-perturbative approach to quantum field theory formulated in terms of discrete quantum variables instead of classical fields. Despite several attempts, no efficient cluster algorithm has been constructed for CP(N-1) models in the standard formulation of lattice field theory. In fact, there is even a no-go theorem that prevents the construction of an efficient Wolff-type embedding algorithm. We present various simulations for different correlation lengths, couplings and lattice sizes. We have simulated correlation lengths up to 250 lattice spacings on lattices as large as 640x640 and we detect no evidence for critical slowing down.