On the optimal linear contraction order of tree tensor networks, and beyond

DOI10.1137/23m161286xMaRDI QIDQ6623704

Mihail Stoian, Richard M. Milbradt, Christian B. Mendl

Publication date: 24 October 2024

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

zbMATH Keywords

einsumdynamic programmingoptimal algorithmtensor networkscontraction orderingdatabase join ordering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Numerical linear algebra (65Fxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The density-matrix renormalization group in the age of matrix product states
• Tensor Networks for Dimensionality Reduction and Large-scale Optimization: Part 1 Low-Rank Tensor Decompositions
• Tensor Spaces and Numerical Tensor Calculus
• Simulating Quantum Computation by Contracting Tensor Networks
• Sequencing with Series-Parallel Precedence Constraints
• k-way Hypergraph Partitioning via n-Level Recursive Bisection
• Parameterized Algorithms
• A relational model of data for large shared data banks
• Strassen's Algorithm for Tensor Contraction
• On the Theory of Dynamic Programming

This page was built for publication: On the optimal linear contraction order of tree tensor networks, and beyond