Devakul Trithep, Khemani Vedika, Pollmann Frank, Huse David A, Sondhi S L
Department of Physics, Princeton University, Princeton, NJ 08544, USA
Department of Physics, Harvard University, Cambridge, MA 02138, USA.
Philos Trans A Math Phys Eng Sci. 2017 Dec 13;375(2108). doi: 10.1098/rsta.2016.0431.
We benchmark a variant of the recently introduced density matrix renormalization group (DMRG)-X algorithm against exact results for the localized random field XX chain. We find that the eigenstates obtained via DMRG-X exhibit a highly accurate l-bit description for system sizes much bigger than the direct, many-body, exact diagonalization in the spin variables is able to access. We take advantage of the underlying free fermion description of the XX model to accurately test the strengths and limitations of this algorithm for large system sizes. We discuss the theoretical constraints on the performance of the algorithm from the entanglement properties of the eigenstates, and its actual performance at different values of disorder. A small but significant improvement to the algorithm is also presented, which helps significantly with convergence. We find that, at high entanglement, DMRG-X shows a bias towards eigenstates with low entanglement, but can be improved with increased bond dimension. This result suggests that one must be careful when applying the algorithm for interacting many-body localized spin models near a transition.This article is part of the themed issue 'Breakdown of ergodicity in quantum systems: from solids to synthetic matter'.
我们将最近引入的密度矩阵重整化群(DMRG)-X算法的一个变体与局域随机场XX链的精确结果进行基准测试。我们发现,通过DMRG-X获得的本征态对于比自旋变量中的直接多体精确对角化所能处理的大得多的系统尺寸,展现出高度精确的l比特描述。我们利用XX模型的基础自由费米子描述,来准确测试该算法在大系统尺寸下的优势和局限性。我们从本征态的纠缠特性讨论了算法性能的理论约束,以及它在不同无序值下的实际性能。还提出了对该算法的一个虽小但显著的改进,这对收敛有很大帮助。我们发现,在高纠缠情况下,DMRG-X表现出偏向低纠缠本征态的倾向,但可以通过增加键维度来改进。这一结果表明,在将该算法应用于接近转变点的相互作用多体局域自旋模型时必须谨慎。本文是主题为“量子系统中遍历性的崩溃:从固体到合成物质”特刊的一部分。