Related papers: Computational Difficulty of Global Variations in t…
The density matrix renormalization group (DMRG) method and its applications to finite temperatures and two-dimensional systems are reviewed. The basic idea of the original DMRG method, which allows precise study of the ground state…
Wilson's Numerical Renormalization Group (NRG) is so far the only nonperturbative technique that can reliably access low-energy properties of quantum impurity systems. We present a recent extension of the method, the DM-NRG, which yields…
The infinite Density Matrix Renormalisation Group (iDMRG) algorithm is a highly successful numerical algorithm for the study of low-dimensional quantum systems, and is also frequently used to initialise the more popular finite DMRG…
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…
We present a quantum algorithm for simulating complex many-body systems and finding their ground states, combining the use of tensor networks and density matrix renormalization group (DMRG) techniques. The algorithm is based on von…
The numerical study of anyonic systems is known to be highly challenging due to their non-bosonic, non-fermionic particle exchange statistics, and with the exception of certain models for which analytical solutions exist, very little is…
The ground-state and low-energy excitations of quantum Hall systems are studied by the density matrix renormalization group (DMRG) method. From the ground-state pair correlation functions and low-energy excitions, the ground-state phase…
The density matrix renormalization group (DMRG) approach is extended to complex-symmetric density matrices characteristic of many-body open quantum systems. Within the continuum shell model, we investigate the interplay between many-body…
We generalize the recently introduced Density-Matrix Renormalization Group (DMRG-X) [Khemani et al, PRL 2016] algorithm to obtain Floquet eigenstates of one-dimensional, periodically driven many-body localized systems. This generalization…
The density matrix renormalization group (DMRG) algorithm was originally designed to efficiently compute the zero temperature or ground-state properties of one dimensional strongly correlated quantum systems. The development of the…
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 the new context. We have shown numerically that it is possible…
Global changes of states are of crucial importance in optimization algorithms. We review some heuristic algorithms in which global updates are realized by a sort of real-space renormalization group transformation. Emphasis is on the…
Accurate electronic structure calculations are essential in modern materials science, but strongly correlated systems pose a significant challenge due to their computational cost. Traditional methods, such as complete active space…
The Density Matrix Renormalisation Group (DMRG) is an electronic structure method that has recently been applied to ab-initio quantum chemistry. Even at this early stage, it has enabled the solution of many problems that would previously…
We employ the density matrix renormalization group (DMRG) and the wave function factorization method for the numerical solution of large scale nuclear structure problems. The DMRG exhibits an improved convergence for problems with realistic…
A key property of many-body localization, the localization of quantum particles in systems with both quenched disorder and interactions, is the area law entanglement of even highly excited eigenstates of many-body localized Hamiltonians.…
The density matrix renormalization group (``DMRG'') discovered by White has shown to be a powerful method to understand the properties of many one dimensional quantum systems. In the case where renormalization eventually converges to a…
We determine the computational difficulty of finding ground states of one-dimensional (1D) Hamiltonians which are known to be Matrix Product States (MPS). To this end, we construct a class of 1D frustration free Hamiltonians with unique MPS…
The renormalization group has proven to be a very powerful tool in physics for treating systems with many length scales. Here we show how it can be adapted to provide a new class of algorithms for discrete optimization. The heart of our…
Tensor network algorithms have been remarkably successful solving a variety of problems in quantum many-body physics. However, algorithms to optimize two-dimensional tensor networks known as PEPS lack many of the aspects that make the…