arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1911.04882cond-mat.str-elhep-lathep-thquant-ph
收藏

细粒度张量网络方法

Fine-Grained Tensor Network Methods

Philipp Schmoll, Saeed S. Jahromi, Max Hörmann, Matthias Mühlhauser, K. P. Schmidt, Román Orús

摘要:

我们开发了一种策略,张量网络算法,可以非常有效地处理高连通性的格。其基本思想是对物理自由度进行细化,即,将它们分解为更基本的单元,在适当的粗粒化之后,提供原始单元。由于这个过程,具有高连通性的原始晶格通过等距变换成更简单的结构,这更容易通过通常的张量网络方法来模拟。特别是,这使得能够使用标准方案来收缩无限的2D张量网络-例如角转移矩阵重整化方案-这更多地涉及复杂的晶格结构。通过数值计算二维三角晶格和三维堆叠三角晶格上铁磁自旋1横场伊辛模型以及三角晶格上硬核和软核Bose-哈伯德模型的基态性质,证明了我们方法的有效性.我们的结果与其他技术,如微扰连续酉变换和图形投影纠缠对状态,表现出良好的协议,也提高了性能,在几个制度的基准。

英文摘要:

We develop a strategy for tensor network algorithms that allows to deal very efficiently with lattices of high connectivity. The basic idea is to fine-grain the physical degrees of freedom, i.e., decompose them into more fundamental units which, after a suitable coarse-graining, provide the original ones. Thanks to this procedure, the original lattice with high connectivity is transformed by an isometry into a simpler structure, which is easier to simulate via usual tensor network methods. In particular this enables the use of standard schemes to contract infinite 2d tensor networks - such as Corner Transfer Matrix Renormalization schemes - which are more involved on complex lattice structures. We prove the validity of our approach by numerically computing the ground-state properties of the ferromagnetic spin-1 transverse-field Ising model on the 2d triangular and 3d stacked triangular lattice, as well as of the hard-core and soft-core Bose-Hubbard models on the triangular lattice. Our results are benchmarked against those obtained with other techniques, such as perturbative continuous unitary transformations and graph projected entangled pair states, showing excellent agreement and also improved performance in several regimes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑