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:cond-mat/0701428 · Journal of Statistical Mechanics Theory and Experiment

From density-matrix renormalization group to matrix product states

Ian P. McCulloch

Published Oct 25, 2007• 459 citations
arXivHTMLPDF

Abstract

In this paper we give an introduction to the numerical density matrix renormalization group (DMRG) algorithm, from the perspective of the more general matrix product state (MPS) formulation. We cover in detail the differences between the original DMRG formulation and the MPS approach, demonstrating the additional flexibility that arises from constructing both the wavefunction and the Hamiltonian in MPS form. We also show how to make use of global symmetries, for both the Abelian and non-Abelian cases.

DOI
10.1088/1742-5468/2007/10/p10014

Related papers

An efficient matrix product operator representation of the quantum chemical Hamiltonian

Sebastian F. Keller, Michele Dolfi, Matthias Troyer +1 more

We describe how to efficiently construct the quantum chemical Hamiltonian operator in matrix product form. We present its implementation as a density matrix renormalization group (DMRG) algorithm for quantum chemical applications. Existing implementations of DMRG for quantum chemistry are based on the traditional formulation of the method, which was developed from the point of view of Hilbert space decimation and attained higher performance compared to straightforward implementations of matrix product based DMRG. The latter variationally optimizes a class of ansatz states known as matrix product states, where operators are correspondingly represented as matrix product operators (MPOs). The MPO construction scheme presented here eliminates the previous performance disadvantages while retaining the additional flexibility provided by a matrix product approach, for example, the specification of expectation values becomes an input parameter. In this way, MPOs for different symmetries - abelian and non-abelian - and different relativistic and non-relativistic models may be solved by an otherwise unmodified program.

arXiv:1510.02026•The Journal of Chemical Physics•Dec 28, 2015•185 citations

Density Matrix Renormalization Group Lagrangians

Garnet Kin‐Lic Chan

We introduce a Lagrangian formulation of the Density Matrix Renormalization Group (DMRG). We present Lagrangians which when minimised yield the optimal DMRG wavefunction in a variational sense, both within the general matrix product ansatz, as well as within the canonical form of the matrix product that is constructed within the DMRG sweep algorithm. Some of the results obtained are similar to elementary expressions in Hartree-Fock theory, and we draw attention to such analogies. The Lagrangians introduced here will be useful in developing theories of analytic response and derivatives in the DMRG.

arXiv:0804.1755•Apr 10, 2008•0 citations

Matrix product operators, matrix product states, and ab initio density matrix renormalization group algorithms

Garnet Kin‐Lic Chan, Anna Keselman, Naoki Nakatani +2 more

Current descriptions of the ab initio density matrix renormalization group (DMRG) algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix product operators. The same algorithm can appear dramatically different when written in the two different vocabularies. In this work, we carefully describe the translation between the two languages in several contexts. First, we describe how to efficiently implement the ab initio DMRG sweep using a matrix product operator based code, and the equivalence to the original renormalized operator implementation. Next we describe how to implement the general matrix product operator/matrix product state algebra within a pure renormalized operator-based DMRG code. Finally, we discuss two improvements of the ab initio DMRG sweep algorithm motivated by matrix product operator language: Hamiltonian compression, and a sum over operators representation that allows for perfect computational parallelism. The connections and correspondences described here serve to link the future developments with the past and are important in the efficient implementation of continuing advances in ab initio DMRG and related algorithms.

arXiv:1605.02611•The Journal of Chemical Physics•Jul 5, 2016•210 citations

The density-matrix renormalization group: a short introduction

B Y U Lrich S Chollwöck, A Sommerfeld

The density-matrix renormalization group (DMRG) method has established itself over the last decade as the leading method for the simulation of the statics and dynamics of one-dimensional strongly correlated quantum lattice systems. The DMRG is a method that shares features of a renormalization group procedure (which here generates a flow in the space of reduced density operators) and of a variational method that operates on a highly interesting class of quantum states, so-called matrix product states (MPSs). The DMRG method is presented here entirely in the MPS language. While the DMRG generally fails in larger two-dimensional systems, the MPS picture suggests a straightforward generalization to higher dimensions in the framework of tensor network states. The resulting algorithms, however, suffer from difficulties absent in one dimension, apart from a much more unfavourable efficiency, such that their ultimate success remains far from clear at the moment.

•Jan 1, 2015•1 citation

The density-matrix renormalization group: a short introduction

Ulrich Schollwöck

The density-matrix renormalization group (DMRG) method has established itself over the last decade as the leading method for the simulation of the statics and dynamics of one-dimensional strongly correlated quantum lattice systems. The DMRG is a method that shares features of a renormalization group procedure (which here generates a flow in the space of reduced density operators) and of a variational method that operates on a highly interesting class of quantum states, so-called matrix product states (MPSs). The DMRG method is presented here entirely in the MPS language. While the DMRG generally fails in larger two-dimensional systems, the MPS picture suggests a straightforward generalization to higher dimensions in the framework of tensor network states. The resulting algorithms, however, suffer from difficulties absent in one dimension, apart from a much more unfavourable efficiency, such that their ultimate success remains far from clear at the moment.

Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences•Jun 6, 2011•52 citations

Matrix-product-state comparison of the numerical renormalization group and the variational formulation of the density-matrix renormalization group

Hamed Saberi, Andreas Weichselbaum, Jan von Delft

Wilson's numerical renormalization group (NRG) method for solving quantum impurity models yields a set of energy eigenstates that have the form of matrix product states (MPS). White's density-matrix renormalization group (DMRG) for treating quantum lattice problems can likewise be reformulated in terms of MPS. Thus, the latter constitute a common algebraic structure for both approaches. We exploit this fact to compare the NRG approach for the single-impurity Anderson model with a variational matrix product state approach (VMPS), equivalent to single-site DMRG. For the latter, we use an ``unfolded'' Wilson chain, which brings about a significant reduction in numerical costs compared to those of NRG. We show that all NRG eigenstates (kept and discarded) can be reproduced using VMPS, and compare the difference in truncation criteria, sharp vs smooth in energy space, of the two approaches. Finally, we demonstrate that NRG results can be improved upon systematically by performing a variational optimization in the space of variational matrix product states, using the states produced by NRG as input.

arXiv:0804.0193•Physical Review B•Jul 24, 2008•56 citations
In this paper we give an introduction to the numerical density matrix renormalization group (DMRG) algorithm, from the perspective of the more general matrix product state (MPS) formulation. We cover in detail the differences between the original DMRG formulation and the MPS approach, demonstrating the additional flexibility that arises from constructing both the wavefunction and the Hamiltonian in MPS form. We also show how to make use of global symmetries, for both the Abelian and non-Abelian cases.
We describe how to efficiently construct the quantum chemical Hamiltonian operator in matrix product form. We present its implementation as a density matrix renormalization group (DMRG) algorithm for quantum chemical applications. Existing implementations of DMRG for quantum chemistry are based on the traditional formulation of the method, which was developed from the point of view of Hilbert space decimation and attained higher performance compared to straightforward implementations of matrix product based DMRG. The latter variationally optimizes a class of ansatz states known as matrix product states, where operators are correspondingly represented as matrix product operators (MPOs). The MPO construction scheme presented here eliminates the previous performance disadvantages while retaining the additional flexibility provided by a matrix product approach, for example, the specification of expectation values becomes an input parameter. In this way, MPOs for different symmetries - abelian and non-abelian - and different relativistic and non-relativistic models may be solved by an otherwise unmodified program.
We introduce a Lagrangian formulation of the Density Matrix Renormalization Group (DMRG). We present Lagrangians which when minimised yield the optimal DMRG wavefunction in a variational sense, both within the general matrix product ansatz, as well as within the canonical form of the matrix product that is constructed within the DMRG sweep algorithm. Some of the results obtained are similar to elementary expressions in Hartree-Fock theory, and we draw attention to such analogies. The Lagrangians introduced here will be useful in developing theories of analytic response and derivatives in the DMRG.
Current descriptions of the ab initio density matrix renormalization group (DMRG) algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix product operators. The same algorithm can appear dramatically different when written in the two different vocabularies. In this work, we carefully describe the translation between the two languages in several contexts. First, we describe how to efficiently implement the ab initio DMRG sweep using a matrix product operator based code, and the equivalence to the original renormalized operator implementation. Next we describe how to implement the general matrix product operator/matrix product state algebra within a pure renormalized operator-based DMRG code. Finally, we discuss two improvements of the ab initio DMRG sweep algorithm motivated by matrix product operator language: Hamiltonian compression, and a sum over operators representation that allows for perfect computational parallelism. The connections and correspondences described here serve to link the future developments with the past and are important in the efficient implementation of continuing advances in ab initio DMRG and related algorithms.
The density-matrix renormalization group (DMRG) method has established itself over the last decade as the leading method for the simulation of the statics and dynamics of one-dimensional strongly correlated quantum lattice systems. The DMRG is a method that shares features of a renormalization group procedure (which here generates a flow in the space of reduced density operators) and of a variational method that operates on a highly interesting class of quantum states, so-called matrix product states (MPSs). The DMRG method is presented here entirely in the MPS language. While the DMRG generally fails in larger two-dimensional systems, the MPS picture suggests a straightforward generalization to higher dimensions in the framework of tensor network states. The resulting algorithms, however, suffer from difficulties absent in one dimension, apart from a much more unfavourable efficiency, such that their ultimate success remains far from clear at the moment.
The density-matrix renormalization group (DMRG) method has established itself over the last decade as the leading method for the simulation of the statics and dynamics of one-dimensional strongly correlated quantum lattice systems. The DMRG is a method that shares features of a renormalization group procedure (which here generates a flow in the space of reduced density operators) and of a variational method that operates on a highly interesting class of quantum states, so-called matrix product states (MPSs). The DMRG method is presented here entirely in the MPS language. While the DMRG generally fails in larger two-dimensional systems, the MPS picture suggests a straightforward generalization to higher dimensions in the framework of tensor network states. The resulting algorithms, however, suffer from difficulties absent in one dimension, apart from a much more unfavourable efficiency, such that their ultimate success remains far from clear at the moment.
Wilson's numerical renormalization group (NRG) method for solving quantum impurity models yields a set of energy eigenstates that have the form of matrix product states (MPS). White's density-matrix renormalization group (DMRG) for treating quantum lattice problems can likewise be reformulated in terms of MPS. Thus, the latter constitute a common algebraic structure for both approaches. We exploit this fact to compare the NRG approach for the single-impurity Anderson model with a variational matrix product state approach (VMPS), equivalent to single-site DMRG. For the latter, we use an ``unfolded'' Wilson chain, which brings about a significant reduction in numerical costs compared to those of NRG. We show that all NRG eigenstates (kept and discarded) can be reproduced using VMPS, and compare the difference in truncation criteria, sharp vs smooth in energy space, of the two approaches. Finally, we demonstrate that NRG results can be improved upon systematically by performing a variational optimization in the space of variational matrix product states, using the states produced by NRG as input.