Adaptive Quantum Kernel Optimization for Scalable and Noise-Resilient Nonlinear Pattern Recognition

Read the full article See related articles

Discuss this preprint

Start a discussion What are Sciety discussions?

Listed in

This article is not in any list yet, why not save it to one of your lists.
Log in to save this article

Abstract

Quantum kernel methods have emerged as a powerful paradigm for extending classical machine learning into high-dimensional quantum Hilbert spaces, offering potential advantages in complex, nonlinear pattern recognition. However, their performance on near-term quantum devices remains constrained by circuit depth, noise sensitivity, and suboptimal parameterization of quantum feature maps. This paper introduces an Adaptive Quantum Kernel Optimization (AQKO) framework that integrates circuit-level adaptability, hybrid optimization, and regularization to enhance both expressivity and robustness in quantum kernel learning. The proposed method employs Adaptive Quantum Feature Maps (AQFM) that dynamically adjust rotation and phase parameters through a hybrid gradient-based optimization routine, reducing overfitting and improving generalization. Furthermore, a regularized quantum kernel objective is formulated to stabilize eigenvalue spectra under Noisy Intermediate-Scale Quantum (NISQ) conditions. Extensive experiments on nonlinear benchmark datasets — including Moons , Circles , and Iris — demonstrate that AQKO achieves up to 8.5% higher classification accuracy and 32% lower circuit depth compared to static quantum kernels. Hardware validation using IBM’s ibmq_quito device confirms AQKO’s resilience under depolarizing noise (p = 0.02) with a 41% error mitigation efficiency gain. These findings highlight AQKO’s potential as a scalable and noise-tolerant foundation for real-world quantum-enhanced learning, bridging the gap between theoretical quantum kernel models and practical NISQ implementations.

Article activity feed