The interplay of robustness and generalization in quantum machine learning

• URL: http://arxiv.org/abs/2506.08455v1
• Date: Tue, 10 Jun 2025 05:20:08 GMT
• Title: The interplay of robustness and generalization in quantum machine learning
• Authors: Julian Berberich, Tobias Fellner, Christian Holm,
• Abstract summary: adversarial robustness and generalization have individually received substantial attention in the recent literature on quantum machine learning.<n>In this chapter, we address this interplay for variational quantum models, which were recently proposed as function approximators in supervised learning.<n>We discuss recent results quantifying both robustness and generalization via Lipschitz bounds, which explicitly depend on model parameters.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Quantum Algorithms for Causal Estimands [0.0]
  Causal machine learning aims to solve issues by estimating the expected outcome of counterfactual events.<n>It is an open question as to whether these causal algorithms provide opportunities for quantum enhancement.
  arXiv  Detail & Related papers  (2025-05-19T08:58:09Z)
• Data-Dependent Generalization Bounds for Parameterized Quantum Models Under Noise [0.0]
  This study investigates the generalization properties of parameterized quantum machine learning models under the influence of noise.<n>We present a data-dependent generalization bound grounded in the quantum Fisher information matrix.<n>We provide a structured characterization of complexity in quantum models by integrating local parameter neighborhoods and effective dimensions defined through quantum Fisher information matrix eigenvalues.
  arXiv  Detail & Related papers  (2024-12-16T05:10:58Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Training robust and generalizable quantum models [1.010625578207404]
  We derive parameter-dependent Lipschitz bounds for quantum models with trainable encoding. We show that for fixed and non-trainable encodings, the Lipschitz bound cannot be influenced by tuning the parameters.
  arXiv  Detail & Related papers  (2023-11-20T16:06:35Z)
• A PAC-Bayesian Perspective on the Interpolating Information Criterion [54.548058449535155]
  We show how a PAC-Bayes bound is obtained for a general class of models, characterizing factors which influence performance in the interpolating regime. We quantify how the test error for overparameterized models achieving effectively zero training error depends on the quality of the implicit regularization imposed by e.g. the combination of model, parameter-initialization scheme.
  arXiv  Detail & Related papers  (2023-11-13T01:48:08Z)
• Spectral chaos bounds from scaling theory of maximally efficient quantum-dynamical scrambling [44.99833362998488]
  A key conjecture about the evolution of complex quantum systems towards an ergodic steady state, known as scrambling, is that this process acquires universal features when it is most efficient.<n>We develop a single- parameter scaling theory for the spectral statistics in this scenario, which embodies exact self-similarity of the spectral correlations along the complete scrambling dynamics.<n>We establish that scaling predictions are matched by a privileged process and serve as bounds for other dynamical scrambling scenarios, allowing one to quantify inefficient or incomplete scrambling on all time scales.
  arXiv  Detail & Related papers  (2023-10-17T15:41:50Z)
• Understanding quantum machine learning also requires rethinking generalization [0.3683202928838613]
  We show that traditional approaches to understanding generalization fail to explain the behavior of quantum models. Experiments reveal that state-of-the-art quantum neural networks accurately fit random states and random labeling of training data.
  arXiv  Detail & Related papers  (2023-06-23T12:04:13Z)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Generalization despite overfitting in quantum machine learning models [0.0]
  We provide a characterization of benign overfitting in quantum models. We show how a class of quantum models exhibits analogous features. We intuitively explain these features according to the ability of the quantum model to interpolate noisy data with locally "spiky" behavior.
  arXiv  Detail & Related papers  (2022-09-12T18:08:45Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.