arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2103.01111quant-phcond-mat.str-elphysics.chem-ph
收藏

利用量子互信息研究密度矩阵重整化群中网址的排序

On the Ordering of Sites in the Density Matrix Renormalization Group using Quantum Mutual Information

Mazen Ali

摘要:

密度矩阵重整化群(DMRG)的怀特1992年仍然是一个不可分割的组成部分,许多国家的最先进的方法,有效地模拟强相关的量子系统。在量子化学中,QC-DMRG成为一个强有力的工具,用于非相对论性薛定谔方程的从头计算。QC-DMRG中的一个重要问题是所谓的排序问题-对应于产生最准确结果的电子轨道的DMRG位点的最佳排序。为此,常用的启发式方法是通过量子互信息测量的强相关轨道的分组。在这项工作中,我们展示了如何这样的量子力学可以直接关系到矩阵乘积态的纠缠熵最小化,因此,截断误差的固定键尺寸近似。建立这种联系的关键是熵的强次可加性。这为轨道排序方法提供了严格的理论依据,并提出了替代的排序标准。

英文摘要:

The density matrix renormalization group (DMRG) of White 1992 remains to this day an integral component of many state-of-the-art methods for efficiently simulating strongly correlated quantum systems. In quantum chemistry, QC-DMRG became a powerful tool for ab initio calculations with the non-relativistic Schrödinger equation. An important issue in QC-DMRG is the so-called ordering problem -- the optimal ordering of DMRG sites corresponding to electronic orbitals that produces the most accurate results. To this end, a commonly used heuristic is the grouping of strongly correlated orbitals as measured via quantum mutual information. In this work, we show how such heuristics can be directly related to minimizing the entanglement entropy of matrix product states and, consequently, to the truncation error of a fixed bond dimension approximation. Key to establishing this link is the strong subadditivity of entropy. This provides rigorous theoretical justification for the orbital ordering methods and suggests alternate ordering criteria.

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

↑