Towards a polynomial algorithm for optimal contraction sequence of tensor networks from trees
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...
Main Authors: | Xu, Jianyu, Liang, Ling, Deng, Lei, Wen, Changyun, Xie, Yuan, Li, Guoqi |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/141943 |
Similar Items
-
Tree-Based Mix-Order Polynomial Fusion Network for Multimodal Sentiment Analysis
by: Jiajia Tang, et al.
Published: (2023-01-01) -
Tensors in electrical engineering/
by: 183742 Lynn, John Williamson
Published: (1963) -
Machine learning by unitary tensor network of hierarchical tree structure
by: Ding Liu, et al.
Published: (2019-01-01) -
Taylor's theorem: a new perspective for neural tensor networks
by: Li, Wei, et al.
Published: (2022) -
Stack operation of tensor networks
by: Zhang, Tianning, et al.
Published: (2022)