Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 41 min ago
PreprintCC BY 4.0arXiv

Distilling Datasets into Shallow Circuits for Quantum Machine Learning

Abstract

In quantum machine learning, training a quantum model requires each sample to be prepared as a quantum state by a loading circuit that must be re-executed for every shot at every training step. The total burden therefore scales with both the number of samples and the cost of preparation. Existing approaches reduce the loading cost of individual inputs or distill data and compress their representations before applying a separate quantum encoding. This separation can leave resulting samples costly to prepare or cause additional loss of the information during subsequent compilation into shallow circuits. We propose quantum dataset distillation (QDD), which distills the full dataset directly into a small set of shallow circuits. Each synthetic sample is parameterized as a staircase circuit corresponding to a low-rank tensor network, making the sample and its loading circuit the same object. The circuit parameters are optimized classically with exact gradients using distribution matching under an explicit loading budget, without post-hoc state-preparation synthesis. On MNIST and Fashion-MNIST, only 10 circuits per class (0.0017× the full dataset size) achieve accuracy comparable to full-data training and outperform selection baselines under matched sample and loading budgets. In finite-shot training, QDD reaches 95\% of the full-data accuracy with more than 100× fewer cumulative shots. Additionally, we validate QDD on real quantum hardware, demonstrating its practical deployment potential.

Related

  1. Polynomial-time additive-error estimation of output probabilities for shallow quantum circuits
    Matthew Coudron, Michael J. Gullans, Jon Nelson +2
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  2. Classical Pre-Training of Large Shallow Parametrized Quantum Circuits through Pauli Propagation and deployment on Quantum Hardware
    Saverio Monaco, Jamal Slim, Ran Xue +2
    arXivPreprintCC BY 4.0Full textQuantum physics & quantum informationarXiv
  3. Experimentally Testable Quantum Advantage in Shallow Circuits
    Kishor Bharti, Adán Cabello
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
  4. Shadow Quantum Singular Value Transformation with Shallow Quantum Circuits
    Nai-Hui Chia, Hyunseong Kim, Chia-Ying Lin +1
    arXivPreprintCC BY-NC-ND 4.0Full textQuantum physics & quantum informationarXiv
  5. Parallel classical simulation of noisy shallow circuits: no quantum advantage in 1D
    Robert Koenig, Marco Tomamichel
    arXivPreprintarXiv licenceFull textQuantum physics & quantum informationarXiv
BibTeX
@misc{lin2026distilling,
  title = {{Distilling Datasets into Shallow Circuits for Quantum Machine Learning}},
  author = {Guang Lin and Qibin Zhao},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.28229},
  eprint = {2609.28229},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.28229},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Distilling Datasets into Shallow Circuits for Quantum Machine Learning
AU  - Guang Lin
AU  - Qibin Zhao
PY  - 2026
DA  - 2026/09/23
PB  - arXiv
DO  - 10.48550/arxiv.2609.28229
UR  - https://arxiv.org/abs/2609.28229
AB  - In quantum machine learning, training a quantum model requires each sample to be prepared as a quantum state by a loading circuit that must be re-executed for every shot at every training step. The total burden therefore scales with both the number of samples and the cost of preparation. Existing approaches reduce the loading cost of individual inputs or distill data and compress their representations before applying a separate quantum encoding. This separation can leave resulting samples costly to prepare or cause additional loss of the information during subsequent compilation into shallow circuits. We propose quantum dataset distillation (QDD), which distills the full dataset directly into a small set of shallow circuits. Each synthetic sample is parameterized as a staircase circuit corresponding to a low-rank tensor network, making the sample and its loading circuit the same object. The circuit parameters are optimized classically with exact gradients using distribution matching under an explicit loading budget, without post-hoc state-preparation synthesis. On MNIST and Fashion-MNIST, only 10 circuits per class (0.0017× the full dataset size) achieve accuracy comparable to full-data training and outperform selection baselines under matched sample and loading budgets. In finite-shot training, QDD reaches 95\% of the full-data accuracy with more than 100× fewer cumulative shots. Additionally, we validate QDD on real quantum hardware, demonstrating its practical deployment potential.
ER  -