Adversarial Quantum Machine Learning: An Information-Theoretic Generalization Analysis
Petros Georgiou, Sharu Theresa Jose, Osvaldo Simeone

TL;DR
This paper provides an information-theoretic analysis of the generalization bounds for adversarially trained quantum classifiers, highlighting how mutual information and perturbation size influence robustness and error.
Contribution
It derives novel upper bounds on quantum classifier generalization error under adversarial attacks using information theory, extending to different attack parameters.
Findings
Upper bounds depend on mutual information and perturbation size
Bounds decrease with increasing training set size
Numerical validation supports theoretical results
Abstract
In a manner analogous to their classical counterparts, quantum classifiers are vulnerable to adversarial attacks that perturb their inputs. A promising countermeasure is to train the quantum classifier by adopting an attack-aware, or adversarial, loss function. This paper studies the generalization properties of quantum classifiers that are adversarially trained against bounded-norm white-box attacks. Specifically, a quantum adversary maximizes the classifier's loss by transforming an input state into a state that is -close to the original state in -Schatten distance. Under suitable assumptions on the quantum embedding , we derive novel information-theoretic upper bounds on the generalization error of adversarially trained quantum classifiers for and . The derived upper bounds consist of two terms: the first is an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Mechanics and Entropy
MethodsSparse Evolutionary Training
