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

• المؤلفون الرئيسيون: Xu, Jianyu, Liang, Ling, Deng, Lei, Wen, Changyun, Xie, Yuan, Li, Guoqi
• مؤلفون آخرون: School of Electrical and Electronic Engineering
• التنسيق: مقال
• اللغة: 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...