A Parallel Computing Method for the Higher Order Tensor Renormalization Group
Takumi Yamashita, Tetsuya Sakurai

TL;DR
This paper introduces a parallel computing approach for the Higher Order Tensor Renormalization Group that reduces computational cost and memory requirements by distributing tensor elements across processes, avoiding communication bottlenecks.
Contribution
A novel parallelization method for HOTRG that distributes tensor elements to minimize communication and optimize computational efficiency in high-dimensional lattice models.
Findings
Reduces computational cost to O(χ^{4d-3}) per process for d ≥ 3.
Maintains memory requirement at O(χ^{2d-1}) per process.
Effectively avoids inter-process communication during tensor contraction.
Abstract
In this paper, we propose a parallel computing method for the Higher Order Tensor Renormalization Group (HOTRG) applied to a -dimensional simple lattice model. Sequential computation of the HOTRG requires computational cost, where is bond dimension, in a step to contract indices of tensors. When we simply distribute elements of a local tensor to each process in parallel computing of the HOTRG, frequent communication between processes occurs. The simplest way to avoid such communication is to hold all the tensor elements in each process, however, it requires memory space. In the presented method, placement of a local tensor element to more than one process is accepted and sufficient local tensor elements are distributed to each process to avoid communication between processes during considering computation step. For the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
