Sep 2026· Journal of Computing Theories and Applications· 0 citations· 34 references
TL;DR
The results indicate that the effect of entanglement depends jointly on the feature-map architecture, dataset, and specific qubit connections rather than on entanglement density alone.
Abstract
Quantum kernel methods encode classical data into quantum states using specially designed feature-map circuits and then train a classical SVM on the resulting kernel matrix. Prior studies of entanglement structure typically compare only a few basic topologies, such as linear, circular, and full entanglement, leaving the broader space of entanglement graphs largely unexplored. This study exhaustively evaluates all possible entanglement topologies of a TwoLocal feature map and benchmarks them against classical methods and standard quantum feature maps on two synthetic datasets (Adhoc3_150 and Adhoc4_150) and two real-world datasets (Blood and Banknote). On Adhoc4_150, the best TwoLocal topology achieves an accuracy of 0.7556, matching Pauli Z; on Blood, it reaches 0.6889, exceeding RBF SVM and Pauli Z at 0.6667; and on Banknote, it achieves 1.0000, compared with 0.9778 for RBF SVM. In contrast, Random Forest achieves the highest accuracy on Adhoc3_150 at 0.8222, exceeding all evaluated quantum configurations. Across all four datasets, increasing the number of entangling pairs does not consistently improve accuracy, while the standard linear, circular, and full Pauli ZZ topologies never outperform Pauli Z. To further characterize this behavior, we propose a factorial linear modeling approach that quantifies the contribution of individual entanglement edges and qubit connectivity to classification accuracy. On Adhoc4_150, two edges exhibit significant negative effects, whereas Blood and Banknote show both significant positive and negative edge effects. The q0q1 edge is significant across all three four-feature datasets but reverses direction across datasets. These results indicate that the effect of entanglement depends jointly on the feature-map architecture, dataset, and specific qubit connections rather than on entanglement density alone. The proposed framework can also be applied to sampled topology sets, providing a basis for targeted entanglement analysis beyond exhaustively enumerable low-qubit systems.
Qmes, an open-source Python package that automatically recommends circuits through meta-learning that enables efficient and practical encoding-circuit selection for quantum kernel methods, is presented.
D. Tung, Quoc Chuong Nguyen, Hai Tuan Vu et al.· 0 citations
Results indicate that high performance in the proposed object detection model does not require maximal entanglement and efficient learning can emerge through topology controlled information flow, targeted restriction of entanglement, and information renormalization within the Hilbert space.
Mohammad Bahrami, M. Rafiee, Mohsen Norouzi· 0 citations
Entanglement and non-stabilizerness are complementary resources underlying the complexity of quantum states, yet extracting either quantity from large quantum circuits generally requires exponentially scaling resources. In diagrammatic approaches to quantum computation, such as the ZX-calculus, both quantities likewise...
M. Szyniszewski, R. A. Shaikh, A. Kissinger· 0 citations
We develop a quantum approach to spectral feature extraction from the density of states (DOS) of a problem-dependent Hamiltonian, and apply it to machine learning on signed graphs. We propose to embed a signed graph as an Ising model instance with positive and negative interactions, and use the standardized moments of...
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.