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.

中文翻译：

---

截断均匀MPS的切线空间方法

量子张量网络模拟中的一个中心原语是用较低键维之一近似矩阵乘积状态的问题。这个问题形成了时间演化算法和收缩投影纠缠对状态算法的中心瓶颈。我们制定了基于切线空间的变分算法，以实现均匀（无限）矩阵乘积状态的变分算法。该算法展现了计算成本的良好缩放比例，并且我们通过涉及矩阵乘积状态与矩阵乘积算子相乘的几个示例来证明其有效性。