Equivalence between exponential concentration in quantum machine learning kernels and barren plateaus in variational algorithms
arXiv:2501.07433 · doi:10.1103/6hbr-kj64
Abstract
We formalize a rigorous connection between barren plateaus (BP) in variational quantum algorithms and exponential concentration of quantum kernels for machine learning. Our results imply that recently proposed strategies to build BP-free quantum circuits can be utilized to construct useful quantum kernels for machine learning. This is illustrated by a numerical example employing a provably BP-free quantum neural network to construct kernel matrices for classification datasets of increasing dimensionality without exponential concentration.
References in corpus (32)
- Quantum Machine Learning
- Variational Quantum Algorithms
- Supervised learning with quantum enhanced feature spaces
- Barren plateaus in quantum neural network training landscapes
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum machine learning in feature Hilbert spaces
- Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
- Power of data in quantum machine learning
- Efficient Learning for Deep Quantum Neural Networks
- Challenges and Opportunities in Quantum Machine Learning
- Exact and Approximate Unitary 2-Designs: Constructions and Applications
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus
- Local random quantum circuits are approximate polynomial-designs
- Effect of barren plateaus on gradient-free optimization
- Diagnosing Barren Plateaus with Tools from Quantum Optimal Control
- Barren Plateaus in Variational Quantum Computing
- Training Quantum Embedding Kernels on Near-Term Quantum Computers
- Equivalence of quantum barren plateaus to cost concentration and narrow gorges
- Barren plateaus preclude learning scramblers
- Higher Order Derivatives of Quantum Neural Networks with Barren Plateaus
- On barren plateaus and cost function locality in variational quantum algorithms
- Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networks
- Theory for Equivariant Quantum Neural Networks
- Theoretical Guarantees for Permutation-Equivariant Quantum Neural Networks
- Does provable absence of barren plateaus imply classical simulability?
- On the practical usefulness of the Hardware Efficient Ansatz
- Covariant quantum kernels for data with group structure
- Enhancing Quantum Support Vector Machines through Variational Kernel Training
- Quantum kernels for real-world predictions based on electronic health records
- The Presence and Absence of Barren Plateaus in Tensor-network Based Machine Learning
- Absence of barren plateaus in finite local-depth circuits with long-range entanglement
- Efficient classical algorithms for simulating symmetric quantum systems