Training robust and generalizable quantum models

Adversarial robustness and generalization are both crucial properties of reliable machine learning models. In this paper, we study these properties in the context of quantum machine learning based on Lipschitz bounds. We derive parameter-dependent Lipschitz bounds for quantum models with trainable encoding, showing that the norm of the data encoding has a crucial impact on the robustness against data perturbations. Further, we derive a bound on the generalization error which explicitly involves the parameters of the data encoding. Based on these theoretical results, we propose a practical strategy for training robust and generalizable quantum models by regularizing the Lipschitz bound in the cost. Moreover, we show that, for fixed and nontrainable encodings, as those frequently employed in quantum machine learning, the Lipschitz bound cannot be influenced by tuning the parameters. Thus trainable encodings are crucial for systematically adapting robustness and generalization during training. The practical implications of our theoretical findings are illustrated with numerical results. Published by the American Physical Society 2024

Authors

Institutions

Publication Details

Journal
Physical Review Research
Published
2024-12-27
DOI
https://doi.org/10.1103/physrevresearch.6.043326
Citations
10
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
3.47

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Training robust and generalizable quantum models

Christian Tutschku, Christian Holm, Julian Berberich, Daniel Pranjić et al.
10 citations
Physical Review Research
Quantum Computing Algorithms and Architecture
3.47
article

Training robust and generalizable quantum models

Christian Tutschku, Christian Holm, Julian Berberich, Daniel Pranjić, Daniel Fink
article en
10 citations

Abstract

Adversarial robustness and generalization are both crucial properties of reliable machine learning models. In this paper, we study these properties in the context of quantum machine learning based on Lipschitz bounds. We derive parameter-dependent Lipschitz bounds for quantum models with trainable encoding, showing that the norm of the data encoding has a crucial impact on the robustness against data perturbations. Further, we derive a bound on the generalization error which explicitly involves the parameters of the data encoding. Based on these theoretical results, we propose a practical strategy for training robust and generalizable quantum models by regularizing the Lipschitz bound in the cost. Moreover, we show that, for fixed and nontrainable encodings, as those frequently employed in quantum machine learning, the Lipschitz bound cannot be influenced by tuning the parameters. Thus trainable encodings are crucial for systematically adapting robustness and generalization during training. The practical implications of our theoretical findings are illustrated with numerical results. Published by the American Physical Society 2024

Physical Review ResearchVol. 6(4)
University of Stuttgart (DE), Fraunhofer Institute for Industrial Engineering (DE)
Deutsche Forschungsgemeinschaft, Singapore Institute of Manufacturing Technology, Stuttgart Center for Simulation Science, Universität Stuttgart
Openalex Percentile: Top 6%
Quantum Computing Algorithms and Architecture
3.47
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Training robust and generalizable quantum models — Christian Tutschku, Christian Holm, et al. · Physical Review Research (2024) | TGRS Research Map | TGRS