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:2509.02185 · Journal of High Energy Physics

Tensor renormalization group approach to entanglement entropy

Takahiro Hayazaki, Daisuke Kadoh, Shinji Takeda, Gota Tanaka

Published Mar 2, 2026• 0 citations
arXivHTMLPDF

Abstract

A bstract We propose a method to compute the entanglement entropy (EE) using the tensor renormalization group (TRG) method. The reduced density matrix of a d -dimensional quantum system is represented as a ( d + 1)-dimensional tensor network. We develop an explicit algorithm for d = 1 that enables the calculation of EE for single-interval subsystems of arbitrary size. We test our method in two-dimensional tensor network of the Ising model. The central charge is obtained as c = 0 . 49997(8) for D = 96, which agrees with the theoretical prediction within an error, demonstrating the accuracy and reliability of our proposed method.

DOI
10.1007/jhep03(2026)002

Related papers

Entanglement entropy by tensor renormalization group approach

Gota Tanaka, Takahiro Hayazaki, Daisuke Kadoh +1 more

We report on tensor renormalization group calculations of entanglement entropy in one-dimensional quantum systems. The reduced density matrix of a Gibbs state can be represented as a $1 + 1$-dimensional tensor network, which is analogous to the tensor network representation of the partition function. The HOTRG method is used to approximate the reduced density matrix for arbitrary subsystem sizes, from which we obtain the entanglement entropy. We test our method in the quantum Ising model and obtain the entanglement entropy of the ground state by taking the size of time direction to infinity. The central charge $c$ is obtained as $c = 0.49997(8)$ for a bond dimension $D_\text{cut}=96$, which agrees with the theoretical value $c=1/2$ within the error.

arXiv:2502.02030•International Symposium on Lattice Field Theory (LATTICE)•Feb 5, 2025•0 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

Entanglement-based tensor-network strong-disorder renormalization group

Kouichi Seki, Toshiya Hikihara, Kouichi Okunishi

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 utilize the entanglement structure associated with the blocks to be renormalized. We examine accuracy of the algorithm for the random antiferromagnetic Heisenberg models on one-dimensional, triangular, and square lattices. We then find that the entanglement-based tSDRG achieves better accuracy than the previous one for the square-lattice model with weak randomness, while it is less efficient for the one-dimensional and triangular-lattice models particularly in the strong-randomness region. The theoretical background and possible improvements of the algorithm are also discussed.

arXiv:2107.01555•Physical review. B./Physical review. B•Oct 8, 2021•7 citations

Geometric Calculation of Entanglement Entropy via AdS/CFT(New Development of Numerical Simulations in Low-Dimensional Quantum Systems: From Density Matrix Renormalization Group to Tensor Network Formulations)

Tadashi Takayanagi

この論文は国立情報学研究所の電子図書館事業により電子化されました。

物性研究•Mar 5, 2011•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

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
A bstract We propose a method to compute the entanglement entropy (EE) using the tensor renormalization group (TRG) method. The reduced density matrix of a d -dimensional quantum system is represented as a ( d + 1)-dimensional tensor network. We develop an explicit algorithm for d = 1 that enables the calculation of EE for single-interval subsystems of arbitrary size. We test our method in two-dimensional tensor network of the Ising model. The central charge is obtained as c = 0 . 49997(8) for D = 96, which agrees with the theoretical prediction within an error, demonstrating the accuracy and reliability of our proposed method.
We report on tensor renormalization group calculations of entanglement entropy in one-dimensional quantum systems. The reduced density matrix of a Gibbs state can be represented as a 1+11 + 11+1-dimensional tensor network, which is analogous to the tensor network representation of the partition function. The HOTRG method is used to approximate the reduced density matrix for arbitrary subsystem sizes, from which we obtain the entanglement entropy. We test our method in the quantum Ising model and obtain the entanglement entropy of the ground state by taking the size of time direction to infinity. The central charge ccc is obtained as c=0.49997(8)c = 0.49997(8)c=0.49997(8) for a bond dimension Dcut=96D_\text{cut}=96Dcut​=96, which agrees with the theoretical value c=1/2c=1/2c=1/2 within the error.
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.
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 utilize the entanglement structure associated with the blocks to be renormalized. We examine accuracy of the algorithm for the random antiferromagnetic Heisenberg models on one-dimensional, triangular, and square lattices. We then find that the entanglement-based tSDRG achieves better accuracy than the previous one for the square-lattice model with weak randomness, while it is less efficient for the one-dimensional and triangular-lattice models particularly in the strong-randomness region. The theoretical background and possible improvements of the algorithm are also discussed.
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 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