Density Matrix Renormalization Group

The density matrix renormalization group (DMRG) is a numerical variational technique devised to obtain the low-energy physics of quantum many-body systems with high accuracy. As a variational method, DMRG is an efficient algorithm that attempts to find the lowest-energy matrix product state wavefunction of a Hamiltonian. It was invented in 1992 by Steven R. White and it is nowadays the most efficient method for 1-dimensional systems.

History

The first application of the DMRG, by Steven R. White and Reinhard Noack, was a ''toy model'': to find the spectrum of a spin 0 particle in a 1D box. This model had been proposed by Kenneth G. Wilson as a test for any new renormalization group method, because they all happened to fail with this simple problem. The DMRG overcame the problems of previous renormalization group methods by connecting two blocks with the two sites in the middle rather than just adding a single site to a block at each step as well as by using the density matrix to identify the most important states to be kept at the end of each step. After succeeding with the ''toy model'', the DMRG method was tried with success on the quantum Heisenberg model.

Principle

The main problem of quantum many-body physics is the fact that the Hilbert space grows exponentially with size. In other words if one considers a lattice, with some Hilbert space of dimension $d$ on each site of the lattice, then the total Hilbert space would have dimension $d^$, where $N$ is the number of sites on the lattice. For example, a spin-1/2 chain of length ''L'' has 2^''L'' degrees of freedom. The DMRG is an iterative, variational method that reduces effective degrees of freedom to those most important for a target state. The state one is most often interested in is the ground state.

After a warmup cycle, the method splits the system into two subsystems, or blocks, which need not have equal sizes, and two sites in between. A set of ''representative states'' has been chosen for the block during the warmup. This set of left blocks + two sites + right blocks is known as the superblock. Now a candidate for the ground state of the superblock, which is a reduced version of the full system, may be found. It may have a rather poor accuracy, but the method is iterative and improves with the steps below.

The candidate ground state that has been found is projected into the Hilbert subspace for each block using a density matrix, hence the name. Thus, the ''relevant states'' for each block are updated.

Now one of the blocks grows at the expense of the other and the procedure is repeated. When the growing block reaches maximum size, the other starts to grow in its place. Each time we return to the original (equal sizes) situation, we say that a ''sweep'' has been completed. Normally, a few sweeps are enough to get a precision of a part in 10¹⁰ for a 1D lattice.

Implementation guide

A practical implementation of the DMRG algorithm is a lengthy work. A few of the main computational tricks are these:

* Since the size of the renormalized Hamiltonian is usually in the order of a few or tens of thousand while the sought eigenstate is just the ground state, the ground state for the superblock is obtained via iterative algorithm such as the Lanczos algorithm of matrix diagonalization. Another choice is the Arnoldi method, especially when dealing with non-hermitian matrices.
* The Lanczos algorithm usually starts with the best guess of the solution. If no guess is available a random vector is chosen. In DMRG, the ground state obtained in a certain DMRG step, suitably transformed, is a reasonable guess and thus works significantly better than a random starting vector at the next DMRG step.
* In systems with symmetries, we may have conserved quantum numbers, such as total spin in a Heisenberg model. It is convenient to find the ground state within each of the sectors into which the Hilbert space is divided.

Applications

The DMRG has been successfully applied to get the low energy properties of spin chains: Ising model in a transverse field, Heisenberg model, etc., fermionic systems, such as the Hubbard model, problems with impurities such as the Kondo effect, boson systems, and the physics of quantum dots joined with quantum wires. It has been also extended to work on tree graphs, and has found applications in the study of dendrimers. For 2D systems with one of the dimensions much larger than the other DMRG is also accurate, and has proved useful in the study of ladders.

The method has been extended to study equilibrium statistical physics in 2D, and to analyze non-equilibrium phenomena in 1D.

The DMRG has also been applied to the field of quantum chemistry to study strongly correlated systems.

Example: Quantum Heisenberg model

Let us consider an "infinite" DMRG algorithm for the $S=1$ antiferromagnetic quantum Heisenberg chain. The recipe can be applied for every translationally invariant one-dimensional lattice.

DMRG is a renormalization-group technique because it offers an efficient truncation of the Hilbert space of one-dimensional quantum systems.

Starting point

To simulate an infinite chain, start with four sites. The first is the ''block site'', the last the ''universe-block site'' and the remaining are the ''added sites'', the right one is added to the universe-block site and the other to the block site.

The Hilbert space for the single site is $\mathfrak$ with the base $\\equiv\$. With this base the spin operators are $S_x$, $S_y$ and $S_z$ for the single site. For every block, the two blocks and the two sites, there is its own Hilbert space $\mathfrak_b$, its base $\$ ($i:1\dots \dim(\mathfrak_b)$)and its own operators$O_b:\mathfrak_b\rightarrow\mathfrak_b$where

* block: $\mathfrak_B$, $\$, $H_B$, $S_$, $S_$, $S_$
* left-site: $\mathfrak_l$, $\$, $S_$, $S_$, $S_$
* right-site: $\mathfrak_r$, $\$, $S_$, $S_$, $S_$
* universe: $\mathfrak_U$, $\$, $H_U$, $S_$, $S_$, $S_$

At the starting point all four Hilbert spaces are equivalent to $\mathfrak$, all spin operators are equivalent to $S_x$, $S_y$ and $S_z$ and $H_B=H_U=0$. In the following iterations, this is only true for the left and right sites.

Step 1: Form the Hamiltonian matrix for the superblock

The ingredients are the four block operators and the four universe-block operators, which at the first iteration are $3\times3$ matrices, the three left-site spin operators and the three right-site spin operators, which are always $3\times3$ matrices. The Hamiltonian matrix of the ''superblock'' (the chain), which at the first iteration has only four sites, is formed by these operators. In the Heisenberg antiferromagnetic S=1 model the Hamiltonian is:

$\mathbf_=-J\sum_\mathbf_\mathbf_+\mathbf_\mathbf_+\mathbf_\mathbf_$

These operators live in the superblock state space: $\mathfrak_=\mathfrak_B\otimes\mathfrak_l\otimes\mathfrak_r\otimes\mathfrak_U$, the base is $\$. For example: (convention):

$, 1000\dots0\rangle\equiv, f_1\rangle=, u_1,t_1,s_1,r_1\rangle\equiv, 100,100,100,100\rangle$

$, 0100\dots0\rangle\equiv, f_2\rangle=, u_1,t_1,s_1,r_2\rangle\equiv, 100,100,100,010\rangle$

The Hamiltonian in the ''DMRG form'' is (we set $J=-1$):

$\mathbf_=\mathbf_B+\mathbf_U+\sum_\mathbf_\mathbf_+\mathbf_\mathbf_+\mathbf_\mathbf_$

The operators are $(d*3*3*d)\times(d*3*3*d)$ matrices, $d=\dim(\mathfrak_B)\equiv\dim(\mathfrak_U)$, for example:

$\langle f, \mathbf_B, f'\rangle\equiv\langle u,t,s,r, H_B\otimes\mathbb\otimes\mathbb\otimes\mathbb, u',t',s',r'\rangle$

$\mathbf_\mathbf_=S_\mathbb\otimes\mathbbS_\otimes\mathbb\mathbb\otimes\mathbb\mathbb=S_\otimes S_\otimes\mathbb\otimes\mathbb$

Step 2: Diagonalize the superblock Hamiltonian

At this point you must choose the eigenstate of the Hamiltonian for which some observables is calculated, this is the ''target state'' . At the beginning you can choose the ground state and use some advanced algorithm to find it, one of these is described in:

* ''The Iterative Calculation of a Few of the Lowest Eigenvalues and Corresponding Eigenvectors of Large Real-Symmetric Matrices'', Ernest R. Davidson; Journal of Computational Physics 17, 87-94 (1975)

This step is the most time-consuming part of the algorithm.

If $, \Psi\rangle=\sum\Psi_, u_i,t_j,s_k,r_w\rangle$ is the target state, expectation value of various operators can be measured at this point using $, \Psi\rangle$.

Step 3: Reduce density matrix

Form the reduced density matrix $\rho$ for the first two block system, the block and the left-site. By definition it is the $(d*3)\times(d*3)$ matrix: $\rho_\equiv\sum_\Psi_\Psi^*_$

Diagonalize $\rho$ and form the $m\times (d*3)$ matrix $T$, which rows are the $m$ eigenvectors associated with the $m$ largest eigenvalues $e_\alpha$ of $\rho$. So $T$ is formed by the most significant eigenstates of the reduced density matrix. You choose $m$ looking to the parameter $P_m\equiv\sum_^m e_\alpha$: $1-P_m\cong 0$.

Step 4: New block and universe-block operators

Form the $(d*3)\times(d*3)$ matrix representation of operators for the system composite of the block and left-site, and for the system composite of right-site and universe-block, for example:

$H_=H_B\otimes\mathbb+S_\otimes S_+S_\otimes S_+S_\otimes S_$

$S_=\mathbb\otimes S_$

$H_=\mathbb\otimes H_U+S_\otimes S_+S_\otimes S_+S_\otimes S_$

$S_=S_\otimes\mathbb$

Now, form the $m\times m$ matrix representations of the new block and universe-block operators, form a new block by changing basis with the transformation $T$, for example:$\begin &H_B=TH_T^\dagger &S_=TS_T^\dagger \end$At this point the iteration is ended and the algorithm goes back to step 1.

The algorithm stops successfully when the observable converges to some value.

Matrix product ansatz

The success of the DMRG for 1D systems is related to the fact that it is a variational method within the space of matrix product states (MPS). These are states of the form

: $, \Psi\rangle = \sum_ \operatorname(A^\cdots A^) , s_1 \cdots s_N\rangle$

where $s_1\cdots s_N$ are the values of the e.g. ''z''-component of the spin in a spin chain, and the ''A''^''s''_''i'' are matrices of arbitrary dimension ''m''. As ''m'' → ∞, the representation becomes exact. This theory was exposed by S. Rommer and S. Ostlund i

In quantum chemistry application, $s_i$ stands for the four possibilities of the projection of the spin quantum number of the two electrons that can occupy a single orbital, thus $s_i = , 00\rangle, , 10\rangle, , 01\rangle, , 11\rangle$, where the first (second) entry of these kets corresponds to the spin-up(down) electron. In quantum chemistry, $A^$ (for a given $s_i$) and $A^$ (for a given $s_N$) are traditionally chosen to be row and column matrices, respectively. This way, the result of $A^ \ldots A^$ is a scalar value and the trace operation is unnecessary. $N$ is the number of sites (the orbitals basically) used in the simulation.

The matrices in the MPS ansatz are not unique, one can, for instance, insert $B^ B$ in the middle of $A^A^$, then define $\tilde^ = A^B^$ and $\tilde^ = BA^$, and the state will stay unchanged. Such gauge freedom is employed to transform the matrices into a canonical form. Three types of canonical form exist: (1) left-normalized form, when

:$\sum_ \left(\tilde^\right)^\dagger \tilde^ = I$
for all $i$, (2) right-normalized form, when
:$\sum_ \tilde^ \left(\tilde^\right)^\dagger = I$
for all $i$, and (3) mixed-canonical form when both left- and right-normalized matrices exist among the $N$ matrices in the above MPS ''ansatz''.

The goal of the DMRG calculation is then to solve for the elements of each of the $A^$ matrices. The so-called one-site and two-site algorithms have been devised for this purpose. In the one-site algorithm, only one matrix (one site) whose elements are solved for at a time. Two-site just means that two matrices are first contracted (multiplied) into a single matrix, and then its elements are solved. The two-site algorithm is proposed because the one-site algorithm is much more prone to getting trapped at a local minimum. Having the MPS in one of the above canonical forms has the advantage of making the computation more favorable - it leads to the ordinary eigenvalue problem. Without canonicalization, one will be dealing with a generalized eigenvalue problem.

Extensions

In 2004 the time-evolving block decimation method was developed to implement real-time evolution of matrix product states. The idea is based on the classical simulation of a quantum computer. Subsequently, a new method was devised to compute real-time evolution within the DMRG formalism - See the paper by A. Feiguin and S.R. Whit

In recent years, some proposals to extend the method to 2D and 3D have been put forward, extending the definition of the matrix product states. See this paper by Frank Verstraete, F. Verstraete and I. Cirac

Further reading

* The original paper, by S. R. White

o

* A textbook on DMRG and its origins: https://www.springer.com/gp/book/9783540661290
* A broad review, by Karen Hallberg


* Two reviews by Ulrich Schollwöck, one discussing the original formulatio

and another in terms of matrix product state

* The Ph.D. thesis of Javier Rodríguez Lagun


* An introduction to DMRG and its time-dependent extensio


* A list of DMRG e-prints on arxiv.or


* A review article on DMRG for ab initio quantum chemistry methods, ab initio quantum chemistrybr>

* An introduction video on DMRG for ab initio quantum chemistry methods, ab initio quantum chemistrybr>

*

Related software

The Matrix Product Toolkit
A free GPL set of tools for manipulating finite and infinite matrix product states written in C++br>

Uni10
a library implementing numerous tensor network algorithms (DMRG, TEBD, MERA, PEPS ...) in C++
* Powder with Power: a free distribution of time-dependent DMRG code written in Fortranbr>

* The ALPS Project: a free distribution of time-independent DMRG code and Quantum Monte Carlo codes written in C++br>

DMRG++
a free implementation of DMRG written in C++br>
* Th
ITensor
(Intelligent Tensor) Library: a free library for performing tensor and matrix-product state based DMRG calculations written in C++br>

OpenMPS
an open source DMRG implementation based on Matrix Product States written in Python/Fortran2003

* Snake DMRG program: open source DMRG, tDMRG and finite temperature DMRG program written in C+


CheMPS2
open source (GPL) spin-adapted DMRG code for ab initio quantum chemistry methods, ab initio quantum chemistry written in C+


Block
open source DMRG framework for quantum chemistry and model Hamiltonians. Supports SU(2) and general non-Abelian symmetries. Written in C++.

Block2
An efficient Parallel algorithm, parallel implementation of DMRG, dynamical DMRG, tdDMRG, and finite temperature DMRG for quantum chemistry and models. Written in Python/ C++.

See also

*Quantum Monte Carlo
*Time-evolving block decimation
*Configuration interaction

References

{{reflist

Theoretical physics
Computational physics
Statistical mechanics