Exact many-body quantum problems are known to be computationally hard due to the exponential scaling of the numerical resources required. Since the advent of the Density Matrix Renormalization Group, it became clear that a successful strategy to work around this obstacle was to develop numerical methods based on the well-known theoretical renormalization group. In recent years, it was realized that quantum states engineered via numerical renormalization allow a variational representation in terms of a tensor network picture. The discovery provided a further boost to the effectiveness of these techniques, not only due to the increased flexibility and manipulability, but also because tensor network states embed a direct interface to the entanglement they carry, so that one can directly address many-body quantum correlations within these variational ansatz states. This lead to the application of several numerical tools, originally developed in the field of quantum-information, to approach condensed matter problems.
Exact many-body quantum problems are known to be computationally hard due to the exponential scaling of the numerical resources required. Since the advent of the Density Matrix Renormalization Group, it became clear that a successful strategy to work around this obstacle was to develop numerical methods based on the well-known theoretical renormalization group. In recent years, it was realized that quantum states engineered via numerical renormalization allow a variational representation in terms of a tensor network picture. The discovery provided a further boost to the effectiveness of these techniques, not only due to the increased flexibility and manipulability, but also because tensor network states embed a direct interface to the entanglement they carry, so that one can directly address many-body quantum correlations within these variational ansatz states. This lead to the application of several numerical tools, originally developed in the field of quantum-information, to approach condensed matter problems.
Renormalization group theory of tensor network states provides a powerful tool for studying quantum many-body problems and a new paradigm for understanding entangled structures of complex systems. In recent decades the theory has rapidly evolved into a universal framework and language employed by researchers in fields ranging from condensed matter theory to machine learning. This book presents a pedagogical and comprehensive introduction to this field for the first time. After an introductory survey on the major advances in tensor network algorithms and their applications, it introduces step-by-step the tensor network representations of quantum states and the tensor-network renormalization group methods developed over the past three decades. Basic statistical and condensed matter physics models are used to demonstrate how the tensor network renormalization works. An accessible primer for scientists and engineers, this book would also be ideal as a reference text for a graduate course in this area.
Tensor networks (TNs) have become one of the most essential building blocks for various fields of theoretical physics such as condensed matter theory, statistical mechanics, quantum information, and quantum gravity. This review provides a unified description of a series of developments in the TN from the statistical mechanics side. In particular, we begin with the variational principle for the transfer matrix of the 2D Ising model, which naturally leads us to the matrix product state (MPS) and the corner transfer matrix (CTM). We then explain how the CTM can be evolved to such MPS-based approaches as density matrix renormalization group (DMRG) and infinite time-evolved block decimation. We also elucidate that the finite-size DMRG played an intrinsic role for incorporating various quantum information concepts in subsequent developments in the TN. After surveying higher-dimensional generalizations like tensor product states or projected entangled pair states, we describe tensor renormalization groups (TRGs), which are a fusion of TNs and Kadanoff-Wilson type real-space renormalization groups, focusing on their fixed point structures. We then discuss how the difficulty in TRGs for critical systems can be overcome in the tensor network renormalization and the multi-scale entanglement renormalization ansatz.
This chapter starts with an introductory survey on the physical background and historical events that lead to the emergence of the density matrix renormalization group (DMRG) and its tensor network generalization. We then briefly overview the major progress on the renormalization group methods of tensor networks and their applications in the past three decades. The tensor network renormalization was initially developed to solve quantum many-body problems, but its application field has grown constantly. It has now become an irreplaceable tool for investigating strongly correlated problems, statistical physics, quantum information, quantum chemistry, and artificial intelligence.
We review the development of numerical renormalization group methods,including Wilson's numerical renormalization group,White's density matrix renormalization group,and several recent rapidly developing tensor network state-based algorithms.Among these,particular emphasis is laid on the linearized tensor renormalization group method,which was recently proposed to accurately calculate the thermodynamic properties of quantum many-body lattice systems,and which may have broad applications in both one-and two-dimensional quantum systems.
The study of interacting quantum many-body systems is one of the central challenges in modern physics. Interestingly, by understanding the physical properties of such systems from a microscopic description, one can explain many complex quantum phenomena such as the high-temperature superconductivity, fractional quantum Hall effect, etc. However, due to high complexity of these systems, theoretical investigations such as analytical and perturbation theories are limited to studying only a small subset of problems. In the past few decades, numerical simulation has emerged as an indispensable method for studying many phenomena, and has led to immense success and progress in recent years. The main obstacle in addressing quantum many-body systems is that the number of parameters required to represent a state of the system scales exponentially with the system size. However, one hardly needs the full Hilbert space but only a small subspace to describe physical properties of the system. From the point of view in quantum information theory, quantum entanglement is one of the main factors that is responsible for the complexity of studying quantum many-body systems. In particular, the amount of quantum entanglement in such system quantifies the correlation between constituents and therefore it determines how big the subspace is required to represent the system. In this thesis, we are interested in using tensor network states, a new emerging numerical technique to study dynamical and ground state properties of the system. The key ingredient is that a tensor network state which consists of a fairly small number of parameters can represent very well the complete wave function of a system. In one spatial dimension, Matrix Product State (MPS) has become a standard tool, combined with related algorithms such as Time Evolving Block Decimation algorithm (TEBD) to study dynamical properties of a locally-perturbed quantum lattice system. In this thesis, we introduce a technique called ``infinite boundary conditions'' that allows us to use a finite-size MPS to represent the state of an infinite-size system. As a result, one can simulate dynamics of a system for a longer time with a significant computational cost reduction compared to traditional methods. In two spatial dimensions, the tensor network known as Projected Entangled Pair States (PEPS) is emerging as a useful approach. However algorithms for optimizing the matrix elements of these tensors are complex and not very efficient. In particular, the efficiency of the optimization depends critically on the quality of the so-called ``environment'', which is expensive to compute. We have introduced a new method to accelerate the convergence of calculating the PEPS ground state by recycling the environment tensors for many optimization steps, vastly reducing the number of times that the full environment needs to be calculated.
Tensor network (TN), a young mathematical tool of high vitality and great potential, has been undergoing extremely rapid developments in the last two decades, gaining tremendous success in condensed matter physics, atomic physics, quantum information science, statistical physics, and so on. In this lecture notes, we focus on the contraction algorithms of TN as well as some of the applications to the simulations of quantum many-body systems. Starting from basic concepts and definitions, we first explain the relations between TN and physical problems, including the TN representations of classical partition functions, quantum many-body states (by matrix product state, tree TN, and projected entangled pair state), time evolution simulations, etc. These problems, which are challenging to solve, can be transformed to TN contraction problems. We present then several paradigm algorithms based on the ideas of the numerical renormalization group and/or boundary states, including density matrix renormalization group, time-evolving block decimation, coarse-graining/corner tensor renormalization group, and several distinguished variational algorithms. Finally, we revisit the TN approaches from the perspective of multi-linear algebra (also known as tensor algebra or tensor decompositions) and quantum simulation. Despite the apparent differences in the ideas and strategies of different TN algorithms, we aim at revealing the underlying relations and resemblances in order to present a systematic picture to understand the TN contraction approaches.