Metraipolis › archive › dc_e2d9d647a017
Sample Complexity for Generative Learning of Quantum Measurement Data — arXiv:2610.38028
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.38028
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:49:54.074Z
- SHA-256 of the archived text
60d0b8790d31700b8838bcc9858acdc32649517967e477ce3783958927e56559- Stable URL of this page
https://metraipolis.com/documento/dc_e2d9d647a017
How to cite
Sample Complexity for Generative Learning of Quantum Measurement Data — arXiv:2610.38028 — arXiv (en), https://arxiv.org/abs/2610.38028 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e2d9d647a017 (Metraipolis archive dc_e2d9d647a017, sha256 60d0b8790d31700b8838bcc9858acdc32649517967e477ce3783958927e56559)
BibTeX
@misc{dce2d9d647a017,
title = {Sample Complexity for Generative Learning of Quantum Measurement Data — arXiv:2610.38028},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.38028},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e2d9d647a017; sha256 60d0b8790d31700b8838bcc9858acdc32649517967e477ce3783958927e56559},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38028. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Generative learning of a quantum measurement distribution from finite data requires choosing a model capacity that balances representation accuracy against estimation cost. We develop a bias-variance framework that decomposes the expected population Kullback-Leibler error at model capacity $s$ and sample size $N$ as $\mathcal E(s,N)=B(s)+V(s,N)$, with representation bias $B$ and a variance term $V$ capturing the mean estimation error. In the well-sampled regime, $V(s,N)\simeq[NC(s)]^{-1}$, and exponential or algebraic laws for $B$ and $C$ yield four scaling templates for the optimal error, from inverse powers of $N$ to inverse powers of $\ln N$. For local autoregressive models, the context radius sets the model capacity, and $B$ is the summed conditional mutual information lost by truncating the context. For a smoothed histogram learner, we derive an exact finite-sample estimation cost that accounts for rarely observed contexts and recovers the parameter-count law in the well-sampled regime. For transverse-field Ising Born distributions, the independently evaluated bias and estimation cost predict both the optimal context radius and the optimal error. In the well-sampled regime, the estimation cost grows exponentially with context radius. Its competition with approximately exponential bias decay in the gapped regimes predicts power-law error decay in $N$, while algebraic bias decay at criticality predicts asymptotic inverse-power decay in $\ln N$. Bulk-site results are consistent with the corresponding finite-sample predictions. These results connect the structure of quantum measurement distributions to the model capacity justified by finite data.
Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph) ; Statistical Mechanics (cond-mat.stat-mech).
Pagina del lavoro: https://arxiv.org/abs/2610.38028 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-01T02:19:43.435Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).