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

Australian Journal of Physics

Density Matrix Renormalisation Group Method and Symmetries of the Hamiltonian

Ian P. McCulloch, M. Gulácsi

Published Feb 23, 2001• 37 citations
Publisher

Abstract

Substantial improvements in the computational effort in a density matrix renormalisation program can be made by utilising symmetries of the Hamiltonian. Extra quantum numbers are always desirable to include in the calculation, since it allows the Hilbert space of the superblock to be refined. Since the speed of the calculation is approximately O ( n 3 ) in superblock states, the speed increase in targeting a specific total spin state can be considerable. In this paper a new density matrix renormalisation algorithm is presented which conserves the total spin. The general procedure obtained works for any operator, even operators that do not commute with the Hamiltonian.

DOI
10.1071/ph00023

Related papers

Total spin in the density matrix renormalization group algorithm

Ian P. McCulloch, M. Gulácsi

A new density matrix renormalization group (DMRG) algorithm is presented which conserves the total spin. This is the first time that standard DMRG is extended to exploit fully the symmetries of the Hamiltonian. The obtained general procedure works for any operator, even operators that do not commute with the Hamiltonian. The new method gives substantial improvements over the standard DMRG.

Philosophical Magazine Letters•Jun 1, 2001•31 citations

Infinite Density Matrix Renormalisation Group for Symmetric Systems at High Filling Fraction, and Anyons

Robert N. C. Pfeifer

The infinite Density Matrix Renormalisation Group (iDMRG) algorithm is a highly successful numerical algorithm for the study of low-dimensional quantum systems. However, it may fail at high filling fractions when exploiting global symmetries such as particle number conservation to increase simulation speed. This paper introduces a modified iDMRG algorithm capable of exploiting these symmetries while still producing accurate results at high filling fractions, and at a substantially reduced computational cost.

•May 23, 2015•0 citations

Controlling the accuracy of the density-matrix renormalization-group method: The dynamical block state selection approach

Örs Legeza, Johannes Röder, B.A. Hess

We have applied the momentum space version of the density-matrix renormalization-group method (k-DMRG) in quantum chemistry in order to study the accuracy of the algorithm in this new context. We have shown numerically that it is possible to determine the desired accuracy of the method in advance of the calculations by dynamically controlling the truncation error and the number of block states using a novel protocol that we dubbed dynamical block state selection protocol. The relationship between the real error and truncation error has been studied as a function of the number of orbitals and the fraction of filled orbitals. We have calculated the ground state of the molecules ${\mathrm{CH}}_{2},$ ${\mathrm{H}}_{2}\mathrm{O},$ and ${\mathrm{F}}_{2}$ as well as the first excited state of ${\mathrm{CH}}_{2}.$ Our largest calculations were carried out with 57 orbitals, the largest number of block states was 1500--2000, and the largest dimensions of the Hilbert space of the superblock configuration was 800 000--1 200 000.

arXiv:cond-mat/0204602•Physical review. B, Condensed matter•Mar 19, 2003•264 citations

Direct Extension of Density-Matrix Renormalization Group to Two-Dimensional Quantum Lattice Systems: Studies of Parallel Algorithm, Accuracy, and Performance

Susumu Yamada, Masahiko Okumura, Masahiko Machida

We parallelize density-matrix renormalization group to directly extend it to 2-dimensional ($n$-leg) quantum lattice models. The parallelization is made mainly on the exact diagonalization for the superblock Hamiltonian since the part requires an enormous memory space as the leg number $n$ increases. The superblock Hamiltonian is divided into three parts, and the correspondent superblock vector is transformed into a matrix, whose elements are uniformly distributed into processors. The parallel efficiency shows a high rate as the number of the states kept $m$ increases, and the eigenvalue converges within only a few sweeps in contrast to the multichain algorithm.

arXiv:0707.0159•Journal of the Physical Society of Japan•Aug 28, 2009•22 citations

Spin-adapted density matrix renormalization group algorithms for quantum chemistry

Sandeep Sharma, Garnet Kin-Lic Chan

We extend the spin-adapted density matrix renormalization group (DMRG) algorithm of McCulloch and Gulacsi [Europhys. Lett. 57, 852 (2002)] to quantum chemical Hamiltonians. This involves using a quasi-density matrix, to ensure that the renormalized DMRG states are eigenfunctions of Ŝ(2), and the Wigner-Eckart theorem, to reduce overall storage and computational costs. We argue that the spin-adapted DMRG algorithm is most advantageous for low spin states. Consequently, we also implement a singlet-embedding strategy due to Tatsuaki [Phys. Rev. E 61, 3199 (2000)] where we target high spin states as a component of a larger fictitious singlet system. Finally, we present an efficient algorithm to calculate one- and two-body reduced density matrices from the spin-adapted wavefunctions. We evaluate our developments with benchmark calculations on transition metal system active space models. These include the Fe(2)S(2), [Fe(2)S(2)(SCH(3))(4)](2-), and Cr(2) systems. In the case of Fe(2)S(2), the spin-ladder spacing is on the microHartree scale, and here we show that we can target such very closely spaced states. In [Fe(2)S(2)(SCH(3))(4)](2-), we calculate particle and spin correlation functions, to examine the role of sulfur bridging orbitals in the electronic structure. In Cr(2) we demonstrate that spin-adaptation with the Wigner-Eckart theorem and using singlet embedding can yield up to an order of magnitude increase in computational efficiency. Overall, these calculations demonstrate the potential of using spin-adaptation to extend the range of DMRG calculations in complex transition metal problems.

arXiv:1408.5039•The Journal of Chemical Physics•Mar 28, 2012•299 citations

Time-reversal symmetry adaptation in relativistic density matrix renormalization group algorithm

Zhendong Li

In the nonrelativistic Schrödinger equation, the total spin S and spin projection M are good quantum numbers. In contrast, spin symmetry is lost in the presence of spin-dependent interactions, such as spin-orbit couplings in relativistic Hamiltonians. Therefore, the relativistic density matrix renormalization group algorithm (R-DMRG) only employing particle number symmetry is much more expensive than nonrelativistic DMRG. In addition, artificial breaking of Kramers degeneracy can happen in the treatment of systems with an odd number of electrons. To overcome these issues, we propose time-reversal symmetry adaptation for R-DMRG. Since the time-reversal operator is antiunitary, this cannot be simply achieved in the usual way. We introduce a time-reversal symmetry-adapted renormalized basis and present strategies to maintain the structure of basis functions during the sweep optimization. With time-reversal symmetry adaptation, only half of the renormalized operators are needed, and the computational costs of Hamiltonian-wavefunction multiplication and renormalization are reduced by half. The present construction of the time-reversal symmetry-adapted basis also directly applies to other tensor network states without loops.

arXiv:2209.11380•The Journal of Chemical Physics•Jan 11, 2023•5 citations
Substantial improvements in the computational effort in a density matrix renormalisation program can be made by utilising symmetries of the Hamiltonian. Extra quantum numbers are always desirable to include in the calculation, since it allows the Hilbert space of the superblock to be refined. Since the speed of the calculation is approximately O ( n 3 ) in superblock states, the speed increase in targeting a specific total spin state can be considerable. In this paper a new density matrix renormalisation algorithm is presented which conserves the total spin. The general procedure obtained works for any operator, even operators that do not commute with the Hamiltonian.
The infinite Density Matrix Renormalisation Group (iDMRG) algorithm is a highly successful numerical algorithm for the study of low-dimensional quantum systems. However, it may fail at high filling fractions when exploiting global symmetries such as particle number conservation to increase simulation speed. This paper introduces a modified iDMRG algorithm capable of exploiting these symmetries while still producing accurate results at high filling fractions, and at a substantially reduced computational cost.
We have applied the momentum space version of the density-matrix renormalization-group method (k-DMRG) in quantum chemistry in order to study the accuracy of the algorithm in this new context. We have shown numerically that it is possible to determine the desired accuracy of the method in advance of the calculations by dynamically controlling the truncation error and the number of block states using a novel protocol that we dubbed dynamical block state selection protocol. The relationship between the real error and truncation error has been studied as a function of the number of orbitals and the fraction of filled orbitals. We have calculated the ground state of the molecules CH2,{\mathrm{CH}}_{2},CH2​, H2O,{\mathrm{H}}_{2}\mathrm{O},H2​O, and F2{\mathrm{F}}_{2}F2​ as well as the first excited state of CH2.{\mathrm{CH}}_{2}.CH2​. Our largest calculations were carried out with 57 orbitals, the largest number of block states was 1500--2000, and the largest dimensions of the Hilbert space of the superblock configuration was 800 000--1 200 000.
We parallelize density-matrix renormalization group to directly extend it to 2-dimensional (nnn-leg) quantum lattice models. The parallelization is made mainly on the exact diagonalization for the superblock Hamiltonian since the part requires an enormous memory space as the leg number nnn increases. The superblock Hamiltonian is divided into three parts, and the correspondent superblock vector is transformed into a matrix, whose elements are uniformly distributed into processors. The parallel efficiency shows a high rate as the number of the states kept mmm increases, and the eigenvalue converges within only a few sweeps in contrast to the multichain algorithm.
We extend the spin-adapted density matrix renormalization group (DMRG) algorithm of McCulloch and Gulacsi [Europhys. Lett. 57, 852 (2002)] to quantum chemical Hamiltonians. This involves using a quasi-density matrix, to ensure that the renormalized DMRG states are eigenfunctions of Ŝ(2), and the Wigner-Eckart theorem, to reduce overall storage and computational costs. We argue that the spin-adapted DMRG algorithm is most advantageous for low spin states. Consequently, we also implement a singlet-embedding strategy due to Tatsuaki [Phys. Rev. E 61, 3199 (2000)] where we target high spin states as a component of a larger fictitious singlet system. Finally, we present an efficient algorithm to calculate one- and two-body reduced density matrices from the spin-adapted wavefunctions. We evaluate our developments with benchmark calculations on transition metal system active space models. These include the Fe(2)S(2), [Fe(2)S(2)(SCH(3))(4)](2-), and Cr(2) systems. In the case of Fe(2)S(2), the spin-ladder spacing is on the microHartree scale, and here we show that we can target such very closely spaced states. In [Fe(2)S(2)(SCH(3))(4)](2-), we calculate particle and spin correlation functions, to examine the role of sulfur bridging orbitals in the electronic structure. In Cr(2) we demonstrate that spin-adaptation with the Wigner-Eckart theorem and using singlet embedding can yield up to an order of magnitude increase in computational efficiency. Overall, these calculations demonstrate the potential of using spin-adaptation to extend the range of DMRG calculations in complex transition metal problems.
In the nonrelativistic Schrödinger equation, the total spin S and spin projection M are good quantum numbers. In contrast, spin symmetry is lost in the presence of spin-dependent interactions, such as spin-orbit couplings in relativistic Hamiltonians. Therefore, the relativistic density matrix renormalization group algorithm (R-DMRG) only employing particle number symmetry is much more expensive than nonrelativistic DMRG. In addition, artificial breaking of Kramers degeneracy can happen in the treatment of systems with an odd number of electrons. To overcome these issues, we propose time-reversal symmetry adaptation for R-DMRG. Since the time-reversal operator is antiunitary, this cannot be simply achieved in the usual way. We introduce a time-reversal symmetry-adapted renormalized basis and present strategies to maintain the structure of basis functions during the sweep optimization. With time-reversal symmetry adaptation, only half of the renormalized operators are needed, and the computational costs of Hamiltonian-wavefunction multiplication and renormalization are reduced by half. The present construction of the time-reversal symmetry-adapted basis also directly applies to other tensor network states without loops.