Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer theses

The Infinite Size Variational Matrix Product State Algorithm

Michael L. Wall

Published Jan 1, 2015• 0 citations
Publisher
DOI
10.1007/978-3-319-14252-4_8

Related papers

Variational Algorithms: Theory

Osama M. Raisuddin, Suvranu De

Springer eBooks•Nov 14, 2025•0 citations

Variational optimization algorithms for uniform matrix product states

Valentin Zauner-Stauber, Laurens Vanderstraeten, Matthew Fishman +2 more

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.

arXiv:1701.07035•Physical review. B./Physical review. B•Jan 25, 2018•302 citations

Tangent-space methods for truncating uniform MPS

Bram Vanhecke, Maarten Van Damme, Jutho Haegeman +2 more

An essential primitive in quantum tensor network simulations is the problem of approximating a matrix product state with one of a smaller bond dimension. This problem forms the central bottleneck in algorithms for time evolution and for contracting projected entangled pair states. We formulate a tangent-space based variational algorithm to achieve this goal for uniform (infinite) matrix product states. The algorithm exhibits a favourable scaling of the computational cost, and we demonstrate its usefulness by several examples involving the multiplication of a matrix product state with a matrix product operator.

arXiv:2001.11882•SciPost Physics Core•Feb 19, 2021•26 citations

Variational method using matrix product unitary state

Hiroshi Ueda, Otsuka Yuichi, Maho Nakata

日本物理学会講演概要集•Jan 1, 2020•0 citations

Finite Temperature Matrix Product State Algorithms and Applications

Michael L. Wall

Springer theses•Jan 1, 2015•0 citations

Product Wave Function Renormalization Group: Construction from the Matrix Product Point of View

Kouji Ueda, Tomotoshi Nishino, Kouichi Okunishi +3 more

We present a construction of a matrix product state (MPS) that approximates the largest-eigenvalue eigenvector of a transfer matrix T, for the purpose of rapidly performing the infinite system density matrix renormalization group (DMRG) method applied to two-dimensional classical lattice models. We use the fact that the largest-eigenvalue eigenvector of T can be approximated by a state vector created from the upper or lower half of a finite size cluster. Decomposition of the obtained state vector into the MPS gives a way of extending the MPS, at the system size increment process in the infinite system DMRG algorithm. As a result, we successfully give the physical interpretation of the product wave function renormalization group (PWFRG) method, and obtain its appropriate initial condition.

arXiv:cond-mat/0509320•Journal of the Physical Society of Japan•Jan 15, 2006•14 citations
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.
An essential primitive in quantum tensor network simulations is the problem of approximating a matrix product state with one of a smaller bond dimension. This problem forms the central bottleneck in algorithms for time evolution and for contracting projected entangled pair states. We formulate a tangent-space based variational algorithm to achieve this goal for uniform (infinite) matrix product states. The algorithm exhibits a favourable scaling of the computational cost, and we demonstrate its usefulness by several examples involving the multiplication of a matrix product state with a matrix product operator.
We present a construction of a matrix product state (MPS) that approximates the largest-eigenvalue eigenvector of a transfer matrix T, for the purpose of rapidly performing the infinite system density matrix renormalization group (DMRG) method applied to two-dimensional classical lattice models. We use the fact that the largest-eigenvalue eigenvector of T can be approximated by a state vector created from the upper or lower half of a finite size cluster. Decomposition of the obtained state vector into the MPS gives a way of extending the MPS, at the system size increment process in the infinite system DMRG algorithm. As a result, we successfully give the physical interpretation of the product wave function renormalization group (PWFRG) method, and obtain its appropriate initial condition.