Renormalization of Tensor-network States/Models

          @misc{ scivideos_PIRSA:12030097,
            doi = {10.48660/12030097},
            url = {https://pirsa.org/12030097},
            author = {Xie, Zhiyuan},
            keywords = {Quantum Matter},
            language = {en},
            title = {Renormalization of Tensor-network States/Models},
            publisher = {Perimeter Institute for Theoretical Physics},
            year = {2012},
            month = {mar},
            note = {PIRSA:12030097 see, \url{https://scivideos.org/pirsa/12030097}}
          }
          

Abstract

One of the biggest challenges in physics is to develop accurate and efficient methods that can solve many currently intractable problems in correlated quantum or statistical systems. Tensor-network model/state is drawing more and more attention since it captures the feature of the area law and is absent from the sign problem. The evaluation of the expectation value of the observables can be reduced to the contraction of a tensor-network, which can be done by means of renormalization group method, and this is exactly what tensor renormalization group (TRG) method has done. In the light of comparison between numerical renormalization group (NRG) and density matrix renormalization group(DMRG), having considered the renormalization effect of the environment, second renormalization group (SRG) method has been proposed to improve the performance of TRG. Although TRG and SRG have achieved great success in 2D lattice, application to 3D is not easy. The talk will give a review of TRG and SRG, and talk about the HOTRG, i.e., TRG based on the higher-order singular value decomposition, and its SRG version, HOSRG. They can be easily applied to 3D lattice with relatively low memory and computation cost. The well-known 3D Ising model on simple cubic lattice has been tested. As far as our group know, HOSRG have achieved by far the most accurate renormalization group results for the 3D Ising model. Some analysis and possible applications will be also discussed.