.png){kind=icon}
Return
Algorithms for tensor network contraction ordering
.png){kind=icon}
OA
AI
DOI：10.1088/2632-2153/ab94c5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Contracting tensor networks is often computationally demanding. Well-designed contraction sequences can dramatically reduce the contraction cost. We explore the performance of simulated annealing and genetic algorithms, two common discrete optimization techniques, to this ordering problem. We benchmark their performance as well as that of the commonly-used greedy search on physically relevant tensor networks. Where computationally feasible, we also compare them with the optimal contraction sequence obtained by an exhaustive search. Furthermore, we present a systematic comparison with state-of-the-art tree decomposition and graph partitioning algorithms in the context of random regular graph tensor networks. We find that the algorithms we consider consistently outperform a greedy search given equal computational resources, with an advantage that scales with tensor network size. We compare the obtained contraction sequences and identify signs of highly non-local optimization, with the more sophisticated algorithms sacrificing run-time early in the contraction for better overall performance.
Keywords:
Tensor networks
simulated annealing
genetic algorithms
Journal
M
IF:
4.6
Papers:
1.1K
Citations:
3.4K
Organization
Cited Papers
ShareSaveShareSaveRenormalization of tensor networks using graph-independent local truncations.png)
PHYSICAL REVIEW B
OAAI
PHYSICAL REVIEW BIF3.7
OAAIShareSaveShareSaveVaccination trials on gilthead seabream (Sparus aurata) against Pasteurella piscicidaAquaculture
AquacultureIF0
PREAI
ShareSaveAssociations between long-term ambient PM2·5 exposure and prevalence of chronic kidney disease in China: a national cross-sectional studyThe LancetOAAI
The LancetIF0
OAAIShareSave
View more