"Train classical, deploy quantum" requires rethinking generalization
Abstract
Generative models have become central across science and industry, from image and text synthesis to the design of molecules and materials. Quantum generative models are considered one of the most promising applications for quantum computers, since a quantum circuit naturally produces samples from the distribution it encodes, and for suitable circuits that distribution is believed to be hard for any classical computer to reproduce. A leading strategy trains these models on a classical computer and reserves the quantum device for generating samples at deployment. This is possible when the training loss can be evaluated on a classical computer. A prime example is the maximum mean discrepancy (MMD2), a moment-matching loss that compares the model and the data through their Pauli-Z correlations. Research so far has asked whether such models can be trained and whether their sampling is hard; whether minimizing such an objective yields a model that \emph{generalizes}, rather than one that merely reproduces the training statistics, remains poorly understood. We benchmark thirteen quantum and classical generative models by direct sampling on two application-inspired datasets: first a cardinality-constrained dataset at up to $30$ qubits and second a dataset of genomic single-nucleotide variants, whose valid set is the observed data. Models that converge the loss to the same value differ widely in how much of the unseen valid set they cover. These results indicate that a converged moment-matching loss is not a reliable measure of generalization, and that a train-classical, deploy-quantum workflow has to measure generalization by sampling the trained model, a step that at the sizes of interest is believed to require the quantum device.
Related
- Margin-Based Generalization for Quantum Machine Learning with Classical Data Encoding
- Quantum Query Advantage Requires Space
- Rethinking free-space orbital angular momentum quantum key distribution: encoding selection and branch-cut-length-minimized adaptive optics
- Beyond Pure Dephasing: Quantum Error Correction in Single Molecules Requires Multiple Spins
- Parallel Quantum Advantage with Limited Adaptivity Requires Structure
BibTeX
@misc{raj2026train,
title = {{"Train classical, deploy quantum" requires rethinking generalization}},
author = {Snehal Raj and Natansh Mathur and Alejandro Perdomo-Ortiz},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2608.31117},
eprint = {2608.31117},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2608.31117},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - "Train classical, deploy quantum" requires rethinking generalization
AU - Snehal Raj
AU - Natansh Mathur
AU - Alejandro Perdomo-Ortiz
PY - 2026
DA - 2026/10/05
PB - arXiv
DO - 10.48550/arxiv.2608.31117
UR - https://arxiv.org/abs/2608.31117
AB - Generative models have become central across science and industry, from image and text synthesis to the design of molecules and materials. Quantum generative models are considered one of the most promising applications for quantum computers, since a quantum circuit naturally produces samples from the distribution it encodes, and for suitable circuits that distribution is believed to be hard for any classical computer to reproduce. A leading strategy trains these models on a classical computer and reserves the quantum device for generating samples at deployment. This is possible when the training loss can be evaluated on a classical computer. A prime example is the maximum mean discrepancy (MMD^2), a moment-matching loss that compares the model and the data through their Pauli-Z correlations. Research so far has asked whether such models can be trained and whether their sampling is hard; whether minimizing such an objective yields a model that \emph{generalizes}, rather than one that merely reproduces the training statistics, remains poorly understood. We benchmark thirteen quantum and classical generative models by direct sampling on two application-inspired datasets: first a cardinality-constrained dataset at up to $30$ qubits and second a dataset of genomic single-nucleotide variants, whose valid set is the observed data. Models that converge the loss to the same value differ widely in how much of the unseen valid set they cover. These results indicate that a converged moment-matching loss is not a reliable measure of generalization, and that a train-classical, deploy-quantum workflow has to measure generalization by sampling the trained model, a step that at the sizes of interest is believed to require the quantum device.
ER -