Current descriptions of the ab initio density matrix renormalization group (DMRG) algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix product operators. The same algorithm can appear dramatically different when written in the two different vocabularies. In this work, we carefully describe the translation between the two languages in several contexts. First, we describe how to efficiently implement the ab initio DMRG sweep using a matrix product operator based code, and the equivalence to the original renormalized operator implementation. Next we describe how to implement the general matrix product operator/matrix product state algebra within a pure renormalized operator-based DMRG code. Finally, we discuss two improvements of the ab initio DMRG sweep algorithm motivated by matrix product operator language: Hamiltonian compression, and a sum over operators representation that allows for perfect computational parallelism. The connections and correspondences described here serve to link the future developments with the past and are important in the efficient implementation of continuing advances in ab initio DMRG and related algorithms.
Current descriptions of the ab initio density matrix renormalization group (DMRG) algorithm use two superficially different languages: an older language of the renormalization group and renormalized operators, and a more recent language of matrix product states and matrix product operators. The same algorithm can appear dramatically different when written in the two different vocabularies. In this work, we carefully describe the translation between the two languages in several contexts. First, we describe how to efficiently implement the ab initio DMRG sweep using a matrix product operator based code, and the equivalence to the original renormalized operator implementation. Next we describe how to implement the general matrix product operator/matrix product state algebra within a pure renormalized operator-based DMRG code. Finally, we discuss two improvements of the ab initio DMRG sweep algorithm motivated by matrix product operator language: Hamiltonian compression, and a sum over operators representation that allows for perfect computational parallelism. The connections and correspondences described here serve to link the future developments with the past and are important in the efficient implementation of continuing advances in ab initio DMRG and related algorithms.
Matrix product operators (MPOs) are at the heart of the second-generation density matrix renormalization group (DMRG) algorithm formulated in matrix product state language. We first summarize the widely known facts on MPO arithmetic and representations of single-site operators. Second, we introduce three compression methods (rescaled SVD, deparallelization, and delinearization) for MPOs and show that it is possible to construct efficient representations of arbitrary operators using MPO arithmetic and compression. As examples, we construct powers of a short-ranged spin-chain Hamiltonian, a complicated Hamiltonian of a two-dimensional system and, as proof of principle, the long-range four-body Hamiltonian from quantum chemistry.
There has been recent interest in the deployment of ab initio density matrix renormalization group (DMRG) computations on high performance computing platforms. Here, we introduce a reformulation of the conventional distributed memory ab initio DMRG algorithm that connects it to the conceptually simpler and advantageous sum of the sub-Hamiltonian approach. Starting from this framework, we further explore a hierarchy of parallelism strategies that includes (i) parallelism over the sum of sub-Hamiltonians, (ii) parallelism over sites, (iii) parallelism over normal and complementary operators, (iv) parallelism over symmetry sectors, and (v) parallelism within dense matrix multiplications. We describe how to reduce processor load imbalance and the communication cost of the algorithm to achieve higher efficiencies. We illustrate the performance of our new open-source implementation on a recent benchmark ground-state calculation of benzene in an orbital space of 108 orbitals and 30 electrons, with a bond dimension of up to 6000, and a model of the FeMo cofactor with 76 orbitals and 113 electrons. The observed parallel scaling from 448 to 2800 central processing unit cores is nearly ideal.
We describe how to efficiently construct the quantum chemical Hamiltonian operator in matrix product form. We present its implementation as a density matrix renormalization group (DMRG) algorithm for quantum chemical applications. Existing implementations of DMRG for quantum chemistry are based on the traditional formulation of the method, which was developed from the point of view of Hilbert space decimation and attained higher performance compared to straightforward implementations of matrix product based DMRG. The latter variationally optimizes a class of ansatz states known as matrix product states, where operators are correspondingly represented as matrix product operators (MPOs). The MPO construction scheme presented here eliminates the previous performance disadvantages while retaining the additional flexibility provided by a matrix product approach, for example, the specification of expectation values becomes an input parameter. In this way, MPOs for different symmetries - abelian and non-abelian - and different relativistic and non-relativistic models may be solved by an otherwise unmodified program.
An implementation of the single-site density matrix renormalization group (DMRG) approach for the quantum-chemical application to calculate approximate as well as exact electronic ground-state energies and wave functions of atoms and molecules is presented.The algorithm is formulated in terms of the variational and sizeconsistent class of wave functions, matrix product states, and their operator analogues, matrix product operators.A procedure to construct quantum-chemical Hamiltonian operators with long-range Coulomb interactions as matrix product operators is developed.The many-electron Hamiltonian operators are represented as sums and products of one-electron operators.For the efficient matrix product operator construction of quantum-chemical Hamiltonians, different basis spaces including discrete position and momentum space as well as molecular and atomic orbitals are investigated.Discrete position space yields the best matrix product operator size scaling, but introduces artificial long-range couplings in the kinetic energy term of the Hamiltonian which are a consequence of the DMRG algorithm in terms of matrix product states.The huge amount of discrete space points needed for an accurate description poses a problem because of the electron-electron interaction.Therefore, a momentum space or Fourier series expansion of the electron-electron interaction is shown which makes it possible to compress its matrix product operator representation.DMRG applied to quantum-chemical Hamiltonians in matrix product operator form can serve as means to directly (without mean-field treatment in advance) investigate quantum-chemical problems and find the analytically exact ground-state solution of small atoms and molecules.The next basis space analyzed in detail is the atomic orbital basis.The matrix product operator construction and the direct application of the DMRG method in this basis is examined.A physical compression scheme based on a singular value decomposition of the electron-electron interaction in the atomic orbital basis is demonstrated.Furthermore, DMRG calculations in the atomic orbital basis for certain systems where mean-field theory yields qualitatively wrong results and where higher-order approximative correction methods like truncated configuration interaction and coupled cluster cannot fully capture strong electron correlation effects are compared to results obtained in the molecular orbital basis.The comparison shows that atomic orbitals describe the physical situation well and thus lead to a tremendous reduction of the matrix product state dimension and the computational effort.i
The density-matrix renormalization group (DMRG) method has established itself over the last decade as the leading method for the simulation of the statics and dynamics of one-dimensional strongly correlated quantum lattice systems. The DMRG is a method that shares features of a renormalization group procedure (which here generates a flow in the space of reduced density operators) and of a variational method that operates on a highly interesting class of quantum states, so-called matrix product states (MPSs). The DMRG method is presented here entirely in the MPS language. While the DMRG generally fails in larger two-dimensional systems, the MPS picture suggests a straightforward generalization to higher dimensions in the framework of tensor network states. The resulting algorithms, however, suffer from difficulties absent in one dimension, apart from a much more unfavourable efficiency, such that their ultimate success remains far from clear at the moment.
Linear response theory for the density matrix renormalization group (DMRG-LRT) was first presented in terms of the DMRG renormalization projectors [J. J. Dorando, J. Hachmann, and G. K.-L. Chan, J. Chem. Phys. 130, 184111 (2009)]. Later, with an understanding of the manifold structure of the matrix product state (MPS) ansatz, which lies at the basis of the DMRG algorithm, a way was found to construct the linear response space for general choices of the MPS gauge in terms of the tangent space vectors [J. Haegeman, J. I. Cirac, T. J. Osborne, I. Pižorn, H. Verschelde, and F. Verstraete, Phys. Rev. Lett. 107, 070601 (2011)]. These two developments led to the formulation of the Tamm-Dancoff and random phase approximations (TDA and RPA) for MPS. This work describes how these LRTs may be efficiently implemented through minor modifications of the DMRG sweep algorithm, at a computational cost which scales the same as the ground-state DMRG algorithm. In fact, the mixed canonical MPS form implicit to the DMRG sweep is essential for efficient implementation of the RPA, due to the structure of the second-order tangent space. We present ab initio DMRG-TDA results for excited states of polyenes, the water molecule, and a [2Fe-2S] iron-sulfur cluster.