A program-synthesis search over output-directed splits with precomputed-singular-value constraint solving finds near-optimal tree tensor networks up to 10x faster than prior structure-search tools.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CE 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Tensor Network Structure Search Via Canonical Dimension Tree Enumeration
A program-synthesis search over output-directed splits with precomputed-singular-value constraint solving finds near-optimal tree tensor networks up to 10x faster than prior structure-search tools.