A Tutorial on Quantum Amplitude Embedding with Data Re-Uploading
Abstract
Amplitude embedding lets a variational quantum model read many classical features with few qubits, but the model output is then only a quadratic form in the normalized input. Data re-uploading, which encodes the input repeatedly between trainable blocks, can be used to enrich such a model. Because every additional upload of an amplitude embedding repeats a costly state preparation, the gain that an upload buys has to be known before the gates are spent. This tutorial thus addresses the problem of explaining what data re-uploading adds to an amplitude-embedded model and how large the gain is. We express sequential re-uploading and parallel re-uploading with two copies in one notation and show that each upload raises the reachable polynomial order by two. Under one trainable circuit family and one budget of trainable parameters, simulation results show that re-uploading raises the test coefficient of determination from 0.689 to between 0.883 and 0.975 on targets of order four and from 0.337 to between 0.642 and 0.783 on targets of order six, on all ten seeds. On a quadratic target and on handwritten digits, one upload remains the best choice, and every additional upload lowers the gate error that the classifier tolerates. These results help designers match the number of uploads to the polynomial order of the task at hand.
Related
- Re-uploading quantum data: a universal function approximator for quantum inputs
- A tutorial on quantum scattering theory and coupled-channel calculations of bimolecular collisions
- Measurement-Based Feedback of Open Quantum Systems: A Control-Theoretic Review and Tutorial
- Quantum synchronization: A tutorial guide
- Improving student understanding via interactive learning tutorial on quantum key distribution using entanglement
BibTeX
@misc{ahn2026tutorial,
title = {{A Tutorial on Quantum Amplitude Embedding with Data Re-Uploading}},
author = {Hyojun Ahn and Joongheon Kim},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.17836},
eprint = {2610.17836},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.17836},
}
RIS
TY - UNPB
TI - A Tutorial on Quantum Amplitude Embedding with Data Re-Uploading
AU - Hyojun Ahn
AU - Joongheon Kim
PY - 2026
DA - 2026/10/13
PB - arXiv
DO - 10.48550/arxiv.2610.17836
UR - https://arxiv.org/abs/2610.17836
AB - Amplitude embedding lets a variational quantum model read many classical features with few qubits, but the model output is then only a quadratic form in the normalized input. Data re-uploading, which encodes the input repeatedly between trainable blocks, can be used to enrich such a model. Because every additional upload of an amplitude embedding repeats a costly state preparation, the gain that an upload buys has to be known before the gates are spent. This tutorial thus addresses the problem of explaining what data re-uploading adds to an amplitude-embedded model and how large the gain is. We express sequential re-uploading and parallel re-uploading with two copies in one notation and show that each upload raises the reachable polynomial order by two. Under one trainable circuit family and one budget of trainable parameters, simulation results show that re-uploading raises the test coefficient of determination from 0.689 to between 0.883 and 0.975 on targets of order four and from 0.337 to between 0.642 and 0.783 on targets of order six, on all ten seeds. On a quadratic target and on handwritten digits, one upload remains the best choice, and every additional upload lowers the gate error that the classifier tolerates. These results help designers match the number of uploads to the polynomial order of the task at hand.
ER -