Related papers: Initial tensor construction and dependence of the …
We propose a method to construct the initial tensor representation of partition functions and observables for the tensor renormalization group (TRG). The TRG is a numerical calculation technique that utilizes a tensor network…
We introduce an efficient algorithm for reducing bond dimensions in an arbitrary tensor network without changing its geometry. The method is based on a novel, quantitative understanding of local correlations in a network. Together with a…
We propose a real-space renormalization group algorithm for accurately coarse-graining two-dimensional tensor networks. The central innovation of our method lies in utilizing variational boundary tensors as a globally optimized environment…
We propose a method to represent the path integral over gauge fields as a tensor network. We introduce a trial action with variational parameters and generate gauge field configurations with the weight defined by the trial action. We…
We propose an improved tensor renormalization group (TRG) algorithm, the bond-weighted TRG (BTRG). In BTRG, we generalize the conventional TRG by introducing bond weights on the edges of the tensor network. We show that BTRG outperforms the…
We propose a second renormalization group (SRG) in the triad representation of tensor networks. The SRG method improves two parts of the triad tensor renormalization group, which are the decomposition of intermediate tensors and the…
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 develop the tensor renormalization group (TRG) algorithm for statistical systems with open boundaries, which allows us to investigate not only the bulk but also the boundary property, such as the surface magnetization. We demonstrate…
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…
Anisotropic Tensor Renormalization Group (ATRG) is a powerful algorithm for four-dimensional tensor network calculations. However, the larger bond dimensions are known to be difficult to achieve in practice due to the higher computational…
Tensor renormalization group method (TRG) is a real space renormalization group approach. It has been successfully applied to both classical and quantum systems. In this paper, we study a disordered and frustrated system, the…
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 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…
Building upon previous $2D$ studies, this research focuses on describing $3D$ tensor renormalisation group (RG) flows for lattice spin systems, such as the Ising model. We present a novel RG map, which operates on tensors with…
We propose a hybrid stochastic method for the tensor renormalization group (TRG) approach. TRG is known as a powerful tool to study the many-body systems and quantum field theory on the lattice. It is based on a low-rank approximation of…
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…
We show a way to perform the canonical renormalization group (RG) prescription in tensor space: write down the tensor RG equation, linearize it around a fixed-point tensor, and diagonalize the resulting linearized RG equation to obtain…
We present a new strategy for contracting tensor networks in arbitrary geometries. This method is designed to follow as strictly as possible the renormalization group philosophy, by first contracting tensors in an exact way and, then,…
We propose a data-driven approach to identifying the functionally independent invariants that can be constructed from a tensor with a given symmetry structure. Our algorithm proceeds by first enumerating graphs, or tensor networks, that…
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…