arXiv (All)
open access
On the Approximation Complexity of Matrix Product Operator (MPO) Born Machines
Matrix product operator Born machines (MPO-BMs) are tractable tensor-network models for probabilistic modeling, yet their approximation capabilities remain poorly understood in theory. In this paper, we characterize these capabilities from both negative and positive perspectives. As a negative resul
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Does Mapping Non-Maximal Probabilities to GMM Components Matter for S-JEPA Encoder Representations?#467119
- Comparing magic state cultivation methods using matrix product states#1013322
- Algorithmic Relative Complexity#427022
- Learning to Optimize by Differentiable Programming#798738
- Learning to Optimize by Differentiable Programming#797324
Record · ID 1297128
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive