Metraipolis › archive › dc_fb37e34243c2

On Certifying Source Sampling Hardness in Quantum Generative Modeling — arXiv:2609.28802

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.28802
License (as archived)
CC0-1.0
Archived
2026-10-08T07:34:24.719Z
SHA-256 of the archived text
e7fd1037b5901f77082a6fb72b6c7ec0f32b253809643520ad6a722d30a93845
Stable URL of this page
https://metraipolis.com/documento/dc_fb37e34243c2

How to cite

On Certifying Source Sampling Hardness in Quantum Generative Modeling — arXiv:2609.28802 — arXiv (en), https://arxiv.org/abs/2609.28802 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fb37e34243c2 (Metraipolis archive dc_fb37e34243c2, sha256 e7fd1037b5901f77082a6fb72b6c7ec0f32b253809643520ad6a722d30a93845)
BibTeX
@misc{dcfb37e34243c2,
  title = {On Certifying Source Sampling Hardness in Quantum Generative Modeling — arXiv:2609.28802},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.28802},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fb37e34243c2; sha256 e7fd1037b5901f77082a6fb72b6c7ec0f32b253809643520ad6a722d30a93845},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.28802. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Quantum generative models are often motivated by circuit families whose output distributions are believed to be classically hard to sample from. When such models are trained on ordinary classical datasets, however, this hardness does not automatically transfer to the unknown data-generating distribution. We show that transferring sampling hardness via total-variation closeness from a quantum model to an unknown source requires certifying a global relation between the two distributions, thereby reducing the problem to distribution certification. Combining this reduction with existing certification lower bounds yields an exponential sample requirement for the high-entropy distributions relevant to many sampling-hardness proposals. Consequently, polynomially many samples cannot, in general, justify attributing sampling hardness to an unknown data-generating distribution. Moreover, even classically trivial distributions, such as the uniform distribution and product distributions, require exponentially many samples to certify in the absence of structural assumptions. Our results clarify the role of sampling hardness in quantum generative modeling and distinguish generator-level hardness from source-level hardness when learning from ordinary datasets.

Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-09-25 in quant-ph).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2609.28802 — 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-10-08T06:49:21.207Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).