No Arabic abstract
The purpose of this paper is (i) to present a generic and fully functional implementation of the density-matrix renormalization group (DMRG) algorithm, and (ii) to describe how to write additional strongly-correlated electron models and geometries by using templated classes. Besides considering general models and geometries, the code implements Hamiltonian symmetries in a generic way and parallelization over symmetry-related matrix blocks.
Linear response theory for the density matrix renormalization group (DMRG-LRT) was first presented in terms of the DMRG renormalization projectors [Dorando et al., 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 [Haegeman et al., 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.
A detailed description of the time-step-targetting time evolution method within the DMRG algorithm is presented. The focus of this publication is on the implementation of the algorithm, and on its generic application. The case of one-site excitations within a Hubbard model is analyzed as a test for the algorithm, using open chains and two-leg ladder geometries. The accuracy of the procedure in the case of the recently discussed holon-doublon photo excitations of Mott insulators is also analyzed. Performance and parallelization issues are discussed. In addition, the full open-source code is provided as supplementary material.
We improve the density-matrix renormalization group (DMRG) evaluation of the Kubo formula for the zero-temperature linear conductance of one-dimensional correlated systems.The dynamical DMRG is used to compute the linear response of a finite system to an applied AC source-drain voltage, then the low-frequency finite-system response is extrapolated to the thermodynamic limit to obtain the DC conductance of an infinite system. The method is demonstrated on the one-dimensional spinless fermion model at half filling. Our method is able to replicate several predictions of the Luttinger liquid theory such as the renormalization of the conductance in an homogeneous conductor, the universal effects of a single barrier, and the resonant tunneling through a double barrier.
We introduce the transcorrelated Density Matrix Renormalization Group (tcDMRG) theory for the efficient approximation of the energy for strongly correlated systems. tcDMRG encodes the wave function as a product of a fixed Jastrow or Gutzwiller correlator and a matrix product state. The latter is optimized by applying the imaginary-time variant of time-dependent (TD) DMRG to the non-Hermitian transcorrelated Hamiltonian. We demonstrate the efficiency of tcDMRG at the example of the two-dimensional Fermi-Hubbard Hamiltonian, a notoriously difficult target for the DMRG algorithm, for different sizes, occupation numbers, and interaction strengths. We demonstrate fast energy convergence of tcDMRG, which indicates that tcDMRG could increase the efficiency of standard DMRG beyond quasi-monodimensional systems and provides a generally powerful approach toward the dynamic correlation problem of DMRG.
A distributed-memory parallelization strategy for the density matrix renormalization group is proposed for cases where correlation functions are required. This new strategy has substantial improvements with respect to previous works. A scalability analysis shows an overall serial fraction of 9.4% and an efficiency of around 60% considering up to eight nodes. Sources of possible parallel slowdown are pointed out and solutions to circumvent these issues are brought forward in order to achieve a better performance.