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

International Symposium on Lattice Field Theory (LATTICE)

Initial tensor construction and dependence for tensor renormalization group

Katsumasa Nakayama, Manuel Schneider

Published Jan 29, 2025• 0 citations
Publisher

Abstract

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 representations of physical quantities to investigate physical properties without encountering the sign problem. To apply the TRG, it is essential to construct a locally connected tensor network suitable for recursive coarse-graining. We present a systematic approach for translating a general tensor representation of the partition function to this form. Furthermore, we show the dependence of TRG algorithms on the choice of the initial tensor network representation and propose an improvement of TRG algorithms in this respect

DOI
10.22323/1.466.0043

Related papers

Initial tensor construction for the tensor renormalization group

Katsumasa Nakayama, Manuel Schneider

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 representations of physical quantities to investigate physical properties without encountering the sign problem. To apply the TRG, it is essential to construct a locally connected tensor network suitable for recursive coarse-graining. We present a systematic approach for translating a general tensor representation of the partition function to this form. Furthermore, we show the dependence of TRG algorithms on the choice of the initial tensor network representation and propose an improvement of TRG algorithms in this respect

arXiv:2501.11810•Jan 21, 2025•0 citations

Initial tensor construction and dependence of the tensor renormalization group on initial tensors

Katsumasa Nakayama, Manuel Schneider

We propose a method to construct a tensor network representation of partition functions without singular value decompositions nor series expansions. The approach is demonstrated for one- and two-dimensional Ising models and we study the dependence of the tensor renormalization group (TRG) on the form of the initial tensors and their symmetries. We further introduce variants of several tensor renormalization algorithms. Our benchmarks reveal a significant dependence of various TRG algorithms on the choice of initial tensors and their symmetries. However, we show that the boundary TRG technique can eliminate the initial tensor dependence for all TRG methods. The numerical results of TRG calculations can thus be made significantly more robust with only a few changes in the code. Furthermore, we study a three-dimensional Z 2 gauge theory without gauge fixing and confirm the applicability of the initial tensor construction. Our method can straightforwardly be applied to systems with longer range and multisite interactions, such as the next-nearest neighbor Ising model. Published by the American Physical Society 2024

arXiv:2407.14226•Physical review. D/Physical review. D.•Nov 4, 2024•3 citations

Variational boundary based tensor network renormalization group

Feng-Feng Song, Naoki Kawashima

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 for the entire system. Based on this optimized environment, we construct renormalization projectors that significantly enhance accuracy. By leveraging the canonical form of tensors, our algorithm maintains the same computational complexity as the original tensor renormalization group (TRG) method, yet achieves higher accuracy than existing approaches that do not incorporate entanglement filtering. Our work offers a practical pathway for extending TRG methods to higher dimensions while keeping computational costs manageable.

arXiv:2508.10418•Physical review. B./Physical review. B•Dec 10, 2025•1 citation

Cost-efficient cutoff method for tensor renormalization group with randomized singular value decomposition

Haruka Yamada, Akira Imakura, Tetsuya Sakurai

Tensor renormalization group (TRG) is a coarse-graining algorithm for approximating the partition function using a tensor network in the field of elementary particle physics.Although the computational cost of TRG can be reduced using a randomized singular value decomposition, its computation time is still large.In this paper, we propose a cost-efficient cutoff method for calculating TRG by truncating small tensor elements.Numerical experiments showed that the proposed method is faster than the conventional one without degrading accuracy.

JSIAM Letters•Jan 1, 2018•0 citations

Tensor renormalization group centered about a core tensor

Wangwei Lan, Glen Evenbly

We propose a modified form of tensor renormalization-group algorithm for evaluating partition functions of classical statistical mechanical models on two-dimensional 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 approach only scales as $O({\ensuremath{\chi}}^{4})$ in terms of the bond dimension $\ensuremath{\chi}$, significantly cheaper than the $O({\ensuremath{\chi}}^{6})$ cost scaling of TRG, whereas numerical benchmarking indicates that both approaches have comparable accuracy for the same bond dimension $\ensuremath{\chi}$. It follows that the algorithm can allow for more accurate investigation of classical models on modestly sized lattices than is possible with standard TRG.

arXiv:1906.09283•Physical review. B./Physical review. B•Dec 11, 2019•8 citations

Entanglement filtering and improved coarse-graining on two dimensional tensor networks including fermions

Ryo Sakai, Muhammad Asaduzzaman, Simon M. Catterall +2 more

Tensor renormalization group (TRG) has attractive features like the absence of sign problems and the accessibility to the thermodynamic limit, and many applications to lattice field theories have been reported so far. However it is known that the TRG has a fictitious fixed point that is called the CDL tensor and that causes less accurate numerical results. There are improved coarse-graining methods that attempt to remove the CDL structure from tensor networks. Such approaches have been shown to be beneficial on two dimensional spin systems. We discuss how to adapt the removal of the CDL structure to tensor networks including fermions, and numerical results that contain some comparisons to the plain TRG, where significant differences are found, will be shown. The detailed discussion of this work is given in ref. [1].

International Symposium on Lattice Field Theory (LATTICE)•Feb 1, 2023•0 citations
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 representations of physical quantities to investigate physical properties without encountering the sign problem. To apply the TRG, it is essential to construct a locally connected tensor network suitable for recursive coarse-graining. We present a systematic approach for translating a general tensor representation of the partition function to this form. Furthermore, we show the dependence of TRG algorithms on the choice of the initial tensor network representation and propose an improvement of TRG algorithms in this respect
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 representations of physical quantities to investigate physical properties without encountering the sign problem. To apply the TRG, it is essential to construct a locally connected tensor network suitable for recursive coarse-graining. We present a systematic approach for translating a general tensor representation of the partition function to this form. Furthermore, we show the dependence of TRG algorithms on the choice of the initial tensor network representation and propose an improvement of TRG algorithms in this respect
We propose a method to construct a tensor network representation of partition functions without singular value decompositions nor series expansions. The approach is demonstrated for one- and two-dimensional Ising models and we study the dependence of the tensor renormalization group (TRG) on the form of the initial tensors and their symmetries. We further introduce variants of several tensor renormalization algorithms. Our benchmarks reveal a significant dependence of various TRG algorithms on the choice of initial tensors and their symmetries. However, we show that the boundary TRG technique can eliminate the initial tensor dependence for all TRG methods. The numerical results of TRG calculations can thus be made significantly more robust with only a few changes in the code. Furthermore, we study a three-dimensional Z 2 gauge theory without gauge fixing and confirm the applicability of the initial tensor construction. Our method can straightforwardly be applied to systems with longer range and multisite interactions, such as the next-nearest neighbor Ising model. Published by the American Physical Society 2024
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 for the entire system. Based on this optimized environment, we construct renormalization projectors that significantly enhance accuracy. By leveraging the canonical form of tensors, our algorithm maintains the same computational complexity as the original tensor renormalization group (TRG) method, yet achieves higher accuracy than existing approaches that do not incorporate entanglement filtering. Our work offers a practical pathway for extending TRG methods to higher dimensions while keeping computational costs manageable.
Tensor renormalization group (TRG) is a coarse-graining algorithm for approximating the partition function using a tensor network in the field of elementary particle physics.Although the computational cost of TRG can be reduced using a randomized singular value decomposition, its computation time is still large.In this paper, we propose a cost-efficient cutoff method for calculating TRG by truncating small tensor elements.Numerical experiments showed that the proposed method is faster than the conventional one without degrading accuracy.
We propose a modified form of tensor renormalization-group algorithm for evaluating partition functions of classical statistical mechanical models on two-dimensional 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 approach only scales as $O({\ensuremath{\chi}}^{4})$ in terms of the bond dimension $\ensuremath{\chi}$, significantly cheaper than the $O({\ensuremath{\chi}}^{6})$ cost scaling of TRG, whereas numerical benchmarking indicates that both approaches have comparable accuracy for the same bond dimension $\ensuremath{\chi}$. It follows that the algorithm can allow for more accurate investigation of classical models on modestly sized lattices than is possible with standard TRG.
Tensor renormalization group (TRG) has attractive features like the absence of sign problems and the accessibility to the thermodynamic limit, and many applications to lattice field theories have been reported so far. However it is known that the TRG has a fictitious fixed point that is called the CDL tensor and that causes less accurate numerical results. There are improved coarse-graining methods that attempt to remove the CDL structure from tensor networks. Such approaches have been shown to be beneficial on two dimensional spin systems. We discuss how to adapt the removal of the CDL structure to tensor networks including fermions, and numerical results that contain some comparisons to the plain TRG, where significant differences are found, will be shown. The detailed discussion of this work is given in ref. [1].