Encoding-dependent generalization bounds for parametrized quantum circuits

Abstract

A large body of recent work has begun to explore the potential of parametrized quantum circuits (PQCs) as machine learning models, within the framework of hybrid quantum-classical optimization. In particular, theoretical guarantees on the out-of-sample performance of such models, in terms of generalization bounds, have emerged. However, none of these generalization bounds depend explicitly on how the classical input data is encoded into the PQC. We derive generalization bounds for PQC-based models that depend explicitly on the strategy used for data-encoding. These imply bounds on the performance of trained PQC-based models on unseen data. Moreover, our results facilitate the selection of optimal data-encoding strategies via structural risk minimization, a mathematically rigorous framework for model selection. We obtain our generalization bounds by bounding the complexity of PQC-based models as measured by the Rademacher complexity and the metric entropy, two complexity measures from statistical learning theory. To achieve this, we rely on a representation of PQC-based models via trigonometric functions. Our generalization bounds emphasize the importance of well-considered data-encoding strategies for PQC-based models.

arXiv comment35 pages, 3 figures; corrected a mistake in Eq. (38) of the previous version, results remain unchanged except for a restriction to frequency vectors with integer entries; added a conjecture to recover results in full

References in corpus (19)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum Machine Learning
• Variational Quantum Algorithms
• The theory of variational hybrid quantum-classical algorithms
• Noisy intermediate-scale quantum (NISQ) algorithms
• Parameterized quantum circuits as machine learning models
• The power of quantum neural networks
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• The effect of data encoding on the expressive power of variational quantum machine learning models
• Power of data in quantum machine learning
• Data re-uploading for a universal quantum classifier
• A rigorous and robust quantum speed-up in supervised machine learning
• Quantum algorithms for supervised and unsupervised machine learning
• PennyLane: Automatic differentiation of hybrid quantum-classical computations
• Generalization in Quantum Machine Learning: a Quantum Information Perspective
• Efficient measure for the expressivity of variational quantum algorithms
• On the Quantum versus Classical Learnability of Discrete Distributions
• On the statistical complexity of quantum circuits
• Pseudo-dimension of quantum circuits

Cited by in corpus (3)

• Quantum machine learning beyond kernel methods
• Recent advances for quantum classifiers
• Fock State-enhanced Expressivity of Quantum Machine Learning Models