These results demonstrate a scalable, reproducible workflow for quantum kernel experimentation at HEP-relevant scale, quantifying the practical cost of realistic hardware noise on quantum-enhanced classification.
Abstract
We present a systematic design for large-scale quantum kernel classification, demonstrated through a quantum support vector classifier (QSVC) for particle-track classification using centroid-based CLAS12 drift-chamber features. Each event is encoded into a six-qubit state via a fully entangled ZZFeatureMap, whose fidelities define a quantum kernel within a standard SVM framework. By decoupling state preparation from kernel construction and distributing evaluation across a multi-node MPI-based HPC allocation, the approach scales to 1.0x10^5 training and 4.0x10^5 test events with an exactly constructed kernel matrix, to our knowledge more than an order of magnitude larger than prior high-energy-physics quantum-kernel studies. Benchmarked against linear, polynomial, RBF, and sigmoid SVM kernels and extremely randomized trees (ERT), the ideal QSVC achieves the highest recall (99.99%) among all models. Under a calibrated hardware noise model (FakeMumbaiV2, 500 training / 2,000 test events), AUC falls from 0.9985 to 0.9671 and peak significance improvement falls from 17.5 to ~3.5, yet recall remains at 99.51% -- indicating this signal-retention advantage is attenuated but not eliminated by circuit-level decoherence. Geometric analysis of the quantum embedding shows near-orthogonal inter-class states with coherent intra-class neighborhoods under ideal simulation; under noise this structure compresses toward the maximally mixed state while preserving its relative ordering. These results demonstrate a scalable, reproducible workflow for quantum kernel experimentation at HEP-relevant scale, quantifying the practical cost of realistic hardware noise on quantum-enhanced classification.
This study evaluated state recognition from 100 by 100 two-gate current maps using 30 by 30 labeled patches under a strict device-level split to support fidelity-based quantum kernels as practical components for automated quantum dot tuning pipelines requiring few-shot generalization.
M. Ashakin, Rubayat Khan, A. Mahata et al.· International Conference on...· 0 citations
Quantum Machine Learning (QML) combines quantum computing principles and traditional machine learning principles to provide new ways to solve difficult classification problems through the use of quantum technology. The goal of this paper is to implement a Quantum Kernel Support Vector Machine (QKSVM) using PennyLane and evaluate it against a standard image classification dataset, Fashion-MNIST. The Fashion-MNIST images are represented as 28x28 grayscale pixel arrays; they are normalized using a min-max normalizer with output values between zero and one. The 28x28 arrays are then dimensionally reduced to a size of four principal components (approximately 85% cumulative explained variance), and the QKSVM will utilize a quantum circuit limited to four qubits which is consistent with today's Noisy, Intermediate-Scale Quantum (NISQ) capabilities for performing simulations. Each input feature is represented as a qubit via an RY rotation and the qubits are then entangled using a CNOT circuit to generate the quantum kernel matrix, which is computed as the pairwise fidelity of each input image's state, which is subsequently used by a classical SVM classifier implementing a one-versus-all classification method. The QKSVM achieved approximately 40% accuracy and a macro-F1 score of 0.37 on a 100 sample stratified subset of the Fashion-MNIST test dataset, compared with 60% and 91.2%, respectively, using a classical Radial Basis Function Support Vector Machine (RBF-SVM) classifier with the same four principal components of input features and a Convolutional Neural Network (CNN) with full input images. With a primary bottleneck of qubit count, circuit depth, and shot noise, this work serves as a fully documented and reproducible baseline for future research on quantifying the performance of hybrid classical and quantum image classifiers across standardized image dataset benchmarks.
M. Devi, S.Sravanthi, V. Chaithanya et al.· 2026 7th International Confe...· 0 citations
Selecting an effective encoding quantum circuit is a key challenge in quantum kernel methods because different feature maps can lead to different performance. Conventional methods require constructing and evaluating every circuit for each new dataset, making it computationally expensive. We present Qmes, an open-source Python package that automatically recommends circuits through meta-learning. Qmes characterizes a dataset using classical complexity measures and queries a pre-trained model to recommend circuits without quantum evaluation at inference time. The package provides modular components for meta-feature extraction, quantum-kernel evaluation, recommender training, model selection, and user-defined circuit extension. We validate Qmes on 105 classification and 86 regression benchmark datasets. Qmes reduces the mean recommendation regret by 2.2x and 4.2x for classification and regression, respectively, compared to a non-adaptive baseline, with statistical significance confirmed via a paired Wilcoxon signed-rank test ($p<10^{-4}$). Qmes thus enables efficient and practical encoding-circuit selection for quantum kernel methods.
D. Tung, Quoc Chuong Nguyen, Hai Tuan Vu et al.· 0 citations
A systematic comparison of four classical machine learning architectures, support vector machines, artificial neural networks, convolutional neural networks, and long short-term memory networks against their quantum counterparts against their quantum counterparts characterize the trade-offs between classical and quantum approaches under realistic, resource-constrained conditions and provide a benchmark for future studies on actual quantum hardware.
Tariq Mahmood, Z. Abidin, Itzel Luviano Soto et al.· 0 citations
Reliable attribution of artificial intelligence (AI)-generated text to a specific large language model (LLM) matters increasingly as LLMs proliferate, yet where quantum machine learning actually stands on this task has, to our knowledge, never been measured systematically. We benchmark the quantum support vector machine (QSVM) for binary attribution between Gemma 3 and Qwen 2.5 on a 5800-sample corpus from paired prompts: 83 configurations sweeping qubit count, regularization, training-set size, feature-map family, and circuit depth under exact, noiseless classical statevector simulation. QSVM validation accuracy plateaus at approximately 88%, whereas a classical support vector machine with a radial basis function kernel reaches approximately 97.8% on the identical fourteen-dimensional inputs: the ceiling belongs to the quantum (fidelity) kernel, not to the input representation. We measure the mechanism: off-diagonal quantum kernel values shrink exponentially with qubit count, the signature of exponential kernel concentration. The same classical model recovers the stylometric attribution fingerprint, showing it belongs to the shared feature pipeline rather than to the quantum kernel. All large-scale headline results generalize to an independent 1000-text test set produced after every design decision was frozen. The study provides a cautionary, reproducible benchmark for quantum kernel natural language processing and outlines an open-set extension as future work.
Kalin Kopanov, Tatiana V. Atanasova· Information· 0 citations
The Rodeo algorithm is shown to provide a direct quantum analogue of the kernel polynomial method, derive the estimator and its uncertainties, establish an explicit dictionary between signal-processing window functions and quantum reconstruction kernels, and validate the method on the one-dimensional transverse-field Ising and spin-1 models.
Julio Cesar Siqueira Rocha· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
