On the Approximation Complexity of Matrix Product Operator Born Machines
arXiv:2605.11471v1 Announce Type: new
Abstract: Matrix product operator Born machines (MPO-BMs) are tractable tensor-network models for probabilistic modeling, but their efficient approximation capability remains unclear. We characterize this boundary…