The interplay of robustness and generalization in quantum machine learning
Not on the map. Why?
Abstract (arXiv)
While adversarial robustness and generalization have individually received substantial attention in the recent literature on quantum machine learning, their interplay is much less explored. In this chapter, we address this interplay for variational quantum models, which were recently proposed as function approximators in supervised learning. We discuss recent results quantifying both robustness and generalization via Lipschitz bounds, which explicitly depend on model parameters. Thus, they give rise to a regularization-based training approach for robust and generalizable quantum models, highlighting the importance of trainable data encoding strategies. The practical implications of the theoretical results are demonstrated with an application to time series analysis.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 32 of its 54 references that are in the map. First posted on arXiv 10 Jun 2025.
Builds on
32 of 54 references.
References · 32
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2013Intriguing properties of neural networkscited by 5,155
- 2020Variational Quantum Algorithmscited by 692
- 2018Supervised learning with quantum enhanced feature spacescited by 665
- 2017Provable defenses against adversarial examples via the convex outer adversarial polytopecited by 567
- 2020The power of quantum neural networkscited by 379
- 2020Power of data in quantum machine learningcited by 338
- 2019Efficient and Accurate Estimation of Lipschitz Constants for Deep Neural Networkscited by 293
- 2023Challenges and Opportunities in Quantum Machine Learningcited by 203
- 2018Lipschitz-Margin Training: Scalable Certification of Perturbation Invariance for Deep Neural Networkscited by 195
- 2020Training robust neural networks using Lipschitz boundscited by 99
20 more
- 2021Encoding-dependent generalization bounds for parametrized quantum circuitscited by 82
- 2020Quantum noise protects quantum classifiers against adversariescited by 68
- 2019Quantum Adversarial Machine Learningcited by 67
- 2019Stochastic gradient descent for hybrid quantum-classical optimizationcited by 59
- 2022Out-of-distribution generalization for learning quantum dynamicscited by 49
- 2023Understanding quantum machine learning also requires rethinking generalizationcited by 49
- 2023Shadows of quantum machine learningcited by 31
- 2022Benchmarking Adversarially Robust Quantum Machine Learning at Scalecited by 29
- 2023Towards quantum enhanced adversarial robustness in machine learningcited by 28
- 2020Optimal Provable Robustness of Quantum Classification via Quantum Hypothesis Testingcited by 25
- 2021Universal Adversarial Examples and Perturbations for Quantum Classifierscited by 23
- 2023Let Quantum Neural Networks Choose Their Own Frequenciescited by 22
- 2023Training robust and generalizable quantum modelscited by 21
- 2020Robustness Verification of Quantum Classifierscited by 18
- 2024A Comparative Analysis of Adversarial Robustness for Quantum and Classical Machine Learning Modelscited by 12
- 2025Double descent in quantum kernel methodscited by 9
- 2023Robustness of quantum algorithms against coherent control errorscited by 4
- 2024Robustness and Generalization in Quantum Reinforcement Learning via Lipschitz Regularizationcited by 4
- 2024Adversarial Quantum Machine Learning: An Information-Theoretic Generalization Analysiscited by 3
- 2025On the Generalization of Adversarially Trained Quantum Classifierscited by 1
Built on by
Not cited yet.