Universality and kernel-adaptive training for classically trained, quantum-deployed generative models
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918157616152576 |
|---|---|
| author | Kurkin, Andrii Shen, Kevin Pielawa, Susanne Wang, Hao Dunjko, Vedran |
| author_facet | Kurkin, Andrii Shen, Kevin Pielawa, Susanne Wang, Hao Dunjko, Vedran |
| contents | The instantaneous quantum polynomial (IQP) quantum circuit Born machine (QCBM) has been proposed as a promising quantum generative model over bitstrings. Recent works have shown that the training of IQP-QCBM is classically tractable w.r.t. the so-called Gaussian kernel maximum mean discrepancy (MMD) loss function, while maintaining the potential of a quantum advantage for sampling itself. Nonetheless, the model has a number of aspects where improvements would be important for more general utility: (1) the basic model is known to be not universal - i.e. it is not capable of representing arbitrary distributions, and it was not known whether it is possible to achieve universality by adding hidden (ancillary) qubits; (2) a fixed Gaussian kernel used in the MMD loss can cause training issues, e.g., vanishing gradients. In this paper, we resolve the first question and make decisive strides on the second. We prove that for an $n$-qubit IQP generator, adding $n + 1$ hidden qubits makes the model universal. For the latter, we propose a kernel-adaptive training method, where the kernel is adversarially trained. We show that in the kernel-adaptive method, the convergence of the MMD value implies weak convergence in distribution of the generator. We also analytically analyze the limitations of the MMD-based training method. Finally, we verify the performance benefits on the dataset crafted to spotlight improvements by the suggested method. The results show that kernel-adaptive training outperforms a fixed Gaussian kernel in total variation distance, and the gap increases with the dataset dimensionality. These modifications and analyses shed light on the limits and potential of these new quantum generative methods, which could offer the first truly scalable insights in the comparative capacities of classical versus quantum models, even without access to scalable quantum computers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_08476 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Universality and kernel-adaptive training for classically trained, quantum-deployed generative models Kurkin, Andrii Shen, Kevin Pielawa, Susanne Wang, Hao Dunjko, Vedran Quantum Physics The instantaneous quantum polynomial (IQP) quantum circuit Born machine (QCBM) has been proposed as a promising quantum generative model over bitstrings. Recent works have shown that the training of IQP-QCBM is classically tractable w.r.t. the so-called Gaussian kernel maximum mean discrepancy (MMD) loss function, while maintaining the potential of a quantum advantage for sampling itself. Nonetheless, the model has a number of aspects where improvements would be important for more general utility: (1) the basic model is known to be not universal - i.e. it is not capable of representing arbitrary distributions, and it was not known whether it is possible to achieve universality by adding hidden (ancillary) qubits; (2) a fixed Gaussian kernel used in the MMD loss can cause training issues, e.g., vanishing gradients. In this paper, we resolve the first question and make decisive strides on the second. We prove that for an $n$-qubit IQP generator, adding $n + 1$ hidden qubits makes the model universal. For the latter, we propose a kernel-adaptive training method, where the kernel is adversarially trained. We show that in the kernel-adaptive method, the convergence of the MMD value implies weak convergence in distribution of the generator. We also analytically analyze the limitations of the MMD-based training method. Finally, we verify the performance benefits on the dataset crafted to spotlight improvements by the suggested method. The results show that kernel-adaptive training outperforms a fixed Gaussian kernel in total variation distance, and the gap increases with the dataset dimensionality. These modifications and analyses shed light on the limits and potential of these new quantum generative methods, which could offer the first truly scalable insights in the comparative capacities of classical versus quantum models, even without access to scalable quantum computers. |
| title | Universality and kernel-adaptive training for classically trained, quantum-deployed generative models |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2510.08476 |