Papers
Topics
Authors
Recent
2000 character limit reached

Renormalization group on a triad network

Published 5 Dec 2019 in hep-lat, cond-mat.stat-mech, and hep-th | (1912.02414v1)

Abstract: We propose a new renormalization scheme of tensor networks made only of third order tensors. The isometry used for coarse-graining the network can be prepared at an $O(D6)$ computational cost in any $d$ dimension ($d \ge 2$), where $D$ is the truncated bond dimension of tensors. Although it is reduced to $O(D5)$ if a randomized singular value decomposition is employed, the total cost is $O(D{d+3})$ because the contraction part for creating a renormalized tensor with isometries has $D{d+3}$ multiplications. We test our method in three dimensional Ising model and find that the numerical results are obtained for large $D$s with reasonable errors.

Citations (50)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.