MPO-BMs have NP-hard KL approximation in continuous settings but admit efficient polynomial-bond-dimension approximations with provable KL guarantees for structured targets under locality and spectral-gap conditions.
Physical Review X , volume=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A guide presenting tensor algebra operations, decompositions, and gradients through tensor network diagrams for broader accessibility beyond quantum physics.
citing papers explorer
-
On the Approximation Complexity of Matrix Product Operator Born Machines
MPO-BMs have NP-hard KL approximation in continuous settings but admit efficient polynomial-bond-dimension approximations with provable KL guarantees for structured targets under locality and spectral-gap conditions.
-
Tensor Cookbook: Mastering Tensors through Diagrams
A guide presenting tensor algebra operations, decompositions, and gradients through tensor network diagrams for broader accessibility beyond quantum physics.