Near-optimal Prediction Error Estimation for Quantum Machine Learning Models

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Chen, Qiuhao, Jiao, Yuling, Li, Yinan, Lu, Xiliang, Yang, Jerry Zhijian
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866917367494213632
author Chen, Qiuhao
Jiao, Yuling
Li, Yinan
Lu, Xiliang
Yang, Jerry Zhijian
author_facet Chen, Qiuhao
Jiao, Yuling
Li, Yinan
Lu, Xiliang
Yang, Jerry Zhijian
contents Understanding the theoretical capabilities and limitations of quantum machine learning (QML) models to solve machine learning tasks is crucial to advancing both quantum software and hardware developments. Similarly to the classical setting, the performance of QML models can be significantly affected by the limited access to the underlying data set. Previous studies have focused on proving generalization error bounds for any QML models trained on a limited finite training set. We focus on the optimal QML models obtained by training them on a finite training set and establish a tight prediction error bound in terms of the number of trainable gates and the size of training sets. To achieve this, we derive covering number upper bounds and packing number lower bounds for the data re-uploading QML models and linear QML models, respectively, which may be of independent interest. We support our theoretical findings by numerically simulating the QML strategies for function approximation and quantum phase recognition.
format Preprint
id arxiv_https___arxiv_org_abs_2510_18208
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Near-optimal Prediction Error Estimation for Quantum Machine Learning Models
Chen, Qiuhao
Jiao, Yuling
Li, Yinan
Lu, Xiliang
Yang, Jerry Zhijian
Quantum Physics
Understanding the theoretical capabilities and limitations of quantum machine learning (QML) models to solve machine learning tasks is crucial to advancing both quantum software and hardware developments. Similarly to the classical setting, the performance of QML models can be significantly affected by the limited access to the underlying data set. Previous studies have focused on proving generalization error bounds for any QML models trained on a limited finite training set. We focus on the optimal QML models obtained by training them on a finite training set and establish a tight prediction error bound in terms of the number of trainable gates and the size of training sets. To achieve this, we derive covering number upper bounds and packing number lower bounds for the data re-uploading QML models and linear QML models, respectively, which may be of independent interest. We support our theoretical findings by numerically simulating the QML strategies for function approximation and quantum phase recognition.
title Near-optimal Prediction Error Estimation for Quantum Machine Learning Models
topic Quantum Physics
url https://arxiv.org/abs/2510.18208