Related papers: A Strictly Single-Site DMRG Algorithm with Subspac…
A zero-site density matrix renormalization algorithm (DMRG0) is proposed to minimize the energy of matrix product states (MPS). Instead of the site tensors themselves, we propose to optimize sequentially the "message" tensors between…
In the approaches based on matrix-product states (MPSs), such as the density-matrix renormalization group (DMRG) method, the ordering of the sites crucially affects the computational accuracy. We investigate the performance of an algorithm…
In order to optimize the ordering of the lattice sites in the momentum space and quantum chemistry versions of the density matrix renormalization group (DMRG) method we have studied the separability and entanglement of the target state for…
The density matrix renormalization group (DMRG) algorithm is a popular alternating minimization scheme for solving high-dimensional optimization problems in the tensor train format. Classical DMRG, however, is based on sequential…
DMRG ground state search algorithms employing symmetries must be able to expand virtual bond spaces by adding or changing symmetry sectors if these lower the energy. Traditional single-site DMRG does not allow bond expansion; two-site DMRG…
Shared-memory parallelization (SMP) strategies for density matrix renormalization group (DMRG) algorithms enable the treatment of complex systems in solid state physics. We present two different approaches by which parallelization of the…
The density matrix renormalization group (DMRG) method generates the low-energy states of linear systems of $N$ sites with a few degrees of freedom at each site by starting with a small system and adding sites step by step while keeping…
We extend the density matrix renormalization group method to exploit Parity, $C_2$ (rotation by $\pi$) and electron-hole symmtries of model Hamiltonians. We demonstrate the power of this method by obtaining the lowest energy states in all…
In this research, we propose an online basis enrichment strategy within the framework of a recently developed constraint energy minimizing generalized multiscale discontinuous Galerkin method (CEM-GMsDGM). Combining the technique of…
During the past 15 years, the density matrix renormalization group (DMRG) has become increasingly important for ab initio quantum chemistry. The underlying matrix product state (MPS) ansatz is a low-rank decomposition of the full…
We have developed an efficient method for performing density matrix renormalization group (DMRG) simulations of the SU(N) Fermi-Hubbard chain with open boundary conditions, fully leveraging the SU(N) symmetry of the problem. This method…
We develop a correction to the density matrix used in density matrix renormalization group calculations to take into account the incompleteness of the environment block. The correction allows successful calculations using only a single site…
Given in the title are two algorithms to compute the extreme eigenstate of a high-dimensional Hermitian matrix using the tensor train (TT) / matrix product states (MPS) representation. Both methods empower the traditional alternating…
Explicitly correlated methods, such as the transcorrelated method which shifts a Jastrow or Gutzwiller correlator from the wave function to the Hamiltonian, are designed for high-accuracy calculations of electronic structures, but their…
The Density Matrix Renormalization Group (DMRG) algorithm is a powerful tool for solving eigenvalue problems to model quantum systems. DMRG relies on tensor contractions and dense linear algebra to compute properties of condensed matter…
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 two key modifications to the non-spin-adapted DMRG…
We propose an initialization procedure for the density-matrix renormalization group (DMRG): {\it the recursive sweep method}. In a conventional DMRG calculation, the infinite-algorithm, where two new sites are added to the system at each…
The practical success of polynomial-time tensor network methods for computing ground states of certain quantum local Hamiltonians has recently been given a sound theoretical basis by Arad, Landau, Vazirani, and Vidick. The convergence…
The DGMRES method for solving Drazin-inverse solution of singular linear systems is generally used with restarting. But the restarting often slows down the convergence and DGMRES often stagnates. We show that adding some eigenvectors to the…
This paper presents a novel extended dynamic programming approach for energy minimization (EDP) to solve the correspondence problem for stereo and motion. A significant speedup is achieved using a recursive minimum search strategy (RMS).…