In this study, we report a parallel algorithm for the infinite-size density matrix renormalization group (iDMRG) that is applicable to one-dimensional (1D) quantum systems with
ℓ-site periods, where
ℓ is an even number. It combines Hida's iDMRG applied to random 1D spin systems with a variant of McCulloch's wavefunction prediction. This allows us to apply
ℓ/2 times of computational power to accelerate the investigation of multi-leg frustrated quantum systems in the thermodynamic limit, which is a challenging simulation. We performed benchmark calculations for a spin-1/2 Heisenberg model on a Kagome cylinder YC8 using the parallel iDMRG, and found that the proposed iDMRG was efficiently parallelized for shared memory and distributed memory systems, and provided such bulk physical quantities as total energy, bond strength on nearest neighbor spins, and spin--spin correlation functions and their correlation lengths without finite-size effects. Moreover, the variant of the wavefunction prediction sped up Lanczos methods in the parallel iDMRG by approximately three times.
In this paper we present the exact representation of a fully correlated electronic wavefunction as the single-particle basis approaches completeness. It consists of a half-infinite chain of matrices of exponentially increasing size. The complete basis limit is illustrated numerically using the density-matrix renormalization-group method by computing the core-valence entanglement in the
C2 ground state in increasing subsets of cc-pVTZ and pVQZ bases until convergence is reached.
The infinite density matrix renormalization group (iDMRG) algorithm is a highly successful numerical algorithm for the study of low-dimensional quantum systems, and is also frequently used to initialize the more popular finite DMRG algorithm. Implementations of both finite and infinite DMRG frequently incorporate support for the protection and exploitation of symmetries of the Hamiltonian. In common with other variational tensor network algorithms, convergence of iDMRG to the ground state is not guaranteed, with the risk that the algorithm may become stuck in a local minimum. In this paper, I demonstrate the existence of a particularly harmful class of physically irrelevant local minima affecting both iDMRG and to a lesser extent also infinite time-evolving block decimation (iTEBD), for which the ground state is compatible with the protected symmetries of the Hamiltonian but cannot be reached using the conventional iDMRG or iTEBD algorithms. I describe a modified iDMRG algorithm which evades these local minima, and which also admits a natural interpretation on topologically ordered systems with a boundary.