Related papers: Global optimization of tensor renormalization grou…
The higher-order tensor renormalization group is a tensor-network method providing estimates for the partition function and thermodynamical observables of classical and quantum systems in thermal equilibrium. At every step of the iterative…
Tensor networks provide compact and scalable representations of high-dimensional data, enabling efficient computation in fields such as quantum physics, numerical partial differential equations (PDEs), and machine learning. This paper…
We introduce a coarse-graining transformation for tensor networks that can be applied to study both the partition function of a classical statistical system and the Euclidean path integral of a quantum many-body system. The scheme is based…
In this paper we explore the practical use of the corner transfer matrix and its higher-dimensional generalization, the corner tensor, to develop tensor network algorithms for the classical simulation of quantum lattice systems of infinite…
Projected entangled-pair states (PEPS) have become a powerful tool for studying quantum many-body systems in the condensed matter and quantum materials context, particularly with advances in variational energy optimization methods. A key…
We propose a new renormalization scheme of tensor networks made only of third order tensors. The isometry used for coarse-graining the network can be prepared at an $O(D^6)$ computational cost in any $d$ dimension ($d \ge 2$), where $D$ is…
We use TensorNetwork [C. Roberts et al., arXiv: 1905.01330], a recently developed API for performing tensor network contractions using accelerated backends such as TensorFlow, to implement an optimization algorithm for the Multi-scale…
Tensor renormalization group (TRG) constitutes an important methodology for accurate simulations of strongly correlated lattice models. Facilitated by the automatic differentiation technique widely used in deep learning, we propose a…
We apply the projective truncation technique to the tensor renormalization group (TRG) algorithm in order to reduce the computational cost from $O(\chi^6)$ to $O(\chi^5)$, where $\chi$ is the bond dimension, and propose three kinds of…
We propose a modified form of a tensor renormalization group algorithm for evaluating partition functions of classical statistical mechanical models on 2D lattices. This algorithm coarse-grains only the rows and columns of the lattice…
We introduce a general corner transfer matrix renormalization group algorithm tailored to projected entangled-pair states on the triangular lattice. By integrating automatic differentiation, our approach enables direct variational energy…
In this paper, a way of generalizing the tensor renormalization group(TRG) is proposed. Mathematically, the connection between patterns of tensor renormalization group and the concept of truncation sequence in polytope geometry is…
We propose a new tensor renormalization group algorithm, Anisotropic Tensor Renormalization Group (ATRG), for lattice models in arbitrary dimensions. The proposed method shares the same versatility with the Higher-Order Tensor…
Tensor networks represent the state-of-the-art in computational methods across many disciplines, including the classical simulation of quantum many-body systems and quantum circuits. Several applications of current interest give rise to…
Tensor renormalization group, originally devised as a numerical technique, is emerging as a rigorous analytical framework for studying lattice models in statistical physics. Here we introduce a new renormalization map - the 2x1 map - which…
Dimensionality reduction is an essential technique for multi-way large-scale data, i.e., tensor. Tensor ring (TR) decomposition has become popular due to its high representation ability and flexibility. However, the traditional TR…
We report a real-space renormalization group (RSRG) algorithm, which is formulated through Baxter's corner transfer matrix (CTM), for two-dimensional (d = 2) classical lattice models. The new method performs the renormalization group…
An extension of the projected entangled-pair states (PEPS) algorithm to infinite systems, known as the iPEPS algorithm, was recently proposed to compute the ground state of quantum systems on an infinite two-dimensional lattice. Here we…
We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (2017)]. By encoding the truth table of each vertex…
The Corner Transfer Matrix Renormalization Group (CTMRG) algorithm is modified to measure the magnetization at the boundary of the system, including the corners of the square-shaped lattice. Using automatic differentiation, we calculate the…