Abstract
Higher-order tensor renormalization group (HOTRG) is a coarse-graining algorithm for approximating the partition function in the field of elementary particle physics using a tensor network. Coarse-graining in HOTRG comprises an approximation step and a contraction step, and the contraction step is performed with tensor reorderings and matrix products. In this paper, we introduce a naive parallel implementation of HOTRG and propose optimal reordering procedures for a three-dimensional (3D) classical cubic lattice Ising model. Numerical experiments on the K computer show that the elapsed time of the proposed procedure is 6.88 times faster than the naive one for the reorderings.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
