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

arXiv:0907.2796 · Advances In Physics

Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems

Frank Verstraete, V. Murg, J. I. Cirac

Published Mar 1, 2008• 1,835 citations
arXivHTMLPDF

Abstract

This article reviews recent developments in the theoretical understanding and the numerical implementation of variational renormalization group methods using matrix product states and projected entangled pair states.
DOI
10.1080/14789940801912366

Related papers

Matrix product states and projected entangled pair states: Concepts, symmetries, theorems

J. I. Cirac, David Pérez-García, Norbert Schuch +1 more

Many-body wave functions can be described effectively by local tensors in matrix product states and projected entangled pair states. This article reviews how these theories provide not only numerical methods but also insights of a more fundamental nature into the structures of states with global entanglement patterns and topological quantum order.

arXiv:2011.12127•Reviews of Modern Physics•Dec 17, 2021•1,032 citations

DENSITY MATRIX RENORMALIZATION GROUP: INTRODUCTION FROM A VARIATIONAL POINT OF VIEW

Tomotoshi Nishino, Toshiya Hikihara, Kouichi Okunishi +1 more

The density matrix renormalization group theory is reviewed as a numerical variational method. The variational state, expressed as a product of local tensors, is improved through locally tuning each tensor. The first section is a tutorial with simplified discussions. Details are discussed in the subsequent sections. The review concludes with some recent developments and future directions.

International Journal of Modern Physics B•Jan 10, 1999•27 citations

Strongly correlated systems and density matrix renormalization group in quantum chemistry

Libor Veis, Jan Brandejs, Jiří Pittner

This article is a pedagogical introduction to the density matrix renormalization group method and its application in quantum chemistry. It presents the easy-to-understand modern formulation based on matrix product states. It is written in Czech language.

arXiv:1807.06289•Jul 17, 2018•0 citations

Linearized tensor renormalization group approach for quantum many-body lattice systems

Gang Su

We review the development of numerical renormalization group methods,including Wilson's numerical renormalization group,White's density matrix renormalization group,and several recent rapidly developing tensor network state-based algorithms.Among these,particular emphasis is laid on the linearized tensor renormalization group method,which was recently proposed to accurately calculate the thermodynamic properties of quantum many-body lattice systems,and which may have broad applications in both one-and two-dimensional quantum systems.

•Jan 1, 2012•0 citations

Tensor Networks: a quantum-information perspective on numerical renormalization groups

Pietro Silvi

Exact many-body quantum problems are known to be computationally hard due to the exponential scaling of the numerical resources required. Since the advent of the Density Matrix Renormalization Group, it became clear that a successful strategy to work around this obstacle was to develop numerical methods based on the well-known theoretical renormalization group. In recent years, it was realized that quantum states engineered via numerical renormalization allow a variational representation in terms of a tensor network picture. The discovery provided a further boost to the effectiveness of these techniques, not only due to the increased flexibility and manipulability, but also because tensor network states embed a direct interface to the entanglement they carry, so that one can directly address many-body quantum correlations within these variational ansatz states. This lead to the application of several numerical tools, originally developed in the field of quantum-information, to approach condensed matter problems.

arXiv:1205.4198•May 18, 2012•4 citations

Development of Tensor Network Algorithms for Studying Classical and Quantum Many-Body Systems

Matthew Fishman

The field of tensor networks, kicked off in 1992 by Steve White's invention of the spectacularly successful density matrix renormalization group (DMRG) algorithm, has exploded in popularity in recent years. Tensor networks are poised to play a role in helping us solve some of the greatest open physics problems of our time, such as understanding the nature of high-temperature superconductivity and illuminating a theory of quantum gravity. DMRG and extensions based on a class of variational states known as tensor network states have been indispensable tools in helping us understand both numerically and theoretically the properties of complicated classical and quantum many-body systems. However, practical challenges to these techniques still remain, and algorithmic developments are needed before tensor network algorithms can be applied to more physics problems. In this thesis we present a variety of recent advancements to tensor network algorithms. First we describe a DMRG-like algorithm for noninteracting fermions. Noninteracting fermions, naturally being gapless and therefore having high levels of entanglement, are actually a challenging setting for standard DMRG algorithms, and we believe this new algorithm can help with tensor network calculations in that setting. Next we explain a new algorithm called the variational uniform matrix product state (VUMPS) algorithm that is a DMRG-like algorithm that works directly in the thermodynamic limit, improving upon currently available MPS-based methods for studying infinite 1D and quasi-1D quantum many-body systems. Finally, we describe a variety of improvements to algorithms for contracting 2D tensor networks, a common problem in tensor network algorithms, for example for studying 2D classical statistical mechanics problems and 2D quantum many-body problems with projected entangled pair states (PEPS). One is a new variant of the corner transfer matrix renormalization group (CTMRG) algorithm of Nishino and Okunishi that improves the numerical stability for contracting asymmetric two-dimensional tensor networks compared to the most commonly used method. Another is the application of the VUMPS algorithm to contracting 2D tensor networks. The last is a new alternative to CTMRG, where the tensors are solved for with eigenvalue equations instead of a power method, which we call the fixed point corner method (FPCM). We present results showing the transfer matrix VUMPS algorithm and FPCM significantly improve upon the convergence time of CTMRG. We expect these algorithms will play an important role in expanding the set of 2D classical and 2D quantum many-body problems that can be addressed with tensor networks.

•Jun 8, 2018•2 citations
We review the development of numerical renormalization group methods,including Wilson's numerical renormalization group,White's density matrix renormalization group,and several recent rapidly developing tensor network state-based algorithms.Among these,particular emphasis is laid on the linearized tensor renormalization group method,which was recently proposed to accurately calculate the thermodynamic properties of quantum many-body lattice systems,and which may have broad applications in both one-and two-dimensional quantum systems.
Exact many-body quantum problems are known to be computationally hard due to the exponential scaling of the numerical resources required. Since the advent of the Density Matrix Renormalization Group, it became clear that a successful strategy to work around this obstacle was to develop numerical methods based on the well-known theoretical renormalization group. In recent years, it was realized that quantum states engineered via numerical renormalization allow a variational representation in terms of a tensor network picture. The discovery provided a further boost to the effectiveness of these techniques, not only due to the increased flexibility and manipulability, but also because tensor network states embed a direct interface to the entanglement they carry, so that one can directly address many-body quantum correlations within these variational ansatz states. This lead to the application of several numerical tools, originally developed in the field of quantum-information, to approach condensed matter problems.
The field of tensor networks, kicked off in 1992 by Steve White's invention of the spectacularly successful density matrix renormalization group (DMRG) algorithm, has exploded in popularity in recent years. Tensor networks are poised to play a role in helping us solve some of the greatest open physics problems of our time, such as understanding the nature of high-temperature superconductivity and illuminating a theory of quantum gravity. DMRG and extensions based on a class of variational states known as tensor network states have been indispensable tools in helping us understand both numerically and theoretically the properties of complicated classical and quantum many-body systems. However, practical challenges to these techniques still remain, and algorithmic developments are needed before tensor network algorithms can be applied to more physics problems. In this thesis we present a variety of recent advancements to tensor network algorithms. First we describe a DMRG-like algorithm for noninteracting fermions. Noninteracting fermions, naturally being gapless and therefore having high levels of entanglement, are actually a challenging setting for standard DMRG algorithms, and we believe this new algorithm can help with tensor network calculations in that setting. Next we explain a new algorithm called the variational uniform matrix product state (VUMPS) algorithm that is a DMRG-like algorithm that works directly in the thermodynamic limit, improving upon currently available MPS-based methods for studying infinite 1D and quasi-1D quantum many-body systems. Finally, we describe a variety of improvements to algorithms for contracting 2D tensor networks, a common problem in tensor network algorithms, for example for studying 2D classical statistical mechanics problems and 2D quantum many-body problems with projected entangled pair states (PEPS). One is a new variant of the corner transfer matrix renormalization group (CTMRG) algorithm of Nishino and Okunishi that improves the numerical stability for contracting asymmetric two-dimensional tensor networks compared to the most commonly used method. Another is the application of the VUMPS algorithm to contracting 2D tensor networks. The last is a new alternative to CTMRG, where the tensors are solved for with eigenvalue equations instead of a power method, which we call the fixed point corner method (FPCM). We present results showing the transfer matrix VUMPS algorithm and FPCM significantly improve upon the convergence time of CTMRG. We expect these algorithms will play an important role in expanding the set of 2D classical and 2D quantum many-body problems that can be addressed with tensor networks.