We propose a second renormalization group method to handle the tensor-network states or models. This method reduces dramatically the truncation error of the tensor renormalization group. It allows physical quantities of classical tensor-network models or tensor-network ground states of quantum systems to be accurately and efficiently determined.
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 conventional TRG and the higher-order tensor renormalization group with the same bond dimension, while its computation time is almost the same as that of TRG. Furthermore, BTRG can have non-trivial fixed-point tensors at an optimal hyperparameter. We demonstrate that the singular value spectrum obtained by BTRG is invariant under the renormalization procedu…
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 Renormalization Group (HOTRG) algorithm, i.e., it preserves the lattice topology after the renormalization. In comparison with HOTRG, both of the computation cost and the memory footprint of our method are drastically reduced, especially in higher dimensions, by renormalizing tensors in an anisotropic way after the singular value decomposition. We demonstrate the ability…
We develop coarse-graining tensor renormalization group algorithms to compute physical properties of two-dimensional lattice models on finite periodic lattices. Two different coarse-graining strategies, one based on the tensor renormalization group and the other based on the higher-order tensor renormalization group, are introduced. In order to optimize the tensor-network model globally, a sweeping scheme is proposed to account for the renormalization effect from the environment tensors under the framework of second renormalization group. We demonstrate the algorithms by the classical Ising mo…
We have discussed the tensor-network representation of classical statistical or interacting quantum lattice models, and given a comprehensive introduction to the numerical methods we recently proposed for studying the tensor-network states/models in two dimensions. A second renormalization scheme is introduced to take into account the environment contribution in the calculation of the partition function of classical tensor network models or the expectation values of quantum tensor network states. It improves significantly the accuracy of the coarse grained tensor renormalization group method. …
We propose a novel algorithm with a modified Tucker decomposition for tensor network that allows for efficiently and precisely calculating the ground state and thermodynamic properties of two-dimensional (2D) quantum spin lattice systems, and is coined as the fast linearized tensor renormalization group (fLTRG). Its amazing efficiency and precision are examined by studying the spin-1/2 anisotropic Heisenberg antiferromagnet on a honeycomb lattice, and the results are found to be fairly in agreement with the quantum Monte Carlo calculations. It is also successfully applied to tackle a quasi-2D …
We introduce a tensor renormalization group scheme for coarse-graining a two-dimensional tensor network that can be successfully applied to both classical and quantum systems on and off criticality. The key innovation in our scheme is to deform a 2D tensor network into small loops and then optimize the tensors on each loop. In this way, we remove short-range entanglement at each iteration step and significantly improve the accuracy and stability of the renormalization flow. We demonstrate our algorithm in the classical Ising model and a frustrated 2D quantum model.
Techniques for approximately contracting tensor networks are limited in how efficiently they can make use of parallel computing resources. In this work we demonstrate and characterize a Monte Carlo approach to the tensor network renormalization group method which can be used straightforwardly on modern computing architectures. We demonstrate the efficiency of the technique and show that Monte Carlo tensor network renormalization provides an attractive path to improving the accuracy of a wide class of challenging computations while also providing useful estimates of uncertainty and a statistica…
A linearized tensor renormalization group (LTRG) algorithm is proposed to calculate the thermodynamic properties of one-dimensional quantum lattice models, that is incorporated with the infinite time-evolving block decimation technique, and allows for treating directly the two-dimensional transfer-matrix tensor network. To illustrate its feasibility, the thermodynamic quantities of the quantum XY spin chain are calculated accurately by the LTRG, and the precision is shown to be comparable with (even better than) the transfer matrix renormalization group (TMRG) method. Unlike the TMRG scheme th…
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, performing a controlled truncation of the resulting tensor. We benchmark this approximation procedure in two dimensions against an exact contraction. We then apply the same idea to a three dimensional system. The underlying rational for emphasizing the exact coarse graining renormalization group step prior to truncation is related to monogamy of entanglement.
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 adjacent to a single core tensor at each step, such that the lattice size shrinks linearly with the number of coarse-graining steps as opposed to shrinking exponentially as in the usual tensor renormalization group (TRG). However, the cost of this new approach only scales as $O(χ^4)$ in terms of the bond dimension $χ$, significantly cheaper than the $O(χ^6)$ cost…
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 that the tensors representing the boundary in our algorithm exhibit the fixed point structures just as bulk tensors in previous TRG algorithms. At criticality, the scale-invariant boundary fixed point tensors have the information of the conformal tower, which is described by the underlying boundary conformal field theory.
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 preparation of isometries, taking the influence of environment tensors into account. Every fundamental tensor including environment tensor is given as a rank-3 tensor, and the computational cost of the proposed algorithm scales with ${\cal O}(χ^5)$ employing the randomized SVD where $χ$ is the bond dimension of tensors. We test this method in the classical Ising mo…
We present a method for contracting a square-lattice tensor network in two dimensions, based on auxiliary tensors accomplishing successive truncations (renormalization) of 8-index tensors for 2 by 2 plaquettes into 4-index tensors. The scheme is variational, and thus the tensors can be optimized by minimizing the energy. Test results for the quantum phase transition of the transverse-field Ising model confirm that even the smallest possible tensors (two values for each tensor index at each renormalization level) produce much better results than the simple product (mean-field) state.
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 scaling dimensions. The tensor RG methods have had a great success in producing accurate free energy compared with the conventional real-space RG schemes. However, the above-mentioned canonical procedure has not been implemented for general tensor-network-based RG schemes. We extend the success of the tensor methods further to extraction of scaling dimensions th…
The tensor-entanglement renormalization group approach is applied to Hamiltonians that realize a class of topologically ordered states -- string-net condensed states. We analyze phase transitions between phases with and without string-net condensation. These phase transitions change topological order without changing any symmetries. This demonstrates that the tensor-entanglement renormalization group approach can be used to study the phase diagram of a quantum system with topologically ordered phases.
We present a new tensor network algorithm for calculating the partition function of interacting quantum field theories in 2 dimensions. It is based on the Tensor Renormalization Group (TRG) protocol, adapted to operate entirely at the level of fields. This strategy was applied in Ref.[1] to the much simpler case of a free boson, obtaining an excellent performance. Here we include an arbitrary self-interaction and treat it in the context of perturbation theory. A real space analogue of the Wilsonian effective action and its expansion in Feynman graphs is proposed. Using a $λϕ^4$ theory for benc…
We show how to build a multi-scale entanglement renormalization ansatz (MERA) representation of the ground state of a many-body Hamiltonian $H$ by applying the recently proposed \textit{tensor network renormalization} (TNR) [G. Evenbly and G. Vidal, arXiv:1412.0732] to the Euclidean time evolution operator $e^{-βH}$ for infinite $β$. This approach bypasses the costly energy minimization of previous MERA algorithms and, when applied to finite inverse temperature $β$, produces a MERA representation of a thermal Gibbs state. Our construction endows TNR with a renormalization group flow in the spa…
We study the renormalization group flow of $ϕ^4$ theory in two dimensions. Regularizing space into a fine-grained lattice and discretizing the scalar field in a controlled way, we rewrite the partition function of the theory as a tensor network. Combining local truncations and a standard coarse-graining scheme, we obtain the renormalization group flow of the theory as a map in a space of tensors. Aside from qualitative insights, we verify the scaling dimensions at criticality and extrapolate the critical coupling constant $f_{\rm c} = λ/ μ^2$ to the continuum to find $f^{\rm cont.}_{\rm c} = 1…
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 tensor network coarse-graining algorithm, it yields a proper renormalization group (RG) flow. Compared to existing methods, the advantages of our algorithm are its low computational cost, simplicity of implementation, and applicability to any network. We benchmark it by evaluating physical observables for the 2D classical Ising model and find accuracy comparab…
We review different descriptions of many--body quantum systems in terms of tensor product states. We introduce several families of such states in terms of known renormalization procedures, and show that they naturally arise in that context. We concentrate on Matrix Product States, Tree Tensor States, Multiscale Entanglement Renormalization Ansatz, and Projected Entangled Pair States. We highlight some of their properties, and show how they can be used to describe a variety of systems.
We discuss in detail algorithms for implementing tensor network renormalization (TNR) for the study of classical statistical and quantum many-body systems. Firstly, we recall established techniques for how the partition function of a 2D classical many-body system or the Euclidean path integral of a 1D quantum system can be represented as a network of tensors, before describing how TNR can be implemented to efficiently contract the network via a sequence of coarse-graining transformations. The efficacy of the TNR approach is then benchmarked for the 2D classical statistical and 1D quantum Ising…
Traditional mean-field theory is a simple generic approach for understanding various phases. But that approach only applies to symmetry breaking states with short-range entanglement. In this paper, we describe a generic approach for studying 2D quantum phases with long-range entanglement (such as topological phases). Our approach is a variational method that uses tensor product states (also known as projected entangled pair states) as trial wave functions. We use a 2D real space RG algorithm to evaluate expectation values in these wave functions. We demonstrate our algorithm by studying severa…
The projective construction (the slave-particle approach) has played an very important role in understanding strongly correlated systems, such as the emergence of fermions, anyons, and gauge theory in quantum spin liquids and quantum Hall states. Recently, fermionic Projected Entangled Pair States (fPEPS) have been introduced to effciently represent many-body fermionic states. In this paper, we show that the strongly correlated bosonic/fermionic states obtained both from the projective construction and the fPEPS approach can be represented systematically as Grassmann tensor product states. Thi…
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 …
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 uniform framework of differentiable TRG ($\partial$TRG) that can be applied to improve various TRG methods, in an automatic fashion. Essentially, $\partial$TRG systematically extends the concept of second renormalization [PRL 103, 160601 (2009)] where the tensor environment is computed recursively in the backward iteration, in the sense that given the forward proc…
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 upon the insertion of optimized unitary and isometric tensors (disentanglers and isometries) into the tensor network and has, as its key feature, the ability to remove short-range entanglement/correlations at each coarse-graining step. Removal of short-range entanglement results in scale invariance being explicitly recovered at criticality. In this way we ob…
We investigate the metal-insulator transition of the (1+1)-dimensional Hubbard model in the path-integral formalism with the tensor renormalization group method. The critical chemical potential $μ_{\rm c}$ and the critical exponent $ν$ are determined from the $μ$ dependence of the electron density in the thermodynamic limit. Our results for $μ_{\rm c}$ and $ν$ show consistency with an exact solution based on the Bethe ansatz. Our encouraging results indicate the applicability of the tensor renormalization group method to the analysis of higher-dimensional Hubbard models.
In this paper, we perform a comprehensive study of the renormalization group (RG) method on thermal tensor networks (TTN). By Trotter-Suzuki decomposition, one obtains the 1+1D TTN representing the partition function of 1D quantum lattice models, and then employs efficient RG contractions to obtain the thermodynamic properties with high precision. The linearized tensor renormalization group (LTRG) method, which can be used to contract TTN in an efficient and accurate way, is briefly reviewed. In addition, the single-layer LTRG can be generalized to a bilayer form, dubbed as LTRG++, in both fin…
Tensor Network States (TNS) offer an efficient representation for the ground state of quantum many body systems and play an important role in the simulations of them. Numerous TNS are proposed in the past few decades. However, due to the high cost of TNS for two-dimensional systems, a balance between the encoded entanglement and computational complexity of TNS is yet to be reached. In this work we introduce a new Tree Tensor Network (TTN) based TNS dubbed as Fully- Augmented Tree Tensor Network (FATTN) by releasing the constraint in Augmented Tree Tensor Network (ATTN). When disentanglers are …
We study the renormalization group flow of the Lagrangian for statistical and quantum systems by representing their path integral in terms of a tensor network. Using a tensor-entanglement-filtering renormalization (TEFR) approach that removes local entanglement and coarse grain the lattice, we show that the resulting renormalization flow of the tensors in the tensor network has a nice fixed-point structure. The isolated fixed-point tensors $T_{inv}$ plus the symmetry group $G_{sym}$ of the tensors (i.e. the symmetry group of the Lagrangian) characterize various phases of the system. Such a cha…
We analyze classical dimer models on the square and triangular lattice using a tensor network representation of the dimers. The correlation functions are numerically calculated using the recently developed "Tensor renormalization group" (TRG) technique. The partition function for the dimer problem can be calculated exactly by the Pfaffian method which is used here as a platform for comparing the numerical results. TRG turns out to be a powerful tool for describing gapped systems with exponentially decaying correlations very efficiently due to its fast convergence. This is the case for the dime…
On the lattice, a renormalization group (RG) flow for two-dimensional partition functions expressed as a tensor network can be obtained using the tensor network renormalization (TNR) algorithm [G. Evenbly, G. Vidal, Phys. Rev. Lett. 115 (18), 180405 (2015)]. In this work we explain how to extend TNR to field theories in the continuum. First, a short-distance length scale $1/Λ$ is introduced in the continuum partition function by smearing the fields. The resulting object is still defined in the continuum but has no fluctuations at distances shorter than $1/Λ$. An infinitesimal coarse-graining s…
Using the tensor renormalization group method based on the higher-order singular value decom- position, we have studied the thermodynamic properties of the continuous XY model on the square lattice. The temperature dependence of the free energy, the internal energy and the specific heat agree with the Monte Carlo calculations. From the field dependence of the magnetic susceptibility, we find the Kosterlitz-Thouless transition temperature to be 0.8921 \pm 0.0019, consistent with the Monte Carlo as well as the high temperature series expansion results. At the transition temperature, the critical…
A Gibbs operator $e^{-βH}$ for a 2D lattice system with a Hamiltonian $H$ can be represented by a 3D tensor network, the third dimension being the imaginary time (inverse temperature) $β$. Coarse-graining the network along $β$ results in an accurate 2D projected entangled-pair operator (PEPO) with a finite bond dimension. The coarse-graining is performed by a tree tensor network of isometries that are optimized variationally to maximize the accuracy of the PEPO. The algorithm is applied to the two-dimensional Hubbard model on an infinite square lattice. Benchmark results are obtained that are …
Consider the partition function of a classical system in two spatial dimensions, or the Euclidean path integral of a quantum system in two space-time dimensions, both on a lattice. We show that the tensor network renormalization (TNR) algorithm [\emph{G. Evenbly and G. Vidal, Phys. Rev. Lett. 115, 180405}] can be used to implement local scale transformations on these objects, namely a lattice version of conformal maps. Specifically, we explain how to implement the lattice equivalent of the logarithmic conformal map that transforms the Euclidean plane into a cylinder. As an application, and wit…
The full-density-matrix numerical renormalization group (NRG) has evolved as a systematic and transparent setting for the cal- culation of thermodynamical quantities at arbitrary temperatures within the NRG framework. It directly evaluates the relevant Lehmann representations based on the complete basis sets intro- duced by Anders and Schiller (2005). In addition, specific attention is given to the possible feedback from low energy physics to high energies by the explicit and careful construction of the full thermal density matrix, naturally generated over a distribution of energy shells. Spec…
Novel randomness-induced disordered ground states in two-dimensional (2D) quantum spin systems have been attracting much interest. For quantitative analysis of such random quantum spin systems, one of the most promising numerical approaches is the tensor-network strong-disorder renormalization group (tSDRG), which was basically established for one-dimensional (1D) systems. In this paper, we propose a possible improvement of its algorithm toward 2D random spin systems, focusing on a generating process of the tree network structure of tensors, and precisely examine their performances for the ran…
We propose an entanglement-based algorithm of the tensor-network strong-disorder renormalization group (tSDRG) method for quantum spin systems with quenched randomness. In contrast to the previous tSDRG algorithm based on the energy spectrum of renormalized block Hamiltonians, we directly utilizes the entanglement structure associated with the blocks to be renormalized. We examine accuracy of the new algorithm for the random antiferromagnetic Heisenberg models on the one-dimensional, triangular, and square lattices. We then find that the entanglement-based tSDRG achieves better accuracy than t…
Lattice regularized Schwinger model with a so-called $θ$ term is studied by using the Grassmann tensor renormalization group. We perform the Lee-Yang and Fisher zero analyses in order to investigate the phase structure at $θ=π$. We find a first order phase transition at larger fermion mass. Both of the Lee-Yang zero and Fisher zero analyses indicate that the critical endpoint at which the first order phase transition terminates belongs to the Ising universality class.
We propose a new class of tensor-network states, which we name projected entangled simplex states (PESS), for studying the ground-state properties of quantum lattice models. These states extend the pair-correlation basis of projected entangled pair states (PEPS) to a simplex. PESS are an exact representation of the simplex solid states and provide an efficient trial wave function that satisfies the area law of entanglement entropy. We introduce a simple update method for evaluating the PESS wave function based on imaginary-time evolution and the higher-order singular-value decomposition of ten…
We propose a tensor network method for investigating strongly disordered systems that is based on an adaptation of entanglement renormalization [G. Vidal, Phys. Rev. Lett. 99, 220405 (2007)]. This method makes use of the strong disorder renormalization group to determine the order in which lattice sites are coarse-grained, which sets the overall structure of the corresponding tensor network ansatz, before optimization using variational energy minimization. Benchmark results from the disordered XXZ model demonstrates that this approach accurately captures ground state entanglement in disordered…
We apply the Grassmann tensor renormalization group to the lattice regularized Schwinger model with one-flavor of the Wilson fermion. We study the phase diagram in the $(β,κ)$ plane performing a detailed analysis of the scaling behavior of the Lee-Yang zeros and the peak height of the chiral susceptibility. Our results strongly indicate that the whole range of the phase transition line starting from $(β,κ)=(0.0,0.380665(59))$ and ending at $(\infty,0.25)$ belongs to the two-dimensional Ising universality class similarly to the free fermion case.
We investigate tree tensor network states for quantum chemistry. Tree tensor network states represent one of the simplest generalizations of matrix product states and the density matrix renormalization group. While matrix product states encode a one-dimensional entanglement structure, tree tensor network states encode a tree entanglement structure, allowing for a more flexible description of general molecules. We describe an optimal tree tensor network state algorithm for quantum chemistry. We introduce the concept of half-renormalization which greatly improves the efficiency of the calculatio…
We numerically obtain the conformal spectrum of several classical spin models on a two-dimensional lattice with open boundaries, for every boundary fixed point obtained by the Cardy's derivation [J. L. Cardy, Nucl. Phys. B 324, 581 (1989)]. In order to extract accurate conformal data, we implement the tensor network renormalization algorithm [G. Evenbly and G. Vidal, Phys. Rev. Lett. 115, 180405 (2015)] extended so as to be applicable to a square lattice with open boundaries. We successfully compute the boundary conformal spectrum consistent with the underlying boundary conformal field theorie…
We investigate the doping-driven metal-insulator transition of the (2+1)-dimensional Hubbard model in the path-integral formalism with the tensor renormalization group method. We calculate the electron density $\langle n\rangle$ as a function of the chemical potential $μ$ choosing three values of the Coulomb potential with $U=80$, $8$, and $2$ as representative cases of the strong, intermediate, and weak couplings. We have determined the critical chemical potential at each $U$, where the Hubbard model undergoes the metal-insulator transition from the half-filling plateau with $\langle n\rangle…
Tensor network techniques have proved to be powerful tools that can be employed to explore the large scale dynamics of lattice systems. Nonetheless, the redundancy of degrees of freedom in lattice gauge theories (and related models) poses a challenge for standard tensor network algorithms. We accommodate for such systems by introducing an additional structure decorating the tensor network. This allows to explicitly preserve the gauge symmetry of the system under coarse graining and straightforwardly interpret the fixed point tensors. We propose and test (for models with finite Abelian groups) …
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 the tensor using the truncated singular value decomposition (SVD), whose computational cost increases as the bond dimension increases, so that efficient cost reduction techniques are highly demanded. We use noise vectors for the low-rank approximation with the truncated SVD, by which the truncation error is replaced with a statistical error due to noise, and a…
By combining the Grassmann algebra with multi-scale entanglement renormalization ansatz (MERA), we introduce a new unbiased and effective numerical method for simulating 2D strongly correlated electronic systems. The new GMERA method inherits all the advantages of MERA, which constructs the variational wave function based on complicated tensor network. Besides it can deal with fermionic properties of the system due to Grassmann algebra through local tensor contractions. This general method can treat different tensor network structures in a universal way. We show several benchmark calculations …
