Sign inGet started
Paper · arXiv

Verifiable Sampling for Delegated Generative Quantum Machine Learning

Generative machine learning has shown remarkable results across a wide range of interdisciplinary tasks, motivating significant efforts toward Quantum Generative Models as a path to beyond-classical performance, given their capability of generating classically intractable distributions. However, comparatively little attention has been paid to securely delegating such computations to a powerful remote quantum server. In this work, we propose a blind and verifiable protocol for sampling that can be used for the inference phase of such quantum models. Such a protocol inherits blindness from Universal Blind Quantum Computing and achieves verifiability by exploiting known approaches based on t...

AuthorsMatteo Inajetovic, Anna Pappa, Petros Wallden
Primary categoryquant-ph
Published9 October 2026
Last updated at source9 October 2026
quant-phcs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/f7cd6148-9aed-44e3-8fcf-e0968e614029" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.