An essential primitive in quantum tensor network simulations is the problem of approximating a matrix product state with one smaller bond dimension. This forms central bottleneck algorithms for time evolution and contracting projected entangled pair states. We formulate tangent-space based variational algorithm to achieve this goal uniform (infinite) The exhibits favourable scaling computationa...

[3] P. B. Callahan, " Optimal parallel all-nearest-neighbors using the well-separated pair decomposition, " in

It is proved that if A is aregular uniform algebra on a compact Hausdorff space X in which every closed ideal is an M-ideal, then A = C(X).