Multigrid Algorithms for Tensor Network States
arXiv:1203.6363 · doi:10.1103/PhysRevLett.109.020604
Abstract
The widely used density matrix renormalization group (DRMG) method often fails to converge in systems with multiple length scales, such as lattice discretizations of continuum models and dilute or weakly doped lattice models. The local optimization employed by DMRG to optimize the wave function is ineffective in updating large-scale features. Here we present a multigrid algorithm that solves these convergence problems by optimizing the wave function at different spatial resolutions. We demonstrate its effectiveness by simulating bosons in continuous space, and study non-adiabaticity when ramping up the amplitude of an optical lattice. The algorithm can be generalized to tensor network methods, and be combined with the contractor renormalization group (CORE) method to study dilute and weakly doped lattice models.
5 pages, 7 figures. Accepted for publication in PRL
References in corpus (8)
- The density-matrix renormalization group in the age of matrix product states
- Real time evolution using the density matrix renormalization group
- Matrix Product Density Operators: Simulation of finite-T and dissipative systems
- A class of quantum many-body states that can be efficiently simulated
- Matrix product states represent ground states faithfully
- Classical simulation of infinite-size quantum lattice systems in two spatial dimensions
- Entropy scaling and simulability by Matrix Product States
- Continuous Matrix Product States for Quantum Fields