Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2512.22021

Site-Order Optimization in the Density Matrix Renormalization Group via Multi-Site Rearrangement

Ryo Watanabe, Toshiya Hikihara, Hiroshi Ueda

cond-mat.stat-mechquant-phSubmitted Dec 26, 2025• Announced Dec 29, 2025• 0 citations
v1 · Dec 26, 2025v2 · Jan 6, 2026
arXivHTMLPDF

Abstract

In the approaches based on matrix-product states (MPSs), such as the density-matrix renormalization group (DMRG) method, the ordering of the sites crucially affects the computational accuracy. We investigate the performance of an algorithm that searches for the optimal site order by iterative local site rearrangement. We improve the algorithm by expanding the range of site rearrangement and apply it to a one-dimensional quantum Heisenberg model with random site permutation. The results indicate that increasing the range of the site rearrangement significantly improves the computational accuracy of the DMRG method. In particular, increasing the rearrangement range from two to three sites reduces the average relative error in the ground-state energy by 65% to 94% in the cases we tested. We also discuss the computational cost of the algorithm and its application as a preprocessing for MPS-based calculations.

Comments
12 pages, 8 figures, 3 tables

Related papers

Zero-site density matrix renormalization group and the optimal low-rank correction

Y. Núñez-Fernández, Gonzalo Torroba

A zero-site density matrix renormalization algorithm (DMRG0) is proposed to minimize the energy of matrix product states (MPSs). Instead of the site tensors themselves, we propose to optimize sequentially the ``message'' tensors between neighbor sites, which contain the singular values of the bipartition. This leads to a local minimization step that is independent of the physical dimension of the site. Conceptually, it separates the optimization and decimation steps in DMRG. Furthermore, we introduce two global perturbations based on the optimal low-rank correction to the current state, which are used to avoid local minima. They are determined variationally as the MPSs closest to the one-step correction of the Lanczos or Jacobi-Davidson eigensolver. These perturbations mainly decrease the energy and are free of hand-tuned parameters. Compared to existing single-site enrichment proposals, our approach gives similar convergence ratios per sweep, while the computations are cheaper by construction. Our methods may be useful in systems with many physical degrees of freedom per lattice site. We test our approach on the periodic Heisenberg spin chain for various spins and on free electrons on the lattice.

arXiv:1908.10880•Physical review. B./Physical review. B•Feb 24, 2020•2 citations

Optimizing over several sites in DMRG to find quantum ground states is NP-hard

Jens Eisert

The density matrix renormalization group (DMRG) approach is arguably the most successful method to numerically approximate ground states of quantum spin chains. It essentially amounts to iteratively locally optimizing matrix-product states, aiming at better and better approximating the true ground state. Despite considerable effort, to date both a proof of convergence of this procedure to the globally best approximation and an assessment of its complexity are lacking. Here, we rigorously establish a statement on the classical complexity of an approximation with matrix-product states: the surprising result is that when one globally optimizes matrix-product states with respect to several sites simultaneously - to find the optimal approximation over several sites at once, avoiding local optima - one encounters in the worst case a computationally difficult NP-hard problem. We prove this by exploiting a novel way of polynomially relating it to binary quadratic programming. This is true even for translationally invariant local hamiltonians. This result gives rise to intriguing ramifications on the difficulty of describing quantum many-body systems, which we discuss.

•Sep 7, 2006•0 citations

Controlled Bond Expansion for Density Matrix Renormalization Group Ground State Search at Single-Site Costs

Andreas Gleis, Jheng-Wei Li, Jan von Delft

DMRG ground state search algorithms employing symmetries must be able to expand virtual bond spaces by adding or changing symmetry sectors if these lower the energy. Traditional single-site DMRG does not allow bond expansion; two-site DMRG does, but at much higher computational costs. We present a controlled bond expansion (CBE) algorithm that yields two-site accuracy and convergence per sweep, at single-site costs. Given a matrix product state Ψ defining a variational space, CBE identifies parts of the orthogonal space carrying significant weight in HΨ and expands bonds to include only these. CBE-DMRG uses no mixing parameters and is fully variational. Using CBE-DMRG, we show that the Kondo-Heisenberg model on a width 4 cylinder features two distinct phases differing in their Fermi surface volumes.

arXiv:2207.14712•Physical Review Letters•Jun 16, 2023•30 citations

Efficient perturbation theory to improve the density matrix renormalization group

Emanuele Tirrito, Shi-Ju Ran, Andrew J. Ferris +2 more

The density matrix renormalization group (DMRG) is one of the most powerful numerical methods available for many-body systems. It has been applied to solve many physical problems, including the calculation of ground states and dynamical properties. In this work, we develop a perturbation theory of the DMRG (PT-DMRG) to greatly increase its accuracy in an extremely simple and efficient way. Using the canonical matrix product state (MPS) representation for the ground state of the considered system, a set of orthogonal basis functions $\left\{|{\ensuremath{\psi}}_{i}\ensuremath{\rangle}\right\}$ is introduced to describe the perturbations to the ground state obtained by the conventional DMRG. The Schmidt numbers of the MPS that are beyond the bond dimension cutoff are used to define these perturbation terms. The perturbed Hamiltonian is then defined as ${\stackrel{\ifmmode \tilde{}\else \~{}\fi{}}{H}}_{ij}=\ensuremath{\langle}{\ensuremath{\psi}}_{i}|\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{H}|{\ensuremath{\psi}}_{j}\ensuremath{\rangle}$; its ground state permits us to calculate physical observables with a considerably improved accuracy compared to the original DMRG results. We benchmark the second-order perturbation theory with the help of a one-dimensional Ising chain in a transverse field and the Heisenberg chain, where the precision of the DMRG is shown to be improved $O(10)$ times. Furthermore, for moderate $L$ the errors of the DMRG and PT-DMRG both scale linearly with ${L}^{\ensuremath{-}1}$ (with $L$ being the length of the chain). The linear relation between the dimension cutoff of the DMRG and that of the PT-DMRG at the same precision shows a considerable improvement in efficiency, especially for large dimension cutoffs. In the thermodynamic limit we show that the errors of the PT-DMRG scale with $\sqrt{{L}^{\ensuremath{-}1}}$. Our work suggests an effective way to define the tangent space of the ground-state MPS, which may shed light on the properties beyond the ground state. This second-order PT-DMRG can be readily generalized to higher orders, as well as applied to models in higher dimensions.

arXiv:1605.00940•Physical review. B./Physical review. B•Feb 21, 2017•4 citations

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

Hamed Saberi, Andreas Weichselbaum, Jan von Delft

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

arXiv:0804.0193•Physical Review B•Jul 24, 2008•56 citations

Computational Difficulty of Global Variations in the Density Matrix Renormalization Group

Jens Eisert

The density matrix renormalization group approach is arguably the most successful method to numerically find ground states of quantum spin chains. It amounts to iteratively locally optimizing matrix-product states, aiming at better and better approximating the true ground state. To date, both a proof of convergence to the globally best approximation and an assessment of its complexity are lacking. Here we establish a result on the computational complexity of an approximation with matrix-product states: The surprising result is that when one globally optimizes over several sites of local Hamiltonians, avoiding local optima, one encounters in the worst case a computationally difficult NP-hard problem (hard even in approximation). The proof exploits a novel way of relating it to binary quadratic programming. We discuss intriguing ramifications on the difficulty of describing quantum many-body systems.

arXiv:quant-ph/0609051•Physical Review Letters•Dec 28, 2006•36 citations
In the approaches based on matrix-product states (MPSs), such as the density-matrix renormalization group (DMRG) method, the ordering of the sites crucially affects the computational accuracy. We investigate the performance of an algorithm that searches for the optimal site order by iterative local site rearrangement. We improve the algorithm by expanding the range of site rearrangement and apply it to a one-dimensional quantum Heisenberg model with random site permutation. The results indicate that increasing the range of the site rearrangement significantly improves the computational accuracy of the DMRG method. In particular, increasing the rearrangement range from two to three sites reduces the average relative error in the ground-state energy by 65% to 94% in the cases we tested. We also discuss the computational cost of the algorithm and its application as a preprocessing for MPS-based calculations.
A zero-site density matrix renormalization algorithm (DMRG0) is proposed to minimize the energy of matrix product states (MPSs). Instead of the site tensors themselves, we propose to optimize sequentially the ``message'' tensors between neighbor sites, which contain the singular values of the bipartition. This leads to a local minimization step that is independent of the physical dimension of the site. Conceptually, it separates the optimization and decimation steps in DMRG. Furthermore, we introduce two global perturbations based on the optimal low-rank correction to the current state, which are used to avoid local minima. They are determined variationally as the MPSs closest to the one-step correction of the Lanczos or Jacobi-Davidson eigensolver. These perturbations mainly decrease the energy and are free of hand-tuned parameters. Compared to existing single-site enrichment proposals, our approach gives similar convergence ratios per sweep, while the computations are cheaper by construction. Our methods may be useful in systems with many physical degrees of freedom per lattice site. We test our approach on the periodic Heisenberg spin chain for various spins and on free electrons on the lattice.
The density matrix renormalization group (DMRG) approach is arguably the most successful method to numerically approximate ground states of quantum spin chains. It essentially amounts to iteratively locally optimizing matrix-product states, aiming at better and better approximating the true ground state. Despite considerable effort, to date both a proof of convergence of this procedure to the globally best approximation and an assessment of its complexity are lacking. Here, we rigorously establish a statement on the classical complexity of an approximation with matrix-product states: the surprising result is that when one globally optimizes matrix-product states with respect to several sites simultaneously - to find the optimal approximation over several sites at once, avoiding local optima - one encounters in the worst case a computationally difficult NP-hard problem. We prove this by exploiting a novel way of polynomially relating it to binary quadratic programming. This is true even for translationally invariant local hamiltonians. This result gives rise to intriguing ramifications on the difficulty of describing quantum many-body systems, which we discuss.
DMRG ground state search algorithms employing symmetries must be able to expand virtual bond spaces by adding or changing symmetry sectors if these lower the energy. Traditional single-site DMRG does not allow bond expansion; two-site DMRG does, but at much higher computational costs. We present a controlled bond expansion (CBE) algorithm that yields two-site accuracy and convergence per sweep, at single-site costs. Given a matrix product state Ψ defining a variational space, CBE identifies parts of the orthogonal space carrying significant weight in HΨ and expands bonds to include only these. CBE-DMRG uses no mixing parameters and is fully variational. Using CBE-DMRG, we show that the Kondo-Heisenberg model on a width 4 cylinder features two distinct phases differing in their Fermi surface volumes.
The density matrix renormalization group (DMRG) is one of the most powerful numerical methods available for many-body systems. It has been applied to solve many physical problems, including the calculation of ground states and dynamical properties. In this work, we develop a perturbation theory of the DMRG (PT-DMRG) to greatly increase its accuracy in an extremely simple and efficient way. Using the canonical matrix product state (MPS) representation for the ground state of the considered system, a set of orthogonal basis functions $\left\{|{\ensuremath{\psi}}_{i}\ensuremath{\rangle}\right\}$ is introduced to describe the perturbations to the ground state obtained by the conventional DMRG. The Schmidt numbers of the MPS that are beyond the bond dimension cutoff are used to define these perturbation terms. The perturbed Hamiltonian is then defined as ${\stackrel{\ifmmode \tilde{}\else \~{}\fi{}}{H}}_{ij}=\ensuremath{\langle}{\ensuremath{\psi}}_{i}|\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{H}|{\ensuremath{\psi}}_{j}\ensuremath{\rangle}$; its ground state permits us to calculate physical observables with a considerably improved accuracy compared to the original DMRG results. We benchmark the second-order perturbation theory with the help of a one-dimensional Ising chain in a transverse field and the Heisenberg chain, where the precision of the DMRG is shown to be improved O(10)O(10)O(10) times. Furthermore, for moderate LLL the errors of the DMRG and PT-DMRG both scale linearly with ${L}^{\ensuremath{-}1}$ (with LLL being the length of the chain). The linear relation between the dimension cutoff of the DMRG and that of the PT-DMRG at the same precision shows a considerable improvement in efficiency, especially for large dimension cutoffs. In the thermodynamic limit we show that the errors of the PT-DMRG scale with $\sqrt{{L}^{\ensuremath{-}1}}$. Our work suggests an effective way to define the tangent space of the ground-state MPS, which may shed light on the properties beyond the ground state. This second-order PT-DMRG can be readily generalized to higher orders, as well as applied to models in higher dimensions.
Wilson's numerical renormalization group (NRG) method for solving quantum impurity models yields a set of energy eigenstates that have the form of matrix product states (MPS). White's density-matrix renormalization group (DMRG) for treating quantum lattice problems can likewise be reformulated in terms of MPS. Thus, the latter constitute a common algebraic structure for both approaches. We exploit this fact to compare the NRG approach for the single-impurity Anderson model with a variational matrix product state approach (VMPS), equivalent to single-site DMRG. For the latter, we use an ``unfolded'' Wilson chain, which brings about a significant reduction in numerical costs compared to those of NRG. We show that all NRG eigenstates (kept and discarded) can be reproduced using VMPS, and compare the difference in truncation criteria, sharp vs smooth in energy space, of the two approaches. Finally, we demonstrate that NRG results can be improved upon systematically by performing a variational optimization in the space of variational matrix product states, using the states produced by NRG as input.
The density matrix renormalization group approach is arguably the most successful method to numerically find ground states of quantum spin chains. It amounts to iteratively locally optimizing matrix-product states, aiming at better and better approximating the true ground state. To date, both a proof of convergence to the globally best approximation and an assessment of its complexity are lacking. Here we establish a result on the computational complexity of an approximation with matrix-product states: The surprising result is that when one globally optimizes over several sites of local Hamiltonians, avoiding local optima, one encounters in the worst case a computationally difficult NP-hard problem (hard even in approximation). The proof exploits a novel way of relating it to binary quadratic programming. We discuss intriguing ramifications on the difficulty of describing quantum many-body systems.