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.
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.
The field of tensor networks, kicked off in 1992 by Steve White's invention of the spectacularly successful density matrix renormalization group (DMRG) algorithm, has exploded in popularity in recent years. Tensor networks are poised to play a role in helping us solve some of the greatest open physics problems of our time, such as understanding the nature of high-temperature superconductivity and illuminating a theory of quantum gravity. DMRG and extensions based on a class of variational states known as tensor network states have been indispensable tools in helping us understand both numerically and theoretically the properties of complicated classical and quantum many-body systems. However, practical challenges to these techniques still remain, and algorithmic developments are needed before tensor network algorithms can be applied to more physics problems. In this thesis we present a variety of recent advancements to tensor network algorithms. First we describe a DMRG-like algorithm for noninteracting fermions. Noninteracting fermions, naturally being gapless and therefore having high levels of entanglement, are actually a challenging setting for standard DMRG algorithms, and we believe this new algorithm can help with tensor network calculations in that setting. Next we explain a new algorithm called the variational uniform matrix product state (VUMPS) algorithm that is a DMRG-like algorithm that works directly in the thermodynamic limit, improving upon currently available MPS-based methods for studying infinite 1D and quasi-1D quantum many-body systems. Finally, we describe a variety of improvements to algorithms for contracting 2D tensor networks, a common problem in tensor network algorithms, for example for studying 2D classical statistical mechanics problems and 2D quantum many-body problems with projected entangled pair states (PEPS). One is a new variant of the corner transfer matrix renormalization group (CTMRG) algorithm of Nishino and Okunishi that improves the numerical stability for contracting asymmetric two-dimensional tensor networks compared to the most commonly used method. Another is the application of the VUMPS algorithm to contracting 2D tensor networks. The last is a new alternative to CTMRG, where the tensors are solved for with eigenvalue equations instead of a power method, which we call the fixed point corner method (FPCM). We present results showing the transfer matrix VUMPS algorithm and FPCM significantly improve upon the convergence time of CTMRG. We expect these algorithms will play an important role in expanding the set of 2D classical and 2D quantum many-body problems that can be addressed with tensor networks.
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.
This chapter is to introduce some basic definitions and concepts of TN Tensor network (TN) . We will show that the TN can be used to represent quantum many-body states, where we explain MPS Matrix product state (MPS) in 1D and PEPS Projected entangled pair state (PEPS) in 2D systems, as well as the generalizations to thermal states and operators. The quantum entanglement properties of the TN states including the area law of entanglement entropy will also be discussed. Finally, we will present several special TNs that can be exactly contracted, and demonstrate the difficulty of contracting TNs in general cases.
Once developed for quantum theory, tensor networks (TNs) have been established as a successful machine learning (ML) paradigm. Now, they have been ported back to the quantum realm in the emerging field of quantum ML to assess problems that classical computers are unable to solve efficiently. Their nature at the interface between physics and ML makes TNs easily deployable on quantum computers. In this review article, we shed light on one of the major architectures considered to be predestined for variational quantum ML. In particular, we discuss how layouts like matrix product state, projected entangled pair states, tree tensor networks and multi-scale entanglement renormalization ansatz can be mapped to a quantum computer, how they can be used for ML and data encoding and which implementation techniques improve their performance.
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.
In this section, we will first demonstrate in Sect. 3.1 that many important physical problems can be transformed to 2D TNs Tensor network (TN) , and the central tasks become to compute the corresponding TN contractions. From Sects. 3.2 to 3.5, we will then present several paradigm contraction algorithms of 2D TNs including TRG Tensor renormalization group (TRG) , TEBD Time-evolving block decimation (TEBD) , and CTMRG Corner transfer matrix renormalization group (CTMRG) . Relations to other distinguished algorithms and the exactly contractible TNs will also be discussed.