Towards a polynomial algorithm for optimal contraction sequence of tensor networks from trees

• Main Authors: Xu, Jianyu, Liang, Ling, Deng, Lei, Wen, Changyun, Xie, Yuan, Li, Guoqi
• 其他作者: School of Electrical and Electronic Engineering
• 格式: Article
• 語言: English
• 出版: 2020
• 主題: Engineering::Electrical and electronic engineering; Network Optimization; Tensor Network Methods
• 在線閱讀: https://hdl.handle.net/10356/141943
• 機構: Nanyang Technological University

The computational cost of contracting a tensor network depends on the sequence of contractions, but to decide the sequence of contractions with a minimal computational cost on an arbitrary network has been proved to be an NP-complete problem. In this work, we conjecture that the problem may be a pol...