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

周期边界条件链的一种有效密度矩阵重整化群算法

An Efficient Density Matrix Renormalization Group Algorithm for Chains with Periodic Boundary Condition

Dayasindhu Dey, Debasmita Maiti, Manoranjan Kumar

摘要:

密度矩阵重整化群(DMRG)是一维量子多体系统的一种先进的数值计算方法,但如何利用传统的DMRG计算具有周期边界条件的系统的精确结果一直是一个具有挑战性的工作。矩阵乘积状态(MPS)算法的最新发展为一维PBC系统的精确求解提供了一种新的途径。MPS算法的最有效实现可以扩展为O($p \times m^3$),其中$p$可以在4到$m^2$之间变化。在本文中,我们提出了一种新的DMRG算法,这是非常类似于传统的DMRG,并提供可比的精度MPS。新算法的计算量为O($m^3$),并且可以方便地修改传统的DMRG码。

英文摘要:

The Density Matrix Renormalization Group (DMRG) is a state-of-the-art numerical technique for a one dimensional quantum many-body system; but calculating accurate results for a system with Periodic Boundary Condition (PBC) from the conventional DMRG has been a challenging job from the inception of DMRG. The recent development of the Matrix Product State (MPS) algorithm gives a new approach to find accurate results for the one dimensional PBC system. The most efficient implementation of the MPS algorithm can scale as O($p \times m^3$), where $p$ can vary from 4 to $m^2$. In this paper, we propose a new DMRG algorithm, which is very similar to the conventional DMRG and gives comparable accuracy to that of MPS. The computation effort of the new algorithm goes as O($m^3$) and the conventional DMRG code can be easily modified for the new algorithm.

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

↑