Hyperoptimized Approximate Contraction of Tensor Networks with Arbitrary Geometry

Authors:
Top Cited Papers
Open Access
Publisher website
Google Scholar
Abstract
Tensor network contraction is central to problems ranging from many-body physics to computer science. We describe how to approximate tensor network contraction through bond compression on arbitrary graphs. In particular, we introduce a hyperoptimization over the compression and contraction strategy itself to minimize error and cost. We demonstrate that our protocol outperforms both handcrafted contraction strategies in the literature as well as recently proposed general contraction algorithms on a variety of synthetic and physical problems on regular lattices and random regular graphs. We further showcase the power of the approach by demonstrating approximate contraction of tensor networks for frustrated three-dimensional lattice partition functions, dimer counting on random regular graphs, and to access the hardness transition of random tensor network models, in graphs with many thousands of tensors. Published by the American Physical Society 2024
Funding Information
  • National Science Foundation (1931328, 2102505)
  • Simons Foundation

This publication has 57 references indexed in Scilit: