Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1809.08030 · Physical review. B./Physical review. B

Tensor renormalization group algorithms with a projective truncation method

Yoshifumi Nakamura, Hideaki Oba, Shinji Takeda

Published Apr 1, 2019• 18 citations
arXivHTMLPDF

Abstract

We apply the projective truncation technique to the tensor renormalization group (TRG) algorithm in order to reduce the computational cost from $O({\ensuremath{\chi}}^{6})$ to $O({\ensuremath{\chi}}^{5})$, where $\ensuremath{\chi}$ is the bond dimension, and propose three kinds of algorithms for demonstration. On the other hand, the technique causes a systematic error due to the incompleteness of a projector composed of isometries and in addition requires iteration steps to determine the isometries. Nevertheless, we find that the accuracy of the free energy for the Ising model on a square lattice is recovered to the level of TRG with a few iteration steps even at the critical temperature for $\ensuremath{\chi}=32$, 48, and 64.

DOI
10.1103/physrevb.99.155101

Related papers

Hybrid stochastic method for the tensor renormalization group

Hiroshi Ohki, Masaaki Tomii, Erika Arai

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 an error estimation could be improved. We test this method in the classical Ising model and observe a better accuracy than TRG. We also discuss a cross contamination issue in a multiple use of the same noise vectors, and to remove this systematic error we consider position-dependent noise vectors.

arXiv:2110.11921•International Symposium on Lattice Field Theory (LATTICE)•May 16, 2022•0 citations

High-Dimensional Tensor Renormalization Group with Tensor Train Lattice

Hisanori Kiryu

Abstract The tensor renormalization group (TRG) is a highly effective method for calculating the free energy of lattice models and has demonstrated exceptional accuracy for several low-dimensional systems. However, its application to higher-dimensional models is often hampered by a large memory footprint and high computational cost. In this paper, we propose a new algorithm, “tt-lattice”, which approximates the tensor at each lattice vertex using a tensor train (tt) decomposition. The algorithm is designed to maintain the tt-format throughout the TRG computation, which significantly reduces both memory usage and computational cost. For a uniform lattice model, the computational cost of tt-lattice scales as $\mathcal {O}(d^2\log (L)\chi ^6)$, with the largest intermediate tensor size of $\mathcal {O}(\chi ^4)$, where d is the lattice dimension, L is the linear size of each lattice axis, and $\chi$ is the cutoff of the number of lattice edge states. To validate our algorithm, we conducted numerical experiments on a Gaussian field model, for which the exact free energy is computable in any lattice dimensions. The results demonstrate that the tt-lattice method can calculate the free energy with reasonable accuracy even for a 10D lattice model with modern computational architectures.

Progress of Theoretical and Experimental Physics•Dec 26, 2025•0 citations

Anisotropic tensor renormalization group

Daiki Adachi, Tsuyoshi Okubo, Synge Todo

We propose a different 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 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 of ATRG for the square lattice and the simple cubic lattice Ising models. Although the accuracy of the present method degrades when compared with HOTRG of the same bond dimension, the accuracy with fixed computation time is improved greatly due to the drastic reduction of the computation cost.

arXiv:1906.02007•Physical review. B./Physical review. B•Aug 24, 2020•83 citations

High-precision thermodynamic and critical properties from tensor renormalization-group flows

Michael Hinczewski, A. Nihat Berker

The recently developed tensor renormalization-group (TRG) method provides a highly precise technique for deriving thermodynamic and critical properties of lattice Hamiltonians. The TRG is a local coarse-graining transformation, with the elements of the tensor at each lattice site playing the part of the interactions that undergo the renormalization-group flows. These tensor flows are directly related to the phase diagram structure of the infinite system, with each phase flowing to a distinct surface of fixed points. Fixed-point analysis and summation along the flows give the critical exponents, as well as thermodynamic functions along the entire temperature range. Thus, for the ferromagnetic triangular lattice Ising model, the free energy is calculated to better than 10(-5) along the entire temperature range. Unlike previous position-space renormalization-group methods, the truncation (of the tensor index range D) in this general method converges under straightforward and systematic improvements. Our best results are easily obtained with D=24, corresponding to 4624-dimensional renormalization-group flows.

arXiv:0709.2803•Physical Review E•Jan 7, 2008•14 citations

Bond-weighted tensor renormalization group

Daiki Adachi, Tsuyoshi Okubo, Synge Todo

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, whereas its computation time is almost the same as that of TRG. Furthermore, BTRG can have nontrivial fixed-point tensors at an optimal hyperparameter. We demonstrate that the singular value spectrum obtained by BTRG is invariant under the renormalization procedure in the case of the two-dimensional Ising model at the critical point. This property indicates that BTRG performs the tensor contraction with high accuracy whereas keeping the scale-invariant structure of tensors.

arXiv:2011.01679•Physical review. B./Physical review. B•Feb 3, 2022•39 citations

高精度テンソル繰り込み群法とその応用

Adachi, Daiki

High-accuracy tensor renormalization group algorithms and their applications (高精度テンソル繰り込み群法とその応用) 氏 名 足立 大樹We propose novel real-space renormalization group algorithms for classical and quantum lattice models.Conventionally, the tensor renormalization group (TRG) algorithm proposed by Levin and Nave in 2007 and the higher-order tensor renormalization group (HOTRG) algorithm proposed by Xie et al. in 2012 have been widely used as efficient numerical renormalization methods to study large-scale classical and quantum spin systems.The accuracy of the tensor network algorithms is generally controlled by the bond dimension χ, which is the cutoff of tensor indices.With a fixed bond dimension χ, TRG can renormalize the two-dimensional squarelattice tensor network within O ( χ 5 ) computational time.However, it is difficult to apply the TRG algorithm to models in three or higher dimensions.On the other hand, HOTRG can be applied, at least in principle, to higher-dimensional models, and it has a higher accuracy than TRG when comparing with the same bond dimension, while the computational cost of O ( χ 4d-1 ) for d-dimensional models is higher than TRG even in two dimensions and too high to execute simulations for higher-dimensional models in practice.New algorithms that can perform the real-space renormalization in general dimensions with a reasonable cost are strongly demanded.

•Mar 23, 2020•0 citations
We apply the projective truncation technique to the tensor renormalization group (TRG) algorithm in order to reduce the computational cost from O(\ensuremathχ6)O({\ensuremath{\chi}}^{6})O(\ensuremathχ6) to O(\ensuremathχ5)O({\ensuremath{\chi}}^{5})O(\ensuremathχ5), where \ensuremathχ\ensuremath{\chi}\ensuremathχ is the bond dimension, and propose three kinds of algorithms for demonstration. On the other hand, the technique causes a systematic error due to the incompleteness of a projector composed of isometries and in addition requires iteration steps to determine the isometries. Nevertheless, we find that the accuracy of the free energy for the Ising model on a square lattice is recovered to the level of TRG with a few iteration steps even at the critical temperature for \ensuremathχ=32\ensuremath{\chi}=32\ensuremathχ=32, 48, and 64.
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 an error estimation could be improved. We test this method in the classical Ising model and observe a better accuracy than TRG. We also discuss a cross contamination issue in a multiple use of the same noise vectors, and to remove this systematic error we consider position-dependent noise vectors.
Abstract The tensor renormalization group (TRG) is a highly effective method for calculating the free energy of lattice models and has demonstrated exceptional accuracy for several low-dimensional systems. However, its application to higher-dimensional models is often hampered by a large memory footprint and high computational cost. In this paper, we propose a new algorithm, “tt-lattice”, which approximates the tensor at each lattice vertex using a tensor train (tt) decomposition. The algorithm is designed to maintain the tt-format throughout the TRG computation, which significantly reduces both memory usage and computational cost. For a uniform lattice model, the computational cost of tt-lattice scales as O(d2log⁡(L)χ6)\mathcal {O}(d^2\log (L)\chi ^6)O(d2log(L)χ6), with the largest intermediate tensor size of O(χ4)\mathcal {O}(\chi ^4)O(χ4), where d is the lattice dimension, L is the linear size of each lattice axis, and χ\chiχ is the cutoff of the number of lattice edge states. To validate our algorithm, we conducted numerical experiments on a Gaussian field model, for which the exact free energy is computable in any lattice dimensions. The results demonstrate that the tt-lattice method can calculate the free energy with reasonable accuracy even for a 10D lattice model with modern computational architectures.
We propose a different 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 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 of ATRG for the square lattice and the simple cubic lattice Ising models. Although the accuracy of the present method degrades when compared with HOTRG of the same bond dimension, the accuracy with fixed computation time is improved greatly due to the drastic reduction of the computation cost.
The recently developed tensor renormalization-group (TRG) method provides a highly precise technique for deriving thermodynamic and critical properties of lattice Hamiltonians. The TRG is a local coarse-graining transformation, with the elements of the tensor at each lattice site playing the part of the interactions that undergo the renormalization-group flows. These tensor flows are directly related to the phase diagram structure of the infinite system, with each phase flowing to a distinct surface of fixed points. Fixed-point analysis and summation along the flows give the critical exponents, as well as thermodynamic functions along the entire temperature range. Thus, for the ferromagnetic triangular lattice Ising model, the free energy is calculated to better than 10(-5) along the entire temperature range. Unlike previous position-space renormalization-group methods, the truncation (of the tensor index range D) in this general method converges under straightforward and systematic improvements. Our best results are easily obtained with D=24, corresponding to 4624-dimensional renormalization-group flows.
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, whereas its computation time is almost the same as that of TRG. Furthermore, BTRG can have nontrivial fixed-point tensors at an optimal hyperparameter. We demonstrate that the singular value spectrum obtained by BTRG is invariant under the renormalization procedure in the case of the two-dimensional Ising model at the critical point. This property indicates that BTRG performs the tensor contraction with high accuracy whereas keeping the scale-invariant structure of tensors.
High-accuracy tensor renormalization group algorithms and their applications (高精度テンソル繰り込み群法とその応用) 氏 名 足立 大樹We propose novel real-space renormalization group algorithms for classical and quantum lattice models.Conventionally, the tensor renormalization group (TRG) algorithm proposed by Levin and Nave in 2007 and the higher-order tensor renormalization group (HOTRG) algorithm proposed by Xie et al. in 2012 have been widely used as efficient numerical renormalization methods to study large-scale classical and quantum spin systems.The accuracy of the tensor network algorithms is generally controlled by the bond dimension χ, which is the cutoff of tensor indices.With a fixed bond dimension χ, TRG can renormalize the two-dimensional squarelattice tensor network within O ( χ 5 ) computational time.However, it is difficult to apply the TRG algorithm to models in three or higher dimensions.On the other hand, HOTRG can be applied, at least in principle, to higher-dimensional models, and it has a higher accuracy than TRG when comparing with the same bond dimension, while the computational cost of O ( χ 4d-1 ) for d-dimensional models is higher than TRG even in two dimensions and too high to execute simulations for higher-dimensional models in practice.New algorithms that can perform the real-space renormalization in general dimensions with a reasonable cost are strongly demanded.