截断一致MPS的切空间方法
Tangent-space methods for truncating uniform MPS
摘要：
在量子张量网络模拟中，一个中心的基本问题是用一个较低的键维来近似矩阵乘积态。这个问题形成了时间演化和压缩投影纠缠对态算法的中心瓶颈。我们制定了一个切空间为基础的变分算法，以实现这一统一（无限）矩阵产品状态。该算法表现出一个有利的缩放的计算成本，我们证明了它的有用性的几个例子，涉及乘法的矩阵产品状态与矩阵产品运营商。
英文摘要：
A central primitive in quantum tensor network simulations is the problem of approximating a matrix product state with one of a lower bond dimension. This problem forms the central bottleneck in algorithms for time evolution and for contracting projected entangled pair states. We formulate a tangent-space based variational algorithm to achieve this for uniform (infinite) matrix product states. The algorithm exhibits a favourable scaling of the computational cost, and we demonstrate its usefulness by several examples involving the multiplication of a matrix product state with a matrix product operator.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
