Quantum Kernel Methods: Convergence Theory, Separation Bounds and Applications to Marketing Analytics

Abstract

This work studies the feasibility of applying quantum kernel methods to a real consumer classification task in the NISQ regime. We present a hybrid pipeline that combines a quantum-kernel Support Vector Machine (Q-SVM) with a quantum feature extraction module (QFE), and benchmark it against classical and quantum baselines in simulation and with limited shallow-depth hardware runs. With fixed hyperparameters, the proposed Q-SVM attains 0.7790 accuracy, 0.7647 precision, 0.8609 recall, 0.8100 F1, and 0.83 ROC AUC, exhibiting higher sensitivity while maintaining competitive precision relative to classical SVM. We interpret these results as an initial indicator and a concrete starting point for NISQ-era workflows and hardware integration, rather than a definitive benchmark. Methodologically, our design aligns with recent work that formalizes quantum-classical separations and verifies resources via XEB-style approaches, motivating shallow yet expressive quantum embeddings to achieve robust separability despite hardware noise constraints.

arXiv comment15 pages, 3 figures

References in corpus (10)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Supervised learning with quantum enhanced feature spaces
• Quantum machine learning in feature Hilbert spaces
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Power of data in quantum machine learning
• A rigorous and robust quantum speed-up in supervised machine learning
• Training Quantum Embedding Kernels on Near-Term Quantum Computers
• Covariant quantum kernels for data with group structure
• Quantum Kernel Methods under Scrutiny: A Benchmarking Study
• Efficient Parameter Optimisation for Quantum Kernel Alignment: A Sub-sampling Approach in Variational Training