One-site density matrix renormalization group and alternating minimum energy algorithm
Preprint
Abstract
Given in the title are two algorithms to compute the extreme eigenstate of a high-dimensional Hermitian matrix using the tensor train (TT) / matrix product states (MPS) representation. Both methods empower the traditional alternating direction scheme with the auxiliary (e.g. gradient) information, which substantially improves the convergence in many difficult cases. Being conceptually close, these methods have different derivation, implementation, theoretical and practical properties. We emphasize the differences, and reproduce the numerical example to compare the performance of two algorithms.Keywords
All Related Versions
- Version 1, 2013-12-23, ArXiv
- Published version: , 335.
This publication has 5 references indexed in Scilit:
- On Local Convergence of Alternating Schemes for Optimization of Convex Problems in the Tensor Train FormatSIAM Journal on Numerical Analysis, 2013
- Tensor-Train DecompositionSIAM Journal on Scientific Computing, 2011
- Density matrix renormalization group algorithms with a single center sitePhysical Review B, 2005
- Density matrix formulation for quantum renormalization groupsPhysical Review Letters, 1992
- Finitely correlated states on quantum spin chainsCommunications in Mathematical Physics, 1992