Quantum kernel methods promise enhanced expressivity for learning structured data, but their usefulness has been limited by kernel concentration and barren plateaus. Both effects are mathematically equivalent and suppress trainability. We analytically prove that covariant quantum kernels tailored to datasets with group symmetries avoid exponential concentration, ensuring stable variance and guaranteed trainability independent of system size. Our results extend beyond prior two-coset constructions to arbitrary coset families, broadening the scope of problems where quantum kernels can achieve advantage. We further derive explicit bounds under coherent noise models - including unitary errors in fiducial state preparation, imperfect unitary representations, and perturbations in group element selection - and show through numerical simulations that the kernel variance remains finite and robust, even under substantial noise. These findings establish a family of quantum learning models that are simultaneously trainable, resilient to coherent noise, and linked to classically hard problems, positioning group-symmetric quantum kernels as a promising foundation for near-term and scalable quantum machine learning.
Quantum kernel methods promise enhanced expressivity for learning structured data, but their usefulness has been limited by kernel concentration and barren plateaus. Both effects are mathematically equivalent and suppress trainability. We analytically prove that covariant quantum kernels tailored to datasets with group symmetries avoid exponential concentration, ensuring stable variance and guaranteed trainability independent of system size. Our results extend beyond prior two-coset constructions to arbitrary coset families, broadening the scope of problems where quantum kernels can achieve advantage. We further derive explicit bounds under coherent noise models - including unitary errors in fiducial state preparation, imperfect unitary representations, and perturbations in group element selection - and show through numerical simulations that the kernel variance remains finite and robust, even under substantial noise. These findings establish a family of quantum learning models that are simultaneously trainable, resilient to coherent noise, and linked to classically hard problems, positioning group-symmetric quantum kernels as a promising foundation for near-term and scalable quantum machine learning.
Kernel methods in Quantum Machine Learning (QML) have recently gained significant attention as a potential candidate for achieving a quantum advantage in data analysis. Among other attractive properties, when training a kernel-based model one is guaranteed to find the optimal model's parameters due to the convexity of the training landscape. However, this is based on the assumption that the quantum kernel can be efficiently obtained from quantum hardware. In this work we study the performance of quantum kernel models from the perspective of the resources needed to accurately estimate kernel values. We show that, under certain conditions, values of quantum kernels over different input data can be exponentially concentrated (in the number of qubits) towards some fixed value. Thus on training with a polynomial number of measurements, one ends up with a trivial model where the predictions on unseen inputs are independent of the input data. We identify four sources that can lead to concentration including expressivity of data embedding, global measurements, entanglement and noise. For each source, an associated concentration bound of quantum kernels is analytically derived. Lastly, we show that when dealing with classical data, training a parametrized data embedding with a kernel alignment method is also susceptible to exponential concentration. Our results are verified through numerical simulations for several QML tasks. Altogether, we provide guidelines indicating that certain features should be avoided to ensure the efficient evaluation of quantum kernels and so the performance of quantum kernel methods.
Quantum reservoir computing (QRC) is an emerging framework for near-term quantum machine learning that offers in-memory processing, platform versatility across analogue and digital systems, and avoids typical trainability challenges such as barren plateaus and local minima. The exponential number of independent features of quantum reservoirs opens the way to a potential performance improvement compared to classical settings. However, this exponential scaling can be hindered by exponential concentration, where finite-ensemble noise in quantum measurements requires exponentially many samples to extract meaningful outputs, a common issue in quantum machine learning. In this work, we go beyond static quantum machine learning tasks and address concentration in QRC for time-series processing using quantum-scrambling reservoirs. Beyond discussing how concentration effects can constrain QRC performance, we demonstrate that leveraging Hamiltonian symmetries significantly suppresses concentration, enabling robust and scalable QRC implementations. We illustrate our approach with concrete examples, including an established QRC design.
Quantum kernel methods (QKMs) have emerged as a prominent framework for supervised quantum machine learning. Unlike variational quantum algorithms, which rely on gradient-based optimisation and may suffer from issues such as barren plateaus, non-variational QKMs employ fixed quantum feature maps, with model selection performed classically via convex optimisation and cross-validation. This separation of quantum feature embedding from classical training ensures stable optimisation while leveraging quantum circuits to encode data in high-dimensional Hilbert spaces. In this review, we provide a thorough analysis of non-variational supervised QKMs, covering their foundations in classical kernel theory, constructions of fidelity and projected quantum kernels, and methods for their estimation in practice. We examine frameworks for assessing quantum advantage, including generalisation bounds and necessary conditions for separation from classical models, and analyse key challenges such as exponential concentration, dequantisation via tensor-network methods, and the spectral properties of kernel integral operators. We further discuss structured problem classes that may enable advantage, and synthesise insights from comparative and hardware studies. Overall, this review aims to clarify the regimes in which QKMs may offer genuine advantages, and to delineate the conceptual, methodological, and technical obstacles that must be overcome for practical quantum-enhanced learning.
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.
Abstract Fidelity quantum kernels provide a provable advantage on classification problems where a group structure in the data can be exploited. However, in practical applications, the group structure may be unknown or approximate, and scaling to the ‘utility’ regime is affected by exponential concentration. We prove that an ideal behavior of fidelity kernels is always associated with a (possibly unknown) group structure in the feature map. We also propose a mitigation strategy for fidelity kernels, called Bit Flip Tolerance (BFT), to alleviate exponential concentration. Applied to real-world data with unknown structure, related to the charge schedule of electric vehicles, BFT proves useful on 40 + qubits, where mitigated accuracies reach 80%, in line with classical, compared to 33% without BFT. Through a synthetic dataset with 156 qubits, we obtain an accuracy of 80%, compared to 83% of classical models, and 37% of unmitigated quantum. This constitutes the largest experiment of quantum machine learning on IBM devices to date.
Quantum kernels offer a valid procedure for learning quantum phase transitions on quantum processing devices, yet issues on the scalability of the learning strategy in connection with the symmetry of the critical model have not been clarified. We derive a link between model symmetry and fidelity-kernel resource scaling. We quantify the measurement resources required to estimate fidelity-based quantum kernels for many-body ground states while preserving the structure of the resulting Gram matrix under finite-shot sampling. Crucially, we show that increasing symmetry in the underlying spin model systematically amplifies these shot requirements. Moving from the Z2-symmetric Ising/XY regimes to the U(1)-symmetric XX (and XXZ) regimes leads to stronger kernel concentration and therefore substantially larger shot costs under the same bounds. We consider a tunable one-dimensional spin-21 Hamiltonian spanning the transverse-field Ising, XY, XX, and XXZ limits, and define the kernel as the ground-state fidelity. Kernel entries are estimated using a SWAP-test estimator with S shots, and we adapt the ensemble spread and concentration-avoidance shot bounds to obtain practical shot requirements in terms of the interquartile range of kernel values and a representative kernel magnitude. For the free-fermion XY/XX family, we use the closed-form Bogoliubov-angle fidelity, while for the interacting XXZ chain we compute fidelities by exact diagonalization and benchmark shot-noise effects. Our symmetry-aware bounds provide a pragmatic procedure for physics-informed quantum machine learning.