Pré-Publication, Document De Travail Année : 2025

Quantum Reservoir Computing and Risk Bounds

Joseph Mikael
  • Fonction : Auteur
  • PersonId : 1259792

Résumé

We propose a way to bound the generalisation errors of several classes of quantum reservoirs using the Rademacher complexity. We give specific, parameter-dependent bounds for two particular quantum reservoir classes. We analyse how the generalisation bounds scale with growing numbers of qubits. Applying our results to classes with polynomial readout functions, we find that the risk bounds converge in the number of training samples. The explicit dependence on the quantum reservoir and readout parameters in our bounds can be used to control the generalisation error to a certain extent. It should be noted that the bounds scale exponentially with the number of qubits n. The upper bounds on the Rademacher complexity can be applied to other reservoir classes that fulfill a few hypotheses on the quantum dynamics and the readout function.

Fichier principal
Vignette du fichier
quantum_reservoir_computing_and_risk_bounds.pdf (627.03 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
licence

Dates et versions

hal-04884902 , version 1 (14-01-2025)

Licence

Identifiants

  • HAL Id : hal-04884902 , version 1

Citer

Naomi Mona Chmielewski, Nina Amini, Joseph Mikael. Quantum Reservoir Computing and Risk Bounds. 2025. ⟨hal-04884902⟩
0 Consultations
0 Téléchargements

Partager

More