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

Current Chinese Science

High-Performance Computing for Density Matrix Renormalization Group

Yingqi Tian, Haibo Ma

Published Nov 28, 2022• 4 citations
Publisher

Abstract

Abstract: In the last decades, many algorithms have been developed to use high-performance computing (HPC) techniques to accelerate the density matrix renormalization group (DMRG) method, an effective method for solving large active space strong correlation problems. In this article, the previous DMRG parallelization algorithms at different levels of the parallelism are introduced. The heterogeneous computing acceleration methods and the mixed-precision implementation are also presented and discussed. This mini-review concludes with some summary and prospects for future works.

DOI
10.2174/2210298103666221125162959

Related papers

High-performance ab initio density matrix renormalization group method: Applicability to large-scale multireference problems for metal compounds

Yuki Kurashige, Takeshi Yanai

This article presents an efficient and parallelized implementation of the density matrix renormalization group (DMRG) algorithm for quantum chemistry calculations. The DMRG method as a large-scale multireference electronic structure model is by nature particularly efficient for one-dimensionally correlated systems, while the present development is oriented toward applications for polynuclear transition metal compounds, in which the macroscopic one-dimensional structure of electron correlation is absent. A straightforward extension of the DMRG algorithm is proposed with further improvements and aggressive optimizations to allow its application with large multireference active space, which is often demanded for metal compound calculations. Special efficiency is achieved by making better use of sparsity and symmetry in the operator and wave function representations. By accomplishing computationally intensive DMRG calculations, the authors have found that a large number of renormalized basis states are required to represent high entanglement of the electron correlation for metal compound applications, and it is crucial to adopt auxiliary perturbative correction to the projected density matrix during the DMRG sweep optimization in order to attain proper convergence to the solution. Potential energy curve calculations for the Cr(2) molecule near the known equilibrium precisely predicted the full configuration interaction energies with a correlation space of 24 electrons in 30 orbitals [denoted by (24e,30o)]. The energies are demonstrated to be accurate to 0.6mE(h) (the error from the extrapolated best value) when as many as 10,000 renormalized basis states are employed for the left and right DMRG block representations. The relative energy curves for [Cu(2)O(2)](2+) along the isomerization coordinate were obtained from DMRG and other correlated calculations, for which a fairly large orbital space (32e,62o) is modeled as a full correlation space. The DMRG prediction nearly overlaps with the energy curve from the coupled cluster with singles, doubles, and perturbative triple [CCSD(T)] calculations, while the multireference complete active space self-consistent field (CASSCF) calculations with the small reference configuration (8e,8o) are found to overestimate the biradical character of the electronic state of [Cu(2)O(2)](2+) according to the one-electron density matrix analysis.

The Journal of Chemical Physics•Jun 19, 2009•190 citations

Distributed Multi-GPU Ab Initio Density Matrix Renormalization Group Algorithm with Applications to the P-Cluster of Nitrogenase

Chunyang Xiang, Weile Jia, Wei‐Hai Fang +1 more

The presence of many degenerate d/f orbitals makes polynuclear transition-metal compounds, such as iron–sulfur clusters in nitrogenase, challenging for state-of-the-art quantum chemistry methods. To address this challenge, we present the first distributed multi-graphics processing unit (GPU) ab initio density matrix renormalization group (DMRG) algorithm suitable for modern high-performance computing (HPC) infrastructures. The central idea is to parallelize the most computationally intensive part─the multiplication of O ( K 2 ) operators with a trial wave function, where K is the number of spatial orbitals, by combining operator parallelism for distributing the workload with a batched algorithm for performing contractions on GPU. With this new implementation, we are able to reach an unprecedentedly large bond dimension D = 14,000 on 48 GPUs (NVIDIA A100 80 GB SXM) for an active space model (114 electrons in 73 active orbitals) of the P-cluster, which is nearly 3 times larger than the bond dimensions reported in previous DMRG calculations for the same system using only central processing units (CPUs).

arXiv:2311.02854•Journal of Chemical Theory and Computation•Jan 10, 2024•36 citations

Improved hybrid parallel strategy for density matrix renormalization group method*

Fuzhou Chen, Chen Cheng, Hong‐Gang Luo

We propose a new heterogeneous parallel strategy for the density matrix renormalization group (DMRG) method in the hybrid architecture with both central processing unit (CPU) and graphics processing unit (GPU). Focusing on the two most time-consuming sections in the finite DMRG sweeps, i.e., the diagonalization of superblock and the truncation of subblock, we optimize our previous hybrid algorithm to achieve better performance. For the former, we adopt OpenMP application programming interface on CPU and use our own subroutines with higher bandwidth on GPU. For the later, we use GPU to accelerate matrix and vector operations involving the reduced density matrix. Applying the parallel scheme to the Hubbard model with next-nearest hopping on the 4-leg ladder, we compute the ground state of the system and obtain the charge stripe pattern which is usually observed in high temperature superconductors. Based on simulations with different numbers of DMRG kept states, we show significant performance improvement and computational time reduction with the optimized parallel algorithm. Our hybrid parallel strategy with superiority in solving the ground state of quasi-two dimensional lattices is also expected to be useful for other DMRG applications with large numbers of kept states, e.g., the time dependent DMRG algorithms.

Chinese Physics B•Apr 17, 2020•7 citations

Parallel Implementation of the Density Matrix Renormalization Group Method Achieving a Quarter petaFLOPS Performance on a Single DGX-H100 GPU Node

Andor Menczer, Maarten Van Damme, Alan E. Rask +5 more

Density Matrix Renormalization Group (DMRG) method on current state-of-the-art NVIDIA DGX-H100 architectures. We evaluate the performance of the DMRG electronic structure calculations for the active compounds of the FeMoco, the primary cofactor of nitrogenase, and cytochrome P450 (CYP) enzymes with complete active space (CAS) sizes of up to 113 electrons in 76 orbitals [CAS(113, 76)] and 63 electrons in 58 orbitals [CAS(63, 58)], respectively. We achieve 246 teraFLOPS of sustained performance, an improvement of more than 2.5× compared to the performance achieved on the DGX-A100 architectures and an 80× acceleration compared to an OpenMP parallelized implementation on a 128-core CPU architecture. Our work highlights the ability of tensor network algorithms to efficiently utilize high-performance multi-GPU hardware and shows that the combination of tensor networks with modern large-scale GPU accelerators can pave the way toward solving some of the most challenging problems in quantum chemistry and beyond.

arXiv:2407.07411•Journal of Chemical Theory and Computation•Sep 19, 2024•44 citations

Implementation trade-offs of the density matrix renormalization group algorithm on kilo-processor architectures

Csaba Nemes, Gergely Barcza, Zoltán Nagy +2 more

Numerical analysis of strongly correlated quantum lattice models has a great importance in quantum physics. The exponentially growing size of the Hilbert space makes these computations difficult, however sophisticated algorithms have been developed to balance the size of the effective Hilbert space and the accuracy of the simulation. One of these methods is the density matrix renormalization group (DMRG) algorithm which has become the leading numerical tool in the study of low dimensional lattice problems of current interest. In the algorithm a high computational problem can be translated to a list of dense matrix operations, which makes it an ideal application to fully utilize the computing power residing in both current multi-core processors and novel kilo-processor architectures.

European Conference on Circuit Theory and Design•Sep 1, 2013•0 citations

RECENT PROGRESS IN THE DENSITY-MATRIX RENORMALIZATION GROUP

Ulrich Schollwöck

Over the last decade, the density-matrix renormalization group (DMRG) has emerged as the most powerful method for the simulation of strongly correlated one-dimensional (1D) quantum systems. Input from quantum information has allowed to trace the method's performance to the entanglement properties of quantum states, revealing why it works so well in 1D and not so well in 2D; it has allowed to devise algorithms for time-dependent quantum systems and, by clarifying the link between DMRG and Wilson's numerical renormalization group (NRG), for quantum impurity systems.

•Sep 1, 2007•0 citations
Abstract: In the last decades, many algorithms have been developed to use high-performance computing (HPC) techniques to accelerate the density matrix renormalization group (DMRG) method, an effective method for solving large active space strong correlation problems. In this article, the previous DMRG parallelization algorithms at different levels of the parallelism are introduced. The heterogeneous computing acceleration methods and the mixed-precision implementation are also presented and discussed. This mini-review concludes with some summary and prospects for future works.
This article presents an efficient and parallelized implementation of the density matrix renormalization group (DMRG) algorithm for quantum chemistry calculations. The DMRG method as a large-scale multireference electronic structure model is by nature particularly efficient for one-dimensionally correlated systems, while the present development is oriented toward applications for polynuclear transition metal compounds, in which the macroscopic one-dimensional structure of electron correlation is absent. A straightforward extension of the DMRG algorithm is proposed with further improvements and aggressive optimizations to allow its application with large multireference active space, which is often demanded for metal compound calculations. Special efficiency is achieved by making better use of sparsity and symmetry in the operator and wave function representations. By accomplishing computationally intensive DMRG calculations, the authors have found that a large number of renormalized basis states are required to represent high entanglement of the electron correlation for metal compound applications, and it is crucial to adopt auxiliary perturbative correction to the projected density matrix during the DMRG sweep optimization in order to attain proper convergence to the solution. Potential energy curve calculations for the Cr(2) molecule near the known equilibrium precisely predicted the full configuration interaction energies with a correlation space of 24 electrons in 30 orbitals [denoted by (24e,30o)]. The energies are demonstrated to be accurate to 0.6mE(h) (the error from the extrapolated best value) when as many as 10,000 renormalized basis states are employed for the left and right DMRG block representations. The relative energy curves for [Cu(2)O(2)](2+) along the isomerization coordinate were obtained from DMRG and other correlated calculations, for which a fairly large orbital space (32e,62o) is modeled as a full correlation space. The DMRG prediction nearly overlaps with the energy curve from the coupled cluster with singles, doubles, and perturbative triple [CCSD(T)] calculations, while the multireference complete active space self-consistent field (CASSCF) calculations with the small reference configuration (8e,8o) are found to overestimate the biradical character of the electronic state of [Cu(2)O(2)](2+) according to the one-electron density matrix analysis.
The presence of many degenerate d/f orbitals makes polynuclear transition-metal compounds, such as iron–sulfur clusters in nitrogenase, challenging for state-of-the-art quantum chemistry methods. To address this challenge, we present the first distributed multi-graphics processing unit (GPU) ab initio density matrix renormalization group (DMRG) algorithm suitable for modern high-performance computing (HPC) infrastructures. The central idea is to parallelize the most computationally intensive part─the multiplication of O ( K 2 ) operators with a trial wave function, where K is the number of spatial orbitals, by combining operator parallelism for distributing the workload with a batched algorithm for performing contractions on GPU. With this new implementation, we are able to reach an unprecedentedly large bond dimension D = 14,000 on 48 GPUs (NVIDIA A100 80 GB SXM) for an active space model (114 electrons in 73 active orbitals) of the P-cluster, which is nearly 3 times larger than the bond dimensions reported in previous DMRG calculations for the same system using only central processing units (CPUs).
We propose a new heterogeneous parallel strategy for the density matrix renormalization group (DMRG) method in the hybrid architecture with both central processing unit (CPU) and graphics processing unit (GPU). Focusing on the two most time-consuming sections in the finite DMRG sweeps, i.e., the diagonalization of superblock and the truncation of subblock, we optimize our previous hybrid algorithm to achieve better performance. For the former, we adopt OpenMP application programming interface on CPU and use our own subroutines with higher bandwidth on GPU. For the later, we use GPU to accelerate matrix and vector operations involving the reduced density matrix. Applying the parallel scheme to the Hubbard model with next-nearest hopping on the 4-leg ladder, we compute the ground state of the system and obtain the charge stripe pattern which is usually observed in high temperature superconductors. Based on simulations with different numbers of DMRG kept states, we show significant performance improvement and computational time reduction with the optimized parallel algorithm. Our hybrid parallel strategy with superiority in solving the ground state of quasi-two dimensional lattices is also expected to be useful for other DMRG applications with large numbers of kept states, e.g., the time dependent DMRG algorithms.
Density Matrix Renormalization Group (DMRG) method on current state-of-the-art NVIDIA DGX-H100 architectures. We evaluate the performance of the DMRG electronic structure calculations for the active compounds of the FeMoco, the primary cofactor of nitrogenase, and cytochrome P450 (CYP) enzymes with complete active space (CAS) sizes of up to 113 electrons in 76 orbitals [CAS(113, 76)] and 63 electrons in 58 orbitals [CAS(63, 58)], respectively. We achieve 246 teraFLOPS of sustained performance, an improvement of more than 2.5× compared to the performance achieved on the DGX-A100 architectures and an 80× acceleration compared to an OpenMP parallelized implementation on a 128-core CPU architecture. Our work highlights the ability of tensor network algorithms to efficiently utilize high-performance multi-GPU hardware and shows that the combination of tensor networks with modern large-scale GPU accelerators can pave the way toward solving some of the most challenging problems in quantum chemistry and beyond.
Numerical analysis of strongly correlated quantum lattice models has a great importance in quantum physics. The exponentially growing size of the Hilbert space makes these computations difficult, however sophisticated algorithms have been developed to balance the size of the effective Hilbert space and the accuracy of the simulation. One of these methods is the density matrix renormalization group (DMRG) algorithm which has become the leading numerical tool in the study of low dimensional lattice problems of current interest. In the algorithm a high computational problem can be translated to a list of dense matrix operations, which makes it an ideal application to fully utilize the computing power residing in both current multi-core processors and novel kilo-processor architectures.
Over the last decade, the density-matrix renormalization group (DMRG) has emerged as the most powerful method for the simulation of strongly correlated one-dimensional (1D) quantum systems. Input from quantum information has allowed to trace the method's performance to the entanglement properties of quantum states, revealing why it works so well in 1D and not so well in 2D; it has allowed to devise algorithms for time-dependent quantum systems and, by clarifying the link between DMRG and Wilson's numerical renormalization group (NRG), for quantum impurity systems.