DMRG Preview
Density-matrix renormalization group is a variational ground-state method whose practical power comes from matching a one-dimensional tensor representation to the entanglement structure of the target state. It replaces one exponentially large eigenproblem by a sequence of local effective eigenproblems, but the resulting calculation is trustworthy only after bond, sweep, sector, initialization, and finite-size convergence have all been tested.
Here the system is a finite open chain with a Hermitian Hamiltonian. The method optimizes one site or an adjacent pair, factors the resulting tensor, and moves this center through the chain. Repeating left-to-right and right-to-left passes updates the effective bases until the requested observables stabilize.
Required background. Matrix product states explains canonical forms and Schmidt bonds; singular-value decomposition supplies the local factorization.
What DMRG optimizes
Section titled “What DMRG optimizes”Let denote the set of open-boundary MPS whose bond dimensions are bounded by
At fixed physical basis, ordering, boundary condition, and symmetry sector, the variational target is
For any normalized represented state in the Hamiltonian form domain, its exactly evaluated energy is an upper bound to the global ground energy. Thus
Increasing a bond dimension enlarges the accessible state class, so the exact variational optimum cannot increase:
If a symmetry restriction excludes the global ground state, the class minimum is bounded below by the sector ground energy instead; it is still an upper bound to the global value. This monotonic statement concerns the global optimum in each class, with the same Hamiltonian and sector. A practical DMRG run may not find that optimum. The MPS parameterization is nonlinear and gauge-redundant, and the energy landscape can contain stationary points or narrow directions that trap a local update.
DMRG therefore performs alternating optimization: hold every tensor except one site or one adjacent pair fixed, solve the resulting local variational problem, move the center, and repeat.
The local linear space
Section titled “The local linear space”Place an MPS in mixed-canonical form with its center at site . The state can be written
Here:
- is the effective basis generated by the left-canonical tensors;
- is the effective basis generated by the right-canonical tensors;
- is the local physical basis;
- is the only variational tensor in the one-site step.
Canonical form makes the effective basis orthonormal:
Flatten the center tensor into a vector . The map from its entries to the full Hilbert space is linear:
The projected operators are
The local Rayleigh quotient is
After removing any redundant zero-norm coordinates, stationarity with respect to the complex coordinates gives the generalized eigenproblem
In exact mixed-canonical form, is an isometry and
so the local problem becomes
This identity is more than a cosmetic simplification. It removes an ill-conditioned norm matrix and makes the local residual physically interpretable.
Environments and matrix-free action
Section titled “Environments and matrix-free action”A local Hamiltonian is commonly represented as a matrix product operator (MPO). The tensors to the left and right of the center can then be contracted into reusable environments:
Together with the local MPO tensor, these environments define the action of on the center tensor. One should normally apply this action by contraction rather than form the dense effective matrix.
For a one-site center, the effective vector dimension is
For a two-site center,
These are local dimensions, not full Hilbert-space dimensions. Symmetry blocks can reduce them substantially, while large local bases, wide MPO bonds, or large MPS bonds can still make the local solve expensive.
An iterative eigensolver seeks the lowest vector without storing all of . Its residual is
A small identifies an approximate eigenpair of the local matrix, but does not by itself prove it is that matrix’s lowest eigenpair. Even an exact local minimum need not be a global MPS optimum.
For a concrete example, take with and Pauli matrices . In the product state , optimizing either site alone keeps it unchanged: the other site’s removes the coupling from the local problem. Both local residuals vanish. Nevertheless,
The global ground energy is , in an entangled state. A two-site update can explore the missing direction. This explains why local convergence and full-state variance test different questions.
One-site update
Section titled “One-site update”A one-site update optimizes while every other tensor is fixed.
One left-to-right step is:
- Put the orthogonality center at site .
- Contract or update and .
- Solve the lowest local eigenproblem for .
- Factor the optimized center to make site left-canonical.
- Absorb the remaining factor into site .
- Advance the center and update the environment.
The reverse half-sweep exchanges left and right.
If:
- the current center is included in the local search space;
- the effective problem is solved accurately;
- canonicalization is numerically stable;
- and no truncation changes the state;
then the local variational energy should not increase. A violation larger than numerical tolerances signals an inconsistent environment, loose local solve, normalization problem, or implementation error.
Strengths
Section titled “Strengths”- It keeps the declared bond dimensions fixed.
- It avoids the larger two-site center.
- It is strictly variational under the stated conditions.
- It works naturally with block-sparse symmetry sectors.
Limitations
Section titled “Limitations”The fixed local basis can make a one-site method reluctant to create directions absent from the current bond space. It may stall in a metastable state, especially after an unfortunate initialization or an overly restrictive symmetry pattern.
Reliable one-site variants use controlled enrichment, mixing, or subspace expansion. Such devices enlarge the local search directions without turning a numerical perturbation into part of the physical Hamiltonian. Their strength must itself be converged or reduced as the calculation settles.
Two-site update
Section titled “Two-site update”A two-site update combines adjacent sites into
The state is
DMRG solves the two-site effective problem
where is the flattened two-site tensor. The optimized tensor is then reshaped as a matrix,
and factorized:
Keeping at most singular values defines the new bond and moves the orthogonality center.
Why it is often robust
Section titled “Why it is often robust”The enlarged center can alter the bond basis and adapt the bond dimension. It can introduce correlations or symmetry-compatible directions that a fixed-bond one-site update cannot reach easily.
Why it is not automatically monotone
Section titled “Why it is not automatically monotone”Before truncation, the optimized two-site state has energy no larger than the previous state when the local solve is exact and the previous state belongs to the search space. The SVD then chooses the best low-rank approximation in state norm, not the state that minimizes energy after truncation. Consequently:
may exceed
and can occasionally exceed the energy before the local update. Subsequent updates usually recover the variational improvement, but the distinction must not be hidden when diagnosing a sweep.
Truncation and discarded weight
Section titled “Truncation and discarded weight”Suppose the normalized two-site center has singular values
Keeping the first values gives the local discarded weight
For the unnormalized Schmidt projection ,
and
After normalization,
the squared overlap is
For this single truncation, any bounded observable obeys
This is a bound on the full represented state for one bond truncation, not a claim restricted to local observables. A sweep contains many adaptive truncations, and their effects can interact. The maximum discarded weight, the sum of discarded weights, and a package-reported truncation error are useful diagnostics, but none is a universal global error bar on every observable.
The finite-system sweep
Section titled “The finite-system sweep”A half-sweep moves the center from one end of the finite chain to the other. A full sweep normally means one left-to-right and one right-to-left pass, although software conventions differ. A reproducible report must state its convention.
At every move:
- the newly passed tensor is put in the appropriate canonical gauge;
- one environment is extended;
- the environment on the far side is reused;
- the local problem is solved;
- truncation data and local diagnostics are recorded.
After the local solve, . Retaining the largest singular values produces a left-canonical tensor and a new center on the next site. This changes the basis across their shared bond; the neighboring canonical regions stay fixed during this step.
One sweep is not a physical time evolution. Its direction and intermediate states are algorithmic. Each normalized intermediate MPS is a legitimate trial state with meaningful expectation values, but the succession of sweeps does not represent its physical dynamics.
Why the method is called density-matrix renormalization group
Section titled “Why the method is called density-matrix renormalization group”In the original block formulation, a system block was enlarged and then compressed. The retained block states were the eigenvectors of a reduced density matrix with the largest eigenvalues.
For a bipartite target state,
the reduced density matrix is
Keeping its largest eigenvalues is exactly Schmidt truncation. Modern finite-system DMRG written in MPS language performs the same optimal local compression through the SVD of the center tensor.
The historical name can otherwise mislead:
- DMRG is not a real-space renormalization-group flow that preserves every low-energy state.
- The density matrix belongs to the chosen target state or target ensemble.
- Modern implementations need not explicitly construct and diagonalize a dense reduced density matrix.
- The method is best understood as variational MPS optimization with adaptive Schmidt bases.
White introduced the density-matrix selection principle in 1992 and developed the finite-system algorithms in 1993. The later MPS interpretation made the variational state class and entanglement limitation explicit.
Why one-dimensional gapped systems are favorable
Section titled “Why one-dimensional gapped systems are favorable”Three structures cooperate.
Local entanglement geometry
Section titled “Local entanglement geometry”For a contiguous cut of an open one-dimensional chain, one MPS bond crosses the cut:
Ground states of broad classes of local gapped one-dimensional Hamiltonians obey an area law. Their Schmidt spectra often decay sufficiently rapidly that moderate bond dimensions capture local observables and energies accurately.
The precise theorem status and converse cautions belong to Area Laws. An area law is not by itself a certificate that a particular is adequate or that a local optimizer will find the desired state.
Local Hamiltonian structure
Section titled “Local Hamiltonian structure”Short-range one-dimensional Hamiltonians admit compact MPO representations. Their effective actions can be evaluated from left and right environments without constructing the full Hamiltonian matrix.
Reusable canonical bases
Section titled “Reusable canonical bases”Canonical MPS gauges provide orthonormal effective block bases and stable local norm matrices. As the center moves, most contractions are reused rather than recomputed from scratch.
The favorable implication is therefore conditional:
Removing any one condition can change the conclusion.
Entanglement and geometry limitations
Section titled “Entanglement and geometry limitations”Critical states
Section titled “Critical states”Critical ground states commonly have entanglement growing with subsystem size. Optimized clustering MPS approximations at finite bond dimension generally introduce a finite transfer correlation length . Noninjective states can retain long-range order at finite bond dimension, so inspect the transfer spectrum before using this interpretation. A stable energy at one does not distinguish a physical gap from finite-entanglement saturation.
Critical studies require a controlled grid in system size and bond dimension, with the regimes in Entanglement and Criticality kept distinct.
Cylinders and two-dimensional lattices
Section titled “Cylinders and two-dimensional lattices”Mapping a width- cylinder to a one-dimensional ordering makes a transverse cut intersect physical bonds. If
then an MPS needs at least
to reproduce this entropy. Approximation at a specified fidelity is controlled by the Schmidt tail; the entropy capacity alone does not give its required bond dimension. DMRG can be powerful on cylinders, but cost generally grows rapidly with width. Width convergence, ordering, aspect ratio, boundary pinning, and sector selection all become part of the physical inference.
Volume-law states
Section titled “Volume-law states”Highly excited states, generic long-time states after global quenches, and other volume-law targets can require
across central cuts. The required bond dimension is then exponential in system size.
Long-range couplings and large local spaces
Section titled “Long-range couplings and large local spaces”Long-range Hamiltonians may need a larger MPO bond dimension or an approximation to the interaction kernel. Bosonic, molecular, or orbital problems may also need a large local basis. DMRG then carries both a bond truncation and a local-basis or operator-compression error.
Cost statements without false precision
Section titled “Cost statements without false precision”For roughly uniform local dimension , MPS bond dimension , and MPO bond dimension , the work per open-chain sweep is often:
- linear in chain length ;
- polynomial in and ;
- dominated by contractions with a cost commonly cubic in .
But there is no universal formula such as “DMRG costs ” without qualifications. The exponent and prefactor depend on:
- one-site versus two-site updates;
- contraction order;
- MPO structure and range;
- symmetry block sizes;
- local eigensolver iterations;
- target-state multiplicity;
- boundary conditions;
- memory strategy and parallelization.
A defensible scaling claim reports measured wall time and memory against , , , and symmetry content for the actual calculation.
Symmetry, ordering, and boundaries
Section titled “Symmetry, ordering, and boundaries”Symmetry sectors
Section titled “Symmetry sectors”Block-sparse tensors can enforce conserved charges such as particle number or total spin projection:
This reduces cost and prevents drift out of the selected sector. It can also prevent the optimizer from reaching a lower state in another sector. A ground-state claim must compare all physically relevant sectors or justify the selected one.
For non-Abelian symmetries, multiplet structure changes the meaning of “number of kept states.” Reports should distinguish reduced multiplets from total bond-state dimension.
Site and orbital ordering
Section titled “Site and orbital ordering”DMRG sees the one-dimensional order supplied to it. A poor ordering can turn short-range physical correlations into long-range MPS entanglement and enlarge the MPO. Ordering is therefore a variational design choice, not a cosmetic indexing convention.
Boundary conditions
Section titled “Boundary conditions”Open boundaries align naturally with canonical MPS sweeps. They also create edge profiles and may select among nearly degenerate states. Periodic boundaries can reduce edge effects but are usually less favorable computationally.
Bulk observables should be measured in controlled central windows or extrapolated with boundary effects exposed. See Boundary Conditions on Lattices.
Initialization and metastability
Section titled “Initialization and metastability”Common initializations include:
- a product state in the desired sector;
- a random symmetry-compatible MPS;
- a converged state at smaller ;
- a nearby parameter point;
- an exact-diagonalization state on a smaller system;
- a state with deliberately chosen boundary pinning or unit cell.
Continuation can accelerate a scan, but it can also preserve hysteresis and metastability. Near first-order transitions, competing orders, topological sectors, or nearly degenerate manifolds, use independent initial states that favor different candidates.
Agreement along one optimization history characterizes one basin; compare independent initial states to search for lower ones.
A convergence hierarchy
Section titled “A convergence hierarchy”Convergence should be established in layers.
Local-solver convergence
Section titled “Local-solver convergence”At every center, monitor:
The local tolerance should be tighter than the physical changes one intends to resolve. Oversolving early sweeps can waste work because the environments are still changing; undersolving late sweeps can create false stationarity.
Sweep convergence
Section titled “Sweep convergence”Across complete sweeps, track:
as well as changes in representative local observables, correlations, entanglement data, and symmetry labels.
The energy can converge before delicate observables. A small shows only that the energy changes little. It does not establish stationarity of every tensor or convergence of correlations.
Bond convergence
Section titled “Bond convergence”Repeat the calculation over a sequence
or over decreasing discarded-weight targets. Compare:
- energy and energy density;
- energy variance;
- local and long-distance observables;
- correlation lengths;
- Schmidt spectra and entropies;
- state quantum numbers;
- dependence on initialization and sweep schedule.
Hamiltonian variance
Section titled “Hamiltonian variance”For a normalized state,
and equivalently
An exact eigenstate has zero variance. Variance probes the full represented state rather than one local effective problem, testing directions that local optimization may omit.
Energy-versus-variance extrapolation can be useful near a well-isolated eigenstate, but linearity is not a theorem for arbitrary state families or fitting windows.
Size and geometry convergence
Section titled “Size and geometry convergence”Only after controlling solver and bond errors should one infer:
For critical systems, finite size and finite entanglement are competing infrared cutoffs. For cylinders, length, width, aspect ratio, and bond dimension are separate axes.
Benchmark logic
Section titled “Benchmark logic”Product-state fixed point
Section titled “Product-state fixed point”For
the ground state is a product state with . A DMRG implementation should recover:
This checks local basis ordering, Hamiltonian signs, normalization, and the sweep loop. It does not test nontrivial entanglement.
Small-chain overlap window
Section titled “Small-chain overlap window”For an interacting chain small enough for exact diagonalization, compare:
along with several observables. Energy agreement alone can conceal an incorrect vector inside a nearly degenerate subspace.
Heisenberg-chain sequence
Section titled “Heisenberg-chain sequence”For the antiferromagnetic spin- chain,
use small- exact diagonalization, then increase and . The infinite-chain energy density is a valuable analytic check, but open-boundary finite systems contain edge and finite-size corrections. The canonical Heisenberg Model page fixes the model conventions and physical interpretation.
Excited states and other extensions
Section titled “Excited states and other extensions”The cleanest excited-state target is often the lowest state in a different exact symmetry sector. Within one sector, common strategies include:
- explicit orthogonality constraints against lower states;
- projector penalties;
- state-averaged reduced density matrices;
- block or multi-state optimization;
- tangent-space or correction-vector methods for specific responses.
A projector-penalty target has the schematic form
The penalty strengths, orthogonality errors, and accumulated errors in the lower states must be controlled. An excited-state variational search can converge to the wrong root even when its local residuals are small.
Infinite-system algorithms, dynamical DMRG, finite-temperature purification, and non-Hermitian transfer problems share tensor-network ingredients but have distinct fixed points and validation requirements. They should not be inferred from finite ground-state DMRG without a dedicated analysis.
Exercises
Section titled “Exercises”Exercise 2: Read a two-site truncation
Section titled “Exercise 2: Read a two-site truncation”A normalized two-site center has Schmidt probabilities
If only values are kept, find the discarded weight, retained norm, normalized-state fidelity, and the single-truncation worst-case observable bound.
Solution
The discarded weight is
The unnormalized retained state has norm squared
Its norm is therefore
After normalization, its squared overlap with the original state is
For a bounded observable,
This deliberately loose bound concerns one truncation. It is not a global sweep error estimate.
Exercise 3: Test monotonicity
Section titled “Exercise 3: Test monotonicity”Classify each statement as correct or incorrect.
- An exactly solved one-site update in exact canonical gauge cannot increase the variational energy.
- An exactly solved two-site update cannot increase the energy after SVD truncation.
- The global optimum cannot increase when every allowed bond dimension is enlarged.
- A practical run at larger must always return a lower energy.
Solution
Statement 1 is correct under its assumptions. The previous center tensor belongs to the local search space, so exact minimization cannot do worse.
Statement 2 is incorrect. The pre-truncation local state is variationally improved, but the SVD selects the best state-norm truncation rather than the minimum-energy state at the retained rank.
Statement 3 is correct. Enlarging all bond bounds nests the variational classes, so their exact global minima are monotone.
Statement 4 is incorrect. A practical nonlinear optimization can land in a worse basin, use a looser local tolerance, or target a different effective sector. The variational-class statement does not guarantee algorithmic success.
Exercise 4: Separate local and global residuals
Section titled “Exercise 4: Separate local and global residuals”A run reports
at every center but has
What has converged, and what has not?
Solution
Every recorded center tensor accurately solves its current effective eigenproblem. The full-state residual is larger than the local residuals. It does not by itself set an eigenvector error: that also depends on spectral separation and the energy scale. It shows that local solves alone have not reduced the global residual to the same tolerance.
Possible causes include:
- inadequate bond dimension;
- a sweep that has not reached a fixed point;
- inconsistent or stale environments;
- truncation after accurate local solves;
- convergence to a variationally stationary but imperfect state.
The local residual and global variance answer different questions. The stronger ground-state claim must wait for bond and sweep studies and for the variance to meet the physical target.
References
Section titled “References”- M. B. Hastings, “An Area Law for One-Dimensional Quantum Systems,” Journal of Statistical Mechanics: Theory and Experiment (2007) P08024, doi:10.1088/1742-5468/2007/08/P08024.
- C. Hubig, I. P. McCulloch, U. Schollwöck, and F. A. Wolf, “Strictly Single-Site DMRG Algorithm with Subspace Expansion,” Physical Review B 91, 155115 (2015), doi:10.1103/PhysRevB.91.155115.
- I. P. McCulloch, “From Density-Matrix Renormalization Group to Matrix Product States,” Journal of Statistical Mechanics: Theory and Experiment (2007) P10014, doi:10.1088/1742-5468/2007/10/P10014.
- S. Östlund and S. Rommer, “Thermodynamic Limit of Density Matrix Renormalization,” Physical Review Letters 75, 3537–3540 (1995), doi:10.1103/PhysRevLett.75.3537.
- U. Schollwöck, “The Density-Matrix Renormalization Group,” Reviews of Modern Physics 77, 259–315 (2005), doi:10.1103/RevModPhys.77.259.
- U. Schollwöck, “The Density-Matrix Renormalization Group in the Age of Matrix Product States,” Annals of Physics 326, 96–192 (2011), doi:10.1016/j.aop.2010.09.012.
- N. Schuch, M. M. Wolf, F. Verstraete, and J. I. Cirac, “Entropy Scaling and Simulability by Matrix Product States,” Physical Review Letters 100, 030504 (2008), doi:10.1103/PhysRevLett.100.030504.
- G. K.-L. Chan and S. Sharma, “The Density Matrix Renormalization Group in Quantum Chemistry,” Annual Review of Physical Chemistry 62, 465–481 (2011), doi:10.1146/annurev-physchem-032210-103338.
- Ö. Legeza and J. Sólyom, “Optimizing the Density-Matrix Renormalization Group Method Using Quantum Information Entropy,” Physical Review B 68, 195116 (2003), doi:10.1103/PhysRevB.68.195116.
- F. Verstraete, V. Murg, and J. I. Cirac, “Matrix Product States, Projected Entangled Pair States, and Variational Renormalization Group Methods for Quantum Spin Systems,” Advances in Physics 57, 143–224 (2008), doi:10.1080/14789940801912366.
- S. R. White, “Density Matrix Formulation for Quantum Renormalization Groups,” Physical Review Letters 69, 2863–2866 (1992), doi:10.1103/PhysRevLett.69.2863.
- S. R. White, “Density-Matrix Algorithms for Quantum Renormalization Groups,” Physical Review B 48, 10345–10356 (1993), doi:10.1103/PhysRevB.48.10345.
- E. M. Stoudenmire and S. R. White, “Studying Two-Dimensional Systems with the Density Matrix Renormalization Group,” Annual Review of Condensed Matter Physics 3, 111–128 (2012), doi:10.1146/annurev-conmatphys-020911-125018.
- S. Rommer and S. Östlund, “Class of Ansatz Wave Functions for One-Dimensional Spin Systems and Their Relation to the Density Matrix Renormalization Group,” Physical Review B 55, 2164–2181 (1997), doi:10.1103/PhysRevB.55.2164.