Data-Dependent Generalization Bounds for Parameterized Quantum Models Under Noise

Abstract

Quantum machine learning offers a transformative approach to solving complex problems, but the inherent noise hinders its practical implementation in near-term quantum devices. This obstacle makes it difficult to understand the generalizability of quantum circuit models. Designing robust quantum machine learning models under noise requires a principled understanding of complexity and generalization, extending beyond classical capacity measures. This study investigates the generalization properties of parameterized quantum machine learning models under the influence of noise. We present a data-dependent generalization bound grounded in the quantum Fisher information matrix. We leverage statistical learning theory to relate the parameter space volumes and training sizes to estimate the generalization capability of the trained model. 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. We also analyze the tightness of the bound and discuss the tradeoff between model expressiveness and generalization performance.

The Journal of Supercomputing

References in corpus (35)

• Quantum Computing in the NISQ era and beyond
• Quantum Machine Learning
• Variational Quantum Algorithms
• Supervised learning with quantum enhanced feature spaces
• Barren plateaus in quantum neural network training landscapes
• Quantum machine learning in feature Hilbert spaces
• Parameterized quantum circuits as machine learning models
• Robust randomized benchmarking of quantum processes
• The effect of data encoding on the expressive power of variational quantum machine learning models
• Power of data in quantum machine learning
• Quantum Fisher information matrix and multiparameter estimation
• Challenges and Opportunities in Quantum Machine Learning
• Connecting ansatz expressibility to gradient magnitudes and barren plateaus
• A rigorous and robust quantum speed-up in supervised machine learning
• Quantum machine learning: a classical perspective
• Generalization in quantum machine learning from few training data
• Quantum Natural Gradient
• Effect of barren plateaus on gradient-free optimization
• Theory of overparametrization in quantum neural networks
• Generalization in Quantum Machine Learning: a Quantum Information Perspective
• Introduction to quantum Fisher information
• Fisher Information in Noisy Intermediate-Scale Quantum Applications
• Machine learning quantum states in the NISQ era
• A comprehensive review of Quantum Machine Learning: from NISQ to Fault Tolerance
• Local asymptotic normality for qubit states
• Analyzing the barren plateau phenomenon in training quantum neural networks with the ZX-calculus
• Fidelity susceptibility and quantum Fisher information for density operators with arbitrary ranks
• Understanding quantum machine learning also requires rethinking generalization
• Out-of-distribution generalization for learning quantum dynamics
• The complexity of quantum support vector machines
• A Scalable Maximum Likelihood Method for Quantum State Tomography
• Efficiently improving the performance of noisy quantum computers
• Noisy Quantum Kernel Machines
• Generalization of Quantum Machine Learning Models Using Quantum Fisher Information Metric
• Complexity Measures and Concept Learning