Fact-checked by Grok 2 weeks ago

Density matrix renormalization group

The density matrix renormalization group (DMRG) is a numerical variational algorithm introduced by Steven R. White in 1992 for computing the low-energy physics of strongly correlated quantum many-body systems, particularly in one dimension, by efficiently truncating the exponentially large Hilbert space through the use of reduced density matrices to retain the most entangled and relevant states.^[1] This method optimizes a trial wavefunction, often represented as a matrix product state (MPS), to approximate ground states, low-lying excitations, and dynamic properties with unprecedented accuracy, surpassing traditional techniques like exact diagonalization or quantum Monte Carlo in precision for low-dimensional systems.^[2] DMRG's core innovation lies in its real-space renormalization approach, which iteratively builds and refines system representations while minimizing truncation errors quantified by the eigenvalues of the density matrix.^[3] Developed as an improvement over earlier real-space renormalization group methods that suffered from poor accuracy due to uncontrolled state selection, DMRG was first applied to spin chains like the Heisenberg model, achieving ground-state energy precisions on the order of 10^{-10} relative error for systems with hundreds of sites. Subsequent refinements, such as the infinite-system algorithm by Östlund and Rommer in 1995, enabled efficient extrapolation to the thermodynamic limit, while White and Feiguin's 2004 extension incorporated time evolution for real-time dynamics. By the early 2000s, theoretical connections to quantum information theory revealed DMRG's equivalence to optimizing MPS with bounded entanglement, formalizing its variational principle and spurring broader tensor network methods.^[4] At a high level, DMRG proceeds by dividing the system into a "system block" and an "environment block," combining them into a superblock whose Hamiltonian is diagonalized to find the ground state; the reduced density matrix of the system block then guides the truncation to a fixed number of basis states (typically M ≈ 100–1000), preserving maximal entanglement as measured by the von Neumann entropy.^[2] Infinite- and finite-system variants alternate between growing the system and performing optimization sweeps to converge to the desired accuracy, with error controlled by the discarded weight (sum of neglected density matrix eigenvalues, often <10^{-10}).^[3] This process is computationally efficient, scaling as O(M^3) per sweep for one-dimensional lattices, making it ideal for quasi-one-dimensional geometries. Originally focused on condensed matter models like the Hubbard and t-J Hamiltonians for high-temperature superconductors and quantum antiferromagnets, DMRG has expanded to two-dimensional systems via approximations like stripe or cylinder geometries, quantum chemistry for molecular electronic structure (e.g., active-space calculations of transition metal complexes), nuclear physics for shell-model studies, and even open quantum systems with dissipation.^[2] In the past decade, integrations with tensor processing units and machine learning have accelerated large-scale simulations, while extensions to higher dimensions through projected entangled pair states (PEPS) continue to evolve the framework. Today, DMRG remains a cornerstone for benchmarking quantum many-body theories, with over 10,000 citations to its foundational works underscoring its enduring impact.^[5]

Historical Development

Origins and Early Formulations

The density matrix renormalization group (DMRG) was introduced by Steven R. White in 1992 as a numerical method to efficiently compute the ground states of one-dimensional quantum many-body systems, particularly those with strong correlations, by integrating density matrix-based truncation with real-space renormalization techniques.^[1] This approach built upon earlier renormalization ideas but addressed their shortcomings in handling lattice models through a variational optimization that preserves essential quantum entanglement. The primary motivations for developing DMRG stemmed from the severe limitations of existing numerical methods for strongly correlated systems. Exact diagonalization, while accurate for small systems, suffered from exponential scaling with system size due to the rapid growth of the Hilbert space dimension, rendering it impractical for chains longer than about 20 sites.^[6] Similarly, Kenneth Wilson's numerical renormalization group (NRG), originally formulated in 1975 for impurity problems like the Kondo model, proved inadequate for homogeneous one-dimensional lattice systems because of difficulties in managing energy scale separations and finite-size effects across the entire chain.^[6] DMRG overcame these issues by focusing on low-entanglement states typical in one-dimensional systems, enabling accurate simulations of much larger system sizes while controlling truncation errors more effectively.^[1] White's seminal publication, "Density matrix formulation for quantum renormalization groups," appeared in Physical Review Letters in 1992 and first described the use of the density matrix to identify and retain the most relevant basis states during renormalization, discarding those with negligible contributions to the ground state.^[1] In this work, the method was demonstrated on the spin-1/2 antiferromagnetic Heisenberg chain, a prototypical strongly correlated model where previous techniques struggled with the exponential proliferation of states in the Hilbert space, which grows as 2^L for L sites.^[1] DMRG achieved ground-state energy accuracies better than 10^{-10} per site for chains up to 100 sites, highlighting its superior handling of entanglement compared to ad hoc truncation schemes in earlier renormalization approaches.

Key Milestones and Contributors

In 1993, Steven R. White extended the DMRG method to compute excited states through targeted iterations, where the density matrix is constructed to emphasize specific low-lying eigenstates rather than just the ground state, enabling accurate calculations of energy gaps and spectral properties in one-dimensional quantum systems.^[7] The connection between DMRG and matrix product states was established in 1995 by Stellan Östlund and Stefan Rommer, who demonstrated that DMRG-generated wave functions in the thermodynamic limit with periodic boundary conditions can be represented as matrix product ground states, providing a variational framework that links the method to tensor network ansätze and enhances its theoretical interpretability.^[8] That same year, Tomotoshi Nishino introduced formulations for infinite lattices within DMRG, adapting the algorithm to handle translationally invariant systems without finite-size effects by iteratively refining transfer operators, which improved efficiency for studying bulk properties in extended quantum chains.^[9] Advancements in dynamic simulations emerged in 2004, with Steven R. White and Adrian E. Feiguin developing real-time evolution using the DMRG method, enabling the study of time-dependent phenomena and transport in one-dimensional systems.^[10] Concurrently, Andrew J. Daley and collaborators introduced time-dependent DMRG using adaptive effective Hilbert spaces and Trotter decomposition, facilitating simulations of nonequilibrium dynamics in slightly entangled states.^[11] Ulrich Schollwöck's comprehensive 2005 review solidified DMRG as a standard numerical tool for strongly correlated systems, highlighting its variational power and reporting accuracy benchmarks for one-dimensional models where relative errors in ground-state energies reach $10^{-10} or better, even with modest computational resources.^[9] Key contributors to DMRG's evolution include Steven R. White, the primary inventor who laid its foundational algorithms; Ulrich Schollwöck, whose reviews and applications expanded its scope in condensed matter physics; and Ignacio Cirac, who forged connections to quantum information theory by interpreting DMRG through entanglement measures and periodic boundary adaptations using matrix product operators.^[12]^[9]^[13]

Theoretical Foundations

Density Matrices in Quantum Systems

In quantum mechanics, the density operator, also known as the density matrix, provides a complete statistical description of a quantum system's state, applicable to both pure and mixed configurations. For a pure state represented by the normalized ket vector |\psi\rangle, the density operator is defined as \rho = |\psi\rangle\langle\psi|, which is a Hermitian projector of rank one with unit trace \operatorname{Tr}(\rho) = 1.^[14] In the case of a mixed state, arising from an ensemble of pure states \{p_i, |\psi_i\rangle\} with probabilities p_i \geq 0 satisfying \sum_i p_i = 1 and orthonormal \langle\psi_i|\psi_j\rangle = \delta_{ij}, the density operator generalizes to

\rho = \sum_i p_i |\psi_i\rangle\langle\psi_i|,

which remains Hermitian, positive semi-definite, and trace-normalized.^[14] For composite quantum systems divided into subsystems A and B, the reduced density matrix \rho_A for subsystem A is obtained by performing a partial trace over the degrees of freedom of B on the total density operator \rho_{AB}, yielding \rho_A = \operatorname{Tr}_B(\rho_{AB}).^[15] Assuming the total pure state |\psi\rangle_{AB} = \sum_{kl} c_{kl} |k\rangle_A |l\rangle_B in the product basis \{|k\rangle_A\} \otimes \{|l\rangle_B\}, the partial trace operation is derived as follows: the matrix elements of \rho_A in the A basis are

\langle m|_A \rho_A |n\rangle_A = \sum_p \langle m|_A \langle p|_B |\psi\rangle_{AB} \langle\psi|_{AB} |n\rangle_A |p\rangle_B,

where the sum runs over the complete orthonormal basis \{|p\rangle_B \} of B.^[15] This equivalently computes \rho_A = \sum_p \langle p|_B |\psi\rangle_{AB} \langle\psi|_{AB} |p\rangle_B, effectively averaging over B's basis states to isolate A's local description while preserving all information accessible from measurements on A alone.^[15] The spectrum of \rho_A consists of real, non-negative eigenvalues \{\lambda_i\} that sum to unity \sum_i \lambda_i = 1, interpretable as probabilities in an effective ensemble decomposition of subsystem A.^[14] For a pure total state \rho_{AB} = |\psi\rangle\langle\psi|, these eigenvalues quantify the entanglement between A and B, with \lambda_i \ll 1 signaling low-probability configurations in A that contribute negligibly to observables. The von Neumann entropy of \rho_A, defined as

S(\rho_A) = -\operatorname{Tr}(\rho_A \log \rho_A),

serves as a standard measure of this entanglement, vanishing for separable (product) states and achieving a maximum value of \log d (where d is the dimension of A) for maximally entangled states.^[16] In many-body quantum systems, this entropy is particularly useful for gauging the relevance of basis states, as it highlights the exponential decay of small eigenvalues, enabling efficient approximations by focusing on dominant entanglement structures.^[16]

Renormalization Group Principles

The renormalization group (RG) framework in condensed matter physics provides a systematic approach to understanding the behavior of many-body systems by progressively integrating out short-distance or high-energy degrees of freedom, thereby deriving effective theories that describe long-distance or low-energy physics. This method reveals universal scaling behaviors near critical points, where physical properties depend on coarse-grained scales rather than microscopic details. Developed initially for classical systems and later extended to quantum cases, RG transformations map the original Hamiltonian onto a simpler form at a rescaled lattice spacing, allowing the study of fixed points that govern phase transitions and critical phenomena.^[17] A foundational application of RG principles is Kenneth Wilson's numerical renormalization group (NRG) method, introduced in 1975 for solving one-dimensional quantum impurity problems, such as the Kondo model. In NRG, the system is iteratively diagonalized by adding sites or orbitals one at a time, with the Hilbert space truncated at each step to retain only the lowest-energy states, corresponding to the dominant contributions at successively lower energy scales. This logarithmic discretization of the continuum spectrum enables precise computation of thermodynamic properties and spectral functions in strongly correlated impurity systems.^[17] Unlike momentum-space RG, which integrates out high-momentum fluctuations to probe infrared physics in continuous field theories, real-space RG decimates local degrees of freedom directly on the lattice, making it suitable for discrete lattice models where position-space structure is essential. Momentum-space approaches, common in perturbative quantum field theory, resscale couplings via beta functions derived from loop integrals, but they struggle with non-perturbative lattice effects. Real-space RG, by contrast, constructs effective Hamiltonians for larger blocks of sites, facilitating the analysis of gapped or gapless phases in finite-dimensional systems.^[18] Central to RG methodology are concepts of scaling and fixed points, where repeated transformations drive the system's parameters along flow lines in coupling space toward attractors that dictate the low-energy effective theory. Near a critical fixed point, observables exhibit power-law scaling with exponents determined by the relevant operators' eigenvalues, unifying diverse microscopic models under universality classes. These flows elucidate how irrelevant operators decay, stabilizing the infrared behavior, while relevant ones amplify under coarse-graining, signaling instabilities like phase transitions.^[17] An illustrative analogy for real-space RG arises from block-spin transformations in classical Ising models, as proposed by Leo Kadanoff in 1966. In this approach, spins within small lattice blocks are averaged to form effective "block spins" with renormalized interactions, reducing the system's degrees of freedom while preserving the partition function's scaling form near criticality. This coarse-graining reveals how short-range correlations build long-range order, with the fixed point corresponding to the critical temperature where correlation length diverges. Such methods laid the groundwork for handling spatial hierarchies in statistical mechanics.^[19] Extending block-spin ideas to quantum lattice models requires accounting for non-local entanglement, leading to modern formulations via tensor network representations that systematically disentangle states during RG iterations. These quantum adaptations maintain the spirit of real-space decimation but incorporate multi-site interactions through tensor contractions, enabling efficient flows toward low-entanglement fixed points.^[20] Early real-space RG methods for quantum systems, such as simple energy-based truncations, often suffered from inaccuracies due to the neglect of entanglement structure, resulting in poor retention of correlated low-energy states across blocks. This loss of quantum information motivated improvements using the density matrix, where eigenvalues guide truncation by weighting states according to their entanglement contributions to the full system's reduced description.^[21]

Core Algorithm

Iterative Block Construction

The iterative block construction in the density matrix renormalization group (DMRG) method forms the core of its algorithm for approximating ground states of quantum many-body systems, particularly in one dimension. It begins with an initial block consisting of a single lattice site, represented in the local Hilbert space basis. For a spin-1/2 system, such as the Heisenberg model, this basis includes states like spin up (↑) and spin down (↓), yielding a 2-dimensional Hilbert space for the block. The block Hamiltonian \hat{H}_B at this stage is simply the on-site term, often zero for pure spin models without magnetic fields. To simulate an open-boundary chain while approximating the infinite lattice, the initial block is embedded in a "universe" constructed as a mirror image of the block itself, reflecting the sites to enforce particle-hole or spin-flip symmetry where applicable. This universe serves as the environment, allowing the interaction terms between the block and its surroundings to be represented exactly for the small effective system. The superblock Hamiltonian is then assembled as \hat{H}_\text{super} = \hat{H}_B + \hat{H}_E + \hat{H}_{B-E}, where \hat{H}_E is the Hamiltonian of the environment (the mirrored block), and \hat{H}_{B-E} captures the interactions, such as nearest-neighbor couplings \sum_i J \hat{\mathbf{S}}_i \cdot \hat{\mathbf{S}}_{i+1} across the block-environment boundary. This formulation ensures open boundary conditions without explicit long-range correlations initially. The process proceeds iteratively by growing the block one site at a time. After diagonalizing the superblock Hamiltonian to obtain an approximate ground state wavefunction, the block is enlarged by incorporating an additional site, updating \hat{H}_B to include the new intra-block interactions and the wavefunction coefficients via a transformation matrix. For example, starting from a 1-site block, the first superblock is 2 sites; growing to a 2-site block yields a 4-site superblock. The environment is similarly updated by mirroring the enlarged block, and the superblock is reconstructed for the next iteration. This step-by-step addition continues across sweeps through the lattice, progressively building toward the full system size while maintaining computational tractability. Each growth step refines the representation of the system's correlations near the block. For small systems, the superblock Hamiltonian can be explicitly represented in matrix form and diagonalized to find the lowest eigenvalue, approximating the ground state energy for the superblock. Following this, truncation based on the reduced density matrix selects retained states for the next block enlargement.

Truncation via Density Matrix

In the density matrix renormalization group (DMRG) algorithm, the truncation step occurs after diagonalizing the superblock Hamiltonian H_{\text{super}} to obtain its ground state |\psi\rangle, which is represented in the product basis of the system block and its environment. The reduced density matrix for the block, \rho_{\text{block}} = \mathrm{Tr}_{\text{env}} (|\psi\rangle\langle\psi|), is then computed by tracing out the environmental degrees of freedom, yielding a Hermitian operator whose matrix elements are \langle i | \rho_{\text{block}} | i' \rangle = \sum_j \psi_{i j} \psi_{i' j}^*, where \psi_{i j} are the coefficients of |\psi\rangle in the block-environment basis with i indexing block states and j indexing environment states.^[22] To identify the most relevant states for the new block basis, the coefficient matrix C with elements C_{i j} = \psi_{i j} undergoes singular value decomposition (SVD), C = U \Sigma V^\dagger, where U contains the left singular vectors corresponding to the block.^[1] The eigenvalues \lambda_k of \rho_{\text{block}} are the squares of the singular values \sigma_k (normalized such that \sum_k \lambda_k = 1 and \lambda_k \geq 0), and the dominant eigenvectors are the columns of U associated with the largest \lambda_k.^[22] This SVD approach equivalently diagonalizes \rho_{\text{block}} directly, \rho_{\text{block}} = \sum_k \lambda_k |u_k\rangle \langle u_k|, selecting the states |u_k\rangle that capture the entanglement structure between block and environment. The truncation criterion retains the m states with the largest eigenvalues \lambda_i, ensuring the kept weight \sum_{i=1}^m \lambda_i \approx 1 - \epsilon, where the discarded fraction \epsilon is typically set below $10^{-10} to maintain high accuracy while controlling computational cost.^[22] The new block basis is formed by these m eigenvectors, and the block Hamiltonian (along with other operators) is projected onto this truncated space using the projection matrix P whose columns are the kept |u_i\rangle, yielding the updated block Hamiltonian H_{\text{block}}' = P^\dagger H_{\text{block}} P.^[22] This truncation introduces an error bounded by the sum of the discarded eigenvalues \epsilon = \sum_{i>m} \lambda_i, which provides a direct measure of the fidelity loss in the wavefunction; specifically, the error in any expectation value \langle A \rangle satisfies |\langle A \rangle_{\text{approx}} - \langle A \rangle| \leq 2 \epsilon \sqrt{\langle A^\dagger A \rangle}, ensuring the approximate energy remains a variational upper bound to the true ground-state energy. The rapid decay of \lambda_i for gapped one-dimensional systems guarantees that \epsilon decreases exponentially with m, making the method highly efficient.^[1]

Practical Implementation

Matrix Product States Formalism

The matrix product state (MPS) formalism reformulates the density matrix renormalization group (DMRG) as a variational optimization over a parameterized class of quantum states suitable for one-dimensional systems with low entanglement. In this representation, the many-body wave function |\psi\rangle for a chain of N sites is expressed as

|\psi\rangle = \sum_{\{s_i\}} \operatorname{Tr} \left( A^{s_1}_{\alpha \beta} A^{s_2}_{\beta \gamma} \cdots A^{s_N}_{\zeta \omega} \right) |s_1 s_2 \cdots s_N \rangle,

where each A^{s_i}_{\alpha_{i-1} \alpha_i} is a matrix of dimension d \times \chi \times \chi (with physical dimension d and bond dimension \chi), the trace enforces periodicity, and the sums run over local basis states s_i and virtual bond indices \alpha_i = 1, \dots, \chi. This ansatz efficiently captures states obeying an area-law entanglement structure, as the bond dimension \chi limits the entanglement across any bipartition. DMRG sweeps in the MPS framework correspond to iteratively optimizing these tensors to approximate the ground state of a local Hamiltonian H = \sum_i h_i, where each h_i acts on a few neighboring sites. Starting from an initial MPS, the algorithm identifies an "orthogonality center" site and solves a local eigenvalue problem for the effective Hamiltonian acting on that site and its neighbors, updating the corresponding tensors variationally to minimize the Rayleigh quotient \langle \psi | H | \psi \rangle / \langle \psi | \psi \rangle. This process is swept across the chain, with singular value decompositions (SVDs) used to recenter the orthogonality and enforce the MPS form after each update, ensuring numerical stability and convergence to low-energy states. The optimization is equivalent to the original DMRG truncation procedure, where the density matrix eigenvalues determine the retained states, but the MPS view generalizes it to a tensor network language. MPS can be transformed into a canonical form by successive SVDs, where all tensors except one (the orthogonality center) are left- or right-normalized, satisfying \sum_{s_i} (A^{s_i})^\dagger A^{s_i} = I or the transpose equivalent. At any bond, the SVD relates directly to the Schmidt decomposition of |\psi\rangle across the bipartition, with the singular values encoding the entanglement spectrum and the reduced density matrix eigenvalues \lambda_\alpha^2. The bond dimension \chi thus controls the maximum representable entanglement, with the required \chi scaling roughly as \chi \sim e^S in systems where S is the entanglement (von Neumann) entropy across the bond; for critical one-dimensional systems, S \sim \log L implies polynomial growth in \chi with system size L. This entanglement scaling underpins DMRG's efficiency for gapped and critical phases alike. The truncation error arises from discarding small singular values beyond \chi, preserving the dominant entanglement contributions.

Numerical and Computational Aspects

In the implementation of the density matrix renormalization group (DMRG), the choice of the basis truncation parameter m (also denoted as the bond dimension \chi in the matrix product states formalism) is crucial for balancing computational accuracy and efficiency. For one-dimensional chains, m is typically set between 100 and 1000, with lower values (around a few hundred) sufficing for gapped spin systems and higher values (up to a thousand) required for gapless or electronic problems to achieve high precision.^[3]^[2] This selection ensures that the discarded weight of the density matrix remains small, on the order of $10^{-10} or less, minimizing truncation errors while keeping memory and time costs manageable.^[3] Sweep protocols form the core of the iterative optimization in finite-system DMRG, involving forward and backward passes across the chain to refine the wave function. Convergence is typically monitored by the change in the ground-state energy \delta E between sweeps, halting the process when \delta E < 10^{-12} (in absolute units, often normalized by system size).^[3] This criterion ensures that the energy per site error scales linearly with the truncated eigenvalue weight \epsilon_\rho, providing reliable variational upper bounds.^[3] Efficient storage of operators is essential for practical coding, particularly for the block Hamiltonian H_\mathrm{block} and single-site creation/annihilation operators in the truncated basis. These are represented as dense matrices within the reduced basis, often exploiting symmetries such as U(1) conservation of particle number or total spin to block-diagonalize and reduce storage from O(m^2) to smaller sectors.^[3] This approach minimizes memory usage during the diagonalization steps, where the full Hamiltonian for the extended block is constructed on-the-fly from pre-stored components. The computational complexity of DMRG arises primarily from the diagonalization of the effective Hamiltonian at each site addition, scaling as O(m^3) due to dense matrix-vector multiplications or eigensolver operations. For a chain of N sites, the total cost per full sweep is thus O(N m^3), making it feasible for systems up to hundreds of sites on standard hardware when m is in the hundreds.^[3]^[2] Boundary conditions significantly influence the numerics, with open boundaries being the default in finite-system DMRG due to their simplicity in block construction. Periodic boundaries require modifications, such as the infinite DMRG (iDMRG) variant, which approximates translationally invariant infinite systems by iteratively optimizing a unit cell with auxiliary boundary sites, avoiding finite-size effects at the cost of adjusted truncation procedures.^[3] As of 2025, practical implementations of DMRG are supported by numerous open-source software packages, including ITensor, TeNPy, and Quimb, which facilitate efficient coding and exploitation of modern hardware. Recent advances include parallel and GPU-accelerated versions, enabling simulations with larger bond dimensions and system sizes on multi-core CPUs and GPUs.^[23]^[24]

Applications

Ground and Excited States in 1D Systems

The density matrix renormalization group (DMRG) excels in computing ground states of one-dimensional (1D) strongly correlated quantum systems through variational minimization of the energy in a progressively refined Hilbert space basis.^[3] For the spin-1 Heisenberg antiferromagnet, DMRG achieves ground-state energies accurate to within approximately $10^{-10} of the exact value for chains up to N=100 sites, with a typical discarded weight during truncation on the order of $10^{-13} when retaining around 180 states per block.^[3] This high precision arises from the method's ability to capture essential quantum entanglement via eigenstates of the block density matrix, enabling reliable extrapolation to the thermodynamic limit even for gapless systems where entanglement grows slowly.^[3] Low-lying excited states are obtained by extending the DMRG optimization to target multiple eigenstates simultaneously, often using orthogonalization techniques to ensure separation from the ground state.^[3] A key approach is the correction vector method, which generates an approximate excited state by applying the operator (H - E_0) to the ground state wave function |\psi_0\rangle, where H is the Hamiltonian and E_0 its ground-state eigenvalue, followed by DMRG optimization in the orthogonal complement. This yields excitation energies with accuracies comparable to ground-state computations, typically within $10^{-8} to $10^{-10} relative error for 1D spin chains.^[3] Spectral functions, which probe excitation spectra and gaps, are computed within the DMRG framework by combining ground- or excited-state wave functions with techniques like the Lanczos algorithm or continued-fraction expansion in the retained basis.^[3] The Lanczos method iteratively builds a tridiagonal representation of the Hamiltonian restricted to the DMRG subspace, allowing efficient calculation of dynamic correlation functions such as the dynamical structure factor, with resolutions sufficient to resolve gaps on the order of $10^{-3} J (where J is the exchange coupling) in gapped 1D models.^[3] For gapless systems, these methods reveal continua of excitations, like spinons in the Heisenberg chain, by analytically continuing imaginary-time correlators.^[3] Truncation errors are controlled to ensure spectral features remain faithful, as detailed in the truncation procedure.^[3] DMRG has resolved detailed phase diagrams for 1D models exhibiting quantum phase transitions, particularly in the XXZ Heisenberg chain H = J \sum_i (S_i^x S_{i+1}^x + S_i^y S_{i+1}^y + \Delta S_i^z S_{i+1}^z), where the anisotropy parameter \Delta tunes between XY-like (|\Delta| < 1), isotropic Heisenberg (\Delta = 1), and Ising antiferromagnetic (\Delta > 1) phases.^[3] By computing ground-state energies, entanglement entropy, and correlation lengths across \Delta, DMRG identifies the Berezinskii-Kosterlitz-Thouless transition at \Delta = 1 (from gapless to gapped) with high precision, capturing exponential decay of density-matrix eigenvalues in gapped regimes.^[3] Benchmarks against exact solutions highlight DMRG's reliability: for integrable models like the XXZ chain, DMRG energies and correlations match Bethe ansatz results to within $10^{-10} for finite chains up to N \approx 100, enabling accurate finite-size scaling.^[3] In non-integrable cases, such as frustrated or disordered 1D systems where Bethe ansatz fails, DMRG provides superior accuracy compared to alternatives like quantum Monte Carlo, which suffer from sign problems, achieving errors below $10^{-8} for ground states and reliably resolving subtle phase boundaries.^[3]

Dynamics and Non-Equilibrium Phenomena

The time-dependent density matrix renormalization group (t-DMRG) extends the DMRG framework to simulate real-time evolution in one-dimensional quantum systems, particularly for studying non-equilibrium phenomena following sudden changes in the Hamiltonian parameters, known as quantum quenches. In t-DMRG, the initial state is represented as a matrix product state (MPS), and the time evolution is approximated by evolving this state while maintaining the MPS form through periodic truncations based on the density matrix spectrum. Two primary methods are employed: the time-evolving block decimation (TEBD) algorithm, which uses a Trotter-Suzuki decomposition to approximate the time-evolution operator as a product of local gates applied sequentially, and the time-dependent variational principle (TDVP), which minimizes the action along the MPS manifold to derive equations of motion for the tensor elements.^[11] These approaches enable accurate simulations of dynamics for moderately sized systems, with TEBD being particularly efficient for short-time evolution under local Hamiltonians. In quench dynamics, t-DMRG is used to compute time-dependent observables, such as spatial correlation functions that reveal the propagation of information and correlations after the quench. For instance, in spin-1/2 chains like the XXZ model, one can calculate the z-component spin correlation function C(r,t) = \langle S_0^z S_r^z(t) \rangle, where the expectation value is taken with respect to the post-quench Hamiltonian, starting from the pre-quench ground state. These correlations typically spread ballistically in integrable systems, with a light-cone structure governed by the Lieb-Robinson bound, which limits the speed of information propagation to a finite velocity. Post-quench, the entanglement entropy across a cut in the chain exhibits linear growth, S(t) \sim v_E t, where v_E is the entanglement velocity, often comparable to the Lieb-Robinson velocity and dependent on the model's criticality; this growth saturates at longer times due to finite system size. The accuracy of t-DMRG simulations is constrained by the exponential growth of the required MPS bond dimension \chi with time, roughly \chi \sim \exp(\gamma t), where \gamma is a rate set by the local energy scale (e.g., the exchange coupling J), limiting reliable results to short times t \lesssim 1/J without adaptive bond dimension increases or other optimizations. This growth arises from the accumulation of entanglement during evolution, necessitating frequent truncations that introduce errors if \chi is insufficient. Despite these limits, t-DMRG has been instrumental in studying transport properties in non-equilibrium settings, such as computing the Drude weight D = \lim_{t \to \infty} \frac{1}{t} \int_0^t dt' \langle J(0) J(t') \rangle in integrable models like the Heisenberg chain, where ballistic transport leads to a finite D even at finite temperatures, contrasting with diffusive behavior in non-integrable cases.

Illustrative Examples

Quantum Heisenberg Model

The one-dimensional spin-1/2 antiferromagnetic Heisenberg model serves as an exemplary system for demonstrating the application of the density matrix renormalization group (DMRG) method, highlighting its ability to accurately capture ground-state properties in strongly correlated spin chains. The Hamiltonian for this model is given by

H = J \sum_{i=1}^{N-1} \mathbf{S}_i \cdot \mathbf{S}_{i+1},

where \mathbf{S}_i are the spin-1/2 operators at site i, J = 1 sets the energy scale for the antiferromagnetic coupling, and open boundary conditions are imposed to facilitate the iterative block growth in DMRG.^[25] The DMRG procedure begins with an initial block consisting of a single site. For this block, the Hamiltonian is H_\text{block} = 0, and the basis states are the spin-up and spin-down states |\uparrow\rangle and |\downarrow\rangle, spanning a two-dimensional Hilbert space. No truncation is needed at this stage, as the block is minimal.^[25] In the next step, a superblock is formed by attaching an additional site to the initial block, creating a two-site system. The superblock Hamiltonian is a 4×4 matrix representing the Heisenberg interaction between the two sites, which is diagonalized to obtain the ground-state energy E_0 = -0.75. The corresponding energy per site is -0.375, providing an initial estimate that improves toward the infinite-chain limit value of approximately -0.443 upon further iterations. The ground state is the singlet configuration, reflecting the antiferromagnetic tendency.^[25] To prepare for growing the system while controlling the Hilbert space dimension, the reduced density matrix \rho_\text{block} for the initial block is computed by tracing out the added site from the ground-state density operator of the superblock. The eigenvalues of \rho_\text{block} are 0.5 and 0.5 in this step, corresponding to equal weights for the up and down states in the singlet. Truncation is performed by retaining the m largest eigenvalues (here, m=2, retaining the full space for this small block) to form the new block basis, ensuring minimal loss of entanglement information as detailed in the general truncation procedure.^[25] The block Hamiltonian and operators (such as \mathbf{S}_i) are then updated by projecting them onto the truncated basis using the eigenvectors of \rho_\text{block}. This enlarged block now represents an effective two-site system. The process iterates by repeatedly forming larger superblocks (adding sites to one or both ends), diagonalizing to find the ground state, computing and diagonalizing \rho_\text{block}, truncating to a fixed m (typically increasing gradually, e.g., up to 10–20 for convergence), and updating operators. For a chain of N=10 sites after several iterations, the energy per site converges to a value closely approaching the thermodynamic limit of -\ln 2 + 1/4 \approx -0.443147.^[25] From the converged DMRG wavefunction, additional observables are extracted. The staggered magnetization, defined as m_s = \frac{1}{N} \sum_{i=1}^N (-1)^i \langle \mathbf{S}_i^z \rangle, exhibits an alternating profile due to open boundaries, with end-site values around 0.65 decreasing toward the bulk, reflecting surface effects in the finite chain; in larger systems (N \gtrsim 50), bulk values approach 0, consistent with the absence of long-range order. The spin correlation length \xi is estimated by fitting the decay of \langle \mathbf{S}_0 \cdot \mathbf{S}_r \rangle \sim (-1)^r / r^\eta (with \eta \approx 1), yielding \xi on the order of the system size for finite N, indicating power-law correlations that diverge in the thermodynamic limit. These results demonstrate DMRG's precision for critical systems like the Heisenberg chain.

Extended Hubbard Model

The extended Hubbard model extends the standard Hubbard model by including nearest-neighbor density-density interactions, making it a prototypical fermionic system for studying competing orders such as spin-density waves (SDW) and charge-density waves (CDW) in one dimension. The Hamiltonian for the one-dimensional chain at half filling is given by

H = -t \sum_{i,\sigma} \left( c_{i\sigma}^\dagger c_{i+1\sigma} + \mathrm{h.c.} \right) + U \sum_i n_{i\uparrow} n_{i\downarrow} + V \sum_i n_i n_{i+1},

where c_{i\sigma}^\dagger (c_{i\sigma}) creates (annihilates) a fermion with spin \sigma at site i, n_{i\sigma} = c_{i\sigma}^\dagger c_{i\sigma}, n_i = n_{i\uparrow} + n_{i\downarrow}, t > 0 is the hopping amplitude, U > 0 is the on-site repulsion, and V > 0 is the nearest-neighbor repulsion. In one dimension, the fermionic operators can be mapped to spin-1/2 operators via the Jordan-Wigner transformation, allowing the use of spin-based DMRG algorithms, but direct fermionic implementations are preferred for efficiency and to explicitly enforce particle-number conservation.^[9] These implementations project the Hilbert space onto fixed total electron number N_e = L/2 (for chain length L at half filling) and total spin projection S_z = 0, reducing computational cost by blocking states into charge and spin sectors during block construction.^[9] During iterative block construction and sweeps, the basis for each block site includes states tracking the local charge (0, 1↑, 1↓, or 2 electrons) and spin configurations, with the full many-body states labeled by the conserved N_e and S_z. Truncation is performed separately in each symmetry sector of the density matrix to retain the most relevant states, typically keeping m \approx 200 states per sector for parameters like U/t = 8 and V/t = 1.5 to achieve convergence in energy to within $10^{-6} t.^[26] DMRG calculations reveal quantum phase transitions involving an SDW phase (dominated by antiferromagnetic correlations for small V), an intermediate bond-order-wave (BOW) phase, and a CDW phase (with alternating charge density), with the SDW-BOW and BOW-CDW transitions occurring near V \approx U/2 for U/t \gtrsim 2, where the BOW region narrows in the strong-coupling limit. In the CDW phase, DMRG computes density oscillations \langle n_i \rangle showing period-2 modulation with amplitude increasing in the ordered state for chains up to L = 100 sites.^[26]^[27] For validation, DMRG ground-state energies agree with exact diagonalization results on small clusters (L \leq 16) to better than 0.1% relative error, demonstrating the method's accuracy even near the transitions where correlations are strongest.

Extensions and Modern Variants

Infinite DMRG for Periodic Systems

The infinite density matrix renormalization group (iDMRG), introduced by Östlund and Rommer in 1995, extends the DMRG method to translationally invariant infinite one-dimensional quantum systems, enabling direct access to the thermodynamic limit without finite-size effects.^[8] By focusing on a representative unit cell and iteratively optimizing it under periodic boundary conditions, iDMRG approximates the ground state as a matrix product state (MPS) that is periodic with the lattice translation symmetry. This approach is particularly suited for gapped systems where correlations decay exponentially, allowing efficient truncation of the bond dimension.^[9] In iDMRG, the system is modeled using a two-site unit cell to capture the translational invariance, with the block represented by the left half (optimized tensor A) and the environment by the right half (optimized tensor B). Periodicity is enforced through the MPS transfer matrix, which propagates the state across the infinite chain while maintaining the unit cell structure.^[9] The algorithm proceeds via fixed-point iterations, where the MPS transfer operator E = \sum_s A^{s\dagger} A^s (for left-normalized tensors A, summed over physical indices s) is converged by alternately optimizing the A and B tensors in the unit cell. The ground-state energy per site is then obtained from the dominant eigenvalue \lambda_{\max} of the Hamiltonian transfer operator, yielding e_0 = \lambda_{\max} / \mathrm{Tr}(E), where Tr(E) normalizes the state. To extract physical properties, iDMRG scales the bond dimension \chi to convergence, as larger \chi captures longer-range correlations.^[9] Correlation functions C(r) decay exponentially as C(r) \sim \exp(-r / \xi), with the correlation length \xi determined from the ratios of transfer matrix eigenvalues beyond the dominant one. This provides a spectrum of correlation lengths associated with different excitations.^[9] A key advantage of iDMRG is its ability to reach the exact thermodynamic limit efficiently, as demonstrated in the spin-1/2 antiferromagnetic Heisenberg chain, where the ground-state energy per site e_0 = -\ln 2 + 1/4 \approx -0.443147 is matched to machine precision with sufficient [\chi](/page/Chi).^[9] The implementation involves alternating sweeps: first optimizing all A tensors across the unit cell while fixing B, then optimizing B while fixing A, repeating until the transfer operator stabilizes. This process leverages the MPS formalism for low entanglement states, ensuring high accuracy for periodic 1D systems.^[8]

Multi-Dimensional and Higher-Order Extensions

The density matrix renormalization group (DMRG), originally formulated for one-dimensional systems, faces significant challenges when extended to two dimensions due to the exponential growth in computational cost associated with higher entanglement. To address this, quasi-one-dimensional approximations such as striped DMRG have been developed, where a two-dimensional lattice is mapped onto a chain by treating narrow cylinders or ladders as effective one-dimensional paths. This approach allows accurate simulations of two-dimensional phenomena, such as stripe order in underdoped Hubbard models on cylinders up to width 10, by leveraging periodic boundary conditions in the transverse direction while applying standard DMRG sweeps along the length.^[28] However, the bond dimension required grows exponentially with the cylinder width, limiting full two-dimensional fidelity to quasi-one-dimensional geometries.^[29] A more direct generalization to two dimensions is provided by projected entangled pair states (PEPS), which extend the matrix product state (MPS) formalism to lattices with coordination number greater than two. In PEPS, the wave function is represented by local tensors with physical indices and multiple virtual (bond) indices corresponding to neighboring sites, enabling an efficient encoding of states that obey an area law for entanglement entropy in gapped systems. Optimization of PEPS proceeds via DMRG-inspired variational methods, such as simple update or full update algorithms, which iteratively refine tensors through imaginary-time evolution and environment contractions using techniques like the corner transfer matrix renormalization group (CTMRG). These methods yield accurate ground states for two-dimensional gapped quantum systems, including the quantum Ising and Heisenberg models on square lattices, with bond dimensions typically up to 20-50 for convergence within chemical accuracy.^[30]^[31] Higher-order tensor network structures further extend DMRG principles to capture more complex entanglement patterns. Tree tensor networks (TTNs) introduce a hierarchical branching structure, approximating states with logarithmic entanglement growth suitable for critical points in one dimension and quasi-two-dimensional systems, by recursively coarse-graining sites into effective degrees of freedom. For truly two-dimensional critical systems, the multi-scale entanglement renormalization ansatz (MERA) offers a powerful alternative, introduced by Vidal in 2007, which builds scale-invariant layers through disentanglers and isometries to represent ground states with conformal invariance. MERA efficiently approximates critical one- and two-dimensional systems, such as the transverse-field Ising model at criticality, by encoding renormalization group flows and enabling computations of entanglement entropy with logarithmic corrections to the area law.^[32] Recent developments post-2015 have integrated DMRG-inspired techniques into multi-dimensional quantum chemistry via density matrix embedding theory (DMET), which embeds finite active spaces (impurities) into a mean-field bath using density matrices to capture strong correlations across extended orbital spaces. In DMET, the impurity problem is often solved with DMRG or complete active space methods, allowing treatment of two-dimensional-like molecular systems, such as transition metal complexes, with reduced computational scaling compared to full configuration interaction. This approach has demonstrated high accuracy for ground-state energies in Hubbard dimers and larger clusters, bridging one-dimensional DMRG efficiency with higher-dimensional electron correlations.^[33] As of 2025, further advances include GPU-accelerated implementations, such as NVIDIA's cuQuantum library supporting DMRG for large-scale dynamics, and multi-target extensions like DMRG-X for efficient excited-state calculations in strongly correlated systems.^[34]^[35] Despite these advances, extensions to higher dimensions encounter fundamental challenges, particularly at two-dimensional critical points where the area law for entanglement entropy is violated by logarithmic or power-law terms, necessitating a bond dimension \chi that scales as \chi \sim L^\kappa with \kappa > 0 and system linear size L. This growth arises from long-range power-law correlations and topological obstructions, rendering exact contractions computationally intractable and requiring approximate schemes that trade accuracy for feasibility in non-gapped phases.^[31]

References

[1]
https://doi.org/10.1103/PhysRevLett.69.2863
[2]
https://doi.org/10.1103/RevModPhys.77.259
[3]
[cond-mat/0409292] The density-matrix renormalization group - arXiv
Sep 11, 2004 · The density-matrix renormalization group (DMRG) is a numerical algorithm for the efficient truncation of the Hilbert space of low-dimensional strongly ...
[4]
https://doi.org/10.1016/j.aop.2010.09.012
[5]
Density matrix renormalization group, 30 years on - Nature
Apr 11, 2023 · The density matrix renormalization group (DMRG) algorithm pioneered by Steven White in 1992 is a variational optimization algorithm that physicists use to find ...
[6]
https://doi.org/10.1038/s42254-023-00572-5
[7]
Density-matrix algorithms for quantum renormalization groups
Oct 1, 1993 · A formulation of numerical real-space renormalization groups for quantum many-body problems is presented and several algorithms utilizing this formulation are ...
[8]
Thermodynamic Limit of Density Matrix Renormalization
Nov 6, 1995 · We show that quantum states in the thermodynamic limit with periodic boundary conditions can be simply represented by a “matrix product ground state”
[9]
The density-matrix renormalization group | Rev. Mod. Phys.
Apr 26, 2005 · The density-matrix renormalization group (DMRG) is a numerical algorithm for the efficient truncation of the Hilbert space of low-dimensional strongly ...Article Text · Key Aspects of DMRG · DMRG Theory · Transfer-Matrix DMRG...
[10]
[cond-mat/0403313] Time-dependent density-matrix renormalization ...
Mar 12, 2004 · An algorithm for the simulation of the evolution of slightly entangled quantum states has been recently proposed as a tool to study time-dependent phenomena.
[11]
Density matrix formulation for quantum renormalization groups
Nov 9, 1992 · A generalization of the numerical renormalization-group procedure used first by Wilson for the Kondo problem is presented.
[12]
Density Matrix Renormalization Group and Periodic Boundary ...
We introduce a picture to analyze the density matrix renormalization group (DMRG) numerical method from a quantum information perspective.
[13]
[PDF] Density Matrices - CMU Quantum Theory Group
Density matrices are employed in quantum mechanics to give a partial description of a quantum system, one from which certain details have been omitted.
[14]
[PDF] Quantum States and Partial Trace - Ryan LaRose
The density matrix of a pure state {(1, |ψ⟩)} is given by ρ = |ψ⟩⟨ψ|. (6.7) where |ψ⟩ is a normalized wavefunction. For a mixed state, we can weight each outer ...
[15]
[PDF] Entanglement, Electron Correlation, and Density Matrices
For a pure bipartite state, it is possible to show that the von Neumann entropy of its reduced density matrix, Sًrredق¼ Trًrred log2 rredق, has all the above.
[16]
The renormalization group: Critical phenomena and the Kondo ...
Oct 1, 1975 · This review covers renormalization group ideas, including the Kondo Hamiltonian, block spin methods, and critical phenomena.Missing: Numerical | Show results with:Numerical
[17]
[PDF] Chapter 3 The Renormalization Group in Momentum Space - Chimera
The alternative to the real-space RG methods discussed in the preced- ing chapter is the momentum space formulation, where the degrees of freedom of a system ...
[18]
Scaling laws for ising models near | Physics Physique Fizika
A model for describing the behavior of Ising models very near T c is introduced. The description is based upon dividing the Ising model into cells.Missing: block spin
[19]
Entanglement Renormalization | Phys. Rev. Lett.
Nov 28, 2007 · We propose a real-space renormalization group (RG) transformation for quantum systems on a D -dimensional lattice.
[20]
Real-space quantum renormalization groups | Phys. Rev. Lett.
Jun 15, 1992 · Real-space quantum renormalization groups are techniques for solving quantum many-body problems, but have had little success. The standard ...
[21]
https://link.aps.org/doi/10.1103/PhysRevLett.68.3487
[22]
Infinite DMRG algorithm for the Heisenberg chain
The goal of this exercise is to implement the infinite version of the DMRG algorithm for the antiferromagnetic Heisenberg chain of spins one-half.
[23]
[PDF] Introduction to the density-matrix renormalization group
published papers on the topic ”density[-]matrix renormalization (OR renormalisation)”. • citations to Steve White's original paper [PRL 69, 2863-2866 (1992)], ...
[24]
Stripe order in the underdoped region of the two-dimensional ...
Dec 1, 2017 · DMRG is a variational wave function approximation using matrix product states (MPS), which are low-entanglement states with a 1D entanglement ...
[25]
[PDF] arXiv:1105.1374v2 [cond-mat.str-el] 25 Aug 2011
Aug 25, 2011 · This paper discusses the Density Matrix Renormalization Group (DMRG) method, a powerful numerical method for studying two-dimensional quantum ...Missing: tutorial | Show results with:tutorial
[26]
https://www.issp.u-tokyo.ac.jp/public/CQCP/26dmrg_issp1.pdf
[27]
Matrix product states and projected entangled pair states: Concepts ...
Dec 17, 2021 · Matrix product states and projected entangled pair states describe many-body wave functions in terms of local tensors is reviewed.
[28]
A class of quantum many-body states that can be efficiently simulated
Oct 12, 2006 · We introduce the multi-scale entanglement renormalization ansatz (MERA), an efficient representation of certain quantum many-body states on a D-dimensional ...Missing: 2007 | Show results with:2007
[29]
A Practical Guide to Density Matrix Embedding Theory in Quantum ...
May 9, 2016 · QC-DMET: Python implementation of density matrix embedding theory for ab initio quantum chemistry. ... DMRG within the DMET framework. The ...