# Computational difficulty of global variations in the density matrix renormalization group.

@article{Eisert2006ComputationalDO, title={Computational difficulty of global variations in the density matrix renormalization group.}, author={Jens Eisert}, journal={Physical review letters}, year={2006}, volume={97 26}, pages={ 260501 } }

The density matrix renormalization group approach is arguably the most successful method to numerically find ground states of quantum spin chains. It amounts to iteratively locally optimizing matrix-product states, aiming at better and better approximating the true ground state. To date, both a proof of convergence to the globally best approximation and an assessment of its complexity are lacking. Here we establish a result on the computational complexity of an approximation with matrix-product… CONTINUE READING

#### Topics from this paper.

#### Paper Mentions

#### Citations

##### Publications citing this paper.

SHOWING 1-8 OF 8 CITATIONS

## Obtaining highly excited eigenstates of the localized XX chain via DMRG-X

VIEW 1 EXCERPT

CITES BACKGROUND

## A polynomial-time algorithm for the ground state of 1D gapped local Hamiltonians

VIEW 1 EXCERPT

CITES BACKGROUND

## Polynomial-time degenerate ground state approximation of gapped 1D Hamiltonians.

VIEW 1 EXCERPT

CITES METHODS

## Projector Quantum Monte Carlo Methods for Linear and Non-linear Wavefunction Ansatzes

VIEW 2 EXCERPTS

CITES BACKGROUND