When dealing with quantum many-body systems one is faced with problems growing exponentially in the number of particles to be considered. To overcome this curse of dimensionality one has to consider representation formats which scale only polynomially. Physicists developed concepts like matrix product states (MPS) to represent states of interest and formulated algorithms such as the density matrix renormalization group (DMRG) to find such states. We consider the standard Lanczos algorithm and formulate it for vectors given in the MPS format. It turns out that a restarted version which includes a projection onto the MPS manifold gives the same approximation quality as the well-established DMRG method. Moreover, this variant is more flexible and provides more information about the spectrum. (© 2012 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)
[1]
S. Rommer,et al.
CLASS OF ANSATZ WAVE FUNCTIONS FOR ONE-DIMENSIONAL SPIN SYSTEMS AND THEIR RELATION TO THE DENSITY MATRIX RENORMALIZATION GROUP
,
1997
.
[2]
White,et al.
Density matrix formulation for quantum renormalization groups.
,
1992,
Physical review letters.
[3]
Jack Poulson,et al.
Scientific computing
,
2013,
XRDS.
[4]
Ivan Oseledets,et al.
Tensor-Train Decomposition
,
2011,
SIAM J. Sci. Comput..
[5]
F. Verstraete,et al.
Matrix product density operators: simulation of finite-temperature and dissipative systems.
,
2004,
Physical review letters.