arrow
Return

Variational optimization algorithms for uniform matrix product states

delete2018-01-25
delete183
delete
OA
AI
Z
Zauner-Stauber, V. *
L
Laurens Vanderstraeten
M
Matthew Fishman
F
Frank Verstraete
J
Jutho Haegeman
DOI:10.1103/PhysRevB.97.045145delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
We combine the density matrix renormalization group (DMRG) with matrix product state tangent space concepts to construct a variational algorithm for finding ground states of one-dimensional quantum lattices in the thermodynamic limit. A careful comparison of this variational uniform matrix product state algorithm (VUMPS) with infinite density matrix renormalization group (IDMRG) and with infinite time evolving block decimation (ITEBD) reveals substantial gains in convergence speed and precision. We also demonstrate that VUMPS works very efficiently for Hamiltonians with long-range interactions and also for the simulation of two-dimensional models on infinite cylinders. The new algorithm can be conveniently implemented as an extension of an already existing DMRG implementation.
Keywords:
RENORMALIZATION-GROUP
FORMULATION
TRANSITION
CHAIN
MODEL
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Physical Review B cover
Physical Review B
IF:
3.7
Papers:
15.4W
Citations:
41.0W

Organization

C
California Institute of Technology
Scholars:
2.9W
Papers: 2.5W
Citations: 4.9W
G
Ghent University
Scholars:
5.2W
Papers: 4.5W
Citations: 5.5W
U
University of Vienna
Scholars:
1.7W
Papers: 1.6W
Citations: 40
researcher View more organizations