Tangent-space methods for truncating uniform MPS
Quantum Physics
2021-02-12 v3 Statistical Mechanics
Strongly Correlated Electrons
Abstract
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.
Cite
@article{arxiv.2001.11882,
title = {Tangent-space methods for truncating uniform MPS},
author = {Bram Vanhecke and Maarten Van Damme and Jutho Haegeman and Laurens Vanderstraeten and Frank Verstraete},
journal= {arXiv preprint arXiv:2001.11882},
year = {2021}
}