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:2507.21909 · Physical review. D/Physical review. D.

Triad representation for the anisotropic tensor renormalization group in four dimensions

Yoshiyuki Sugimoto, Shoichi Sasaki

Published Nov 25, 2025• 4 citations
arXivHTMLPDF

Abstract

The development of tensor renormalization group (TRG) algorithm in higher dimensions is an important and urgent task, as the TRG is expected to provide a way to overcome the sign problem in lattice quantum chromodynamics (QCD) calculations at finite density. One possible approach that enables faster computations in four-dimensional lattice theories is the anisotropic tensor renormalization group (ATRG). However, the computational cost remains substantial and requires significant computational resources. In this paper, we propose a novel algorithm, called the triad-ATRG, which is based on the ATRG and other improved TRG variants with triad network representation. This method achieves lower scaling with respect to the bond dimension, while minimizing the loss of accuracy in the free energy and other physical quantities. We also present parallel implementations of both the ATRG and triad-ATRG on multiple GPUs, which significantly improve performance compared to CPU-based calculations for the four-dimensional system.

DOI
10.1103/c3qc-tn48

Related papers

Applying the Triad network representation to four-dimensional ATRG method

Yuto Sugimoto, Shoichi Sasaki

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 cost. Adopting the methods of the minimally decomposed TRG and its triad prescriptions, we construct a triad representation of the four- dimensional ATRG by decomposing the unit-cell tensor. We observe that this combining approach can significantly improve the computational cost even with maintaining the convergence accuracy of the free energy in the four-dimensional Ising model. In addition, we also show that a further improvement can be achieved in terms of the computational cost when our proposed approach is implemented in parallel on GPUs.

arXiv:2412.14104•International Symposium on Lattice Field Theory (LATTICE)•Jan 6, 2025•1 citation

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•93 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

Triad second renormalization group

Daisuke Kadoh, Hideaki Oba, Shinji Takeda

Abstract 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 $$ \mathcal{O} $$ O (χ5) employing the randomized SVD where χ is the bond dimension of tensors. We test this method in the classical Ising model on the two dimensional square lattice, and find that numerical results are obtained in good accuracy for a fixed computational time.

arXiv:2107.08769•Journal of High Energy Physics•Apr 21, 2022•16 citations

Phase transition of four-dimensional Ising model with tensor network scheme

Shinichiro Akiyama, Y. Kuramashi, Takumi Yamashita +1 more

We investigate the phase transition of the four-dimensional Ising model with two types of tensor network scheme, one is the higher-order tensor renormalization group and the other is the anisotropic tensor renormalization group. The results for the internal energy and magnetization obtained by the former algorithm with the impure tensor method, enlarging the lattice volume up to $1024^4$, are consistent with the weak first-order phase transition. For the later algorithm, our implementation successfully reduces the execution time thanks to the parallel computation and the results provided by ATRG seems comparable to those with HOTRG.

arXiv:1911.12954•International Symposium on Lattice Field Theory (LATTICE)•Jan 4, 2020•11 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
The development of tensor renormalization group (TRG) algorithm in higher dimensions is an important and urgent task, as the TRG is expected to provide a way to overcome the sign problem in lattice quantum chromodynamics (QCD) calculations at finite density. One possible approach that enables faster computations in four-dimensional lattice theories is the anisotropic tensor renormalization group (ATRG). However, the computational cost remains substantial and requires significant computational resources. In this paper, we propose a novel algorithm, called the triad-ATRG, which is based on the ATRG and other improved TRG variants with triad network representation. This method achieves lower scaling with respect to the bond dimension, while minimizing the loss of accuracy in the free energy and other physical quantities. We also present parallel implementations of both the ATRG and triad-ATRG on multiple GPUs, which significantly improve performance compared to CPU-based calculations for the four-dimensional system.
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 cost. Adopting the methods of the minimally decomposed TRG and its triad prescriptions, we construct a triad representation of the four- dimensional ATRG by decomposing the unit-cell tensor. We observe that this combining approach can significantly improve the computational cost even with maintaining the convergence accuracy of the free energy in the four-dimensional Ising model. In addition, we also show that a further improvement can be achieved in terms of the computational cost when our proposed approach is implemented in parallel on GPUs.
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.
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.
Abstract 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 O \mathcal{O} O O (χ5) employing the randomized SVD where χ is the bond dimension of tensors. We test this method in the classical Ising model on the two dimensional square lattice, and find that numerical results are obtained in good accuracy for a fixed computational time.
We investigate the phase transition of the four-dimensional Ising model with two types of tensor network scheme, one is the higher-order tensor renormalization group and the other is the anisotropic tensor renormalization group. The results for the internal energy and magnetization obtained by the former algorithm with the impure tensor method, enlarging the lattice volume up to 102441024^410244, are consistent with the weak first-order phase transition. For the later algorithm, our implementation successfully reduces the execution time thanks to the parallel computation and the results provided by ATRG seems comparable to those with HOTRG.
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.