Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.31260

Can Entanglement-Induced Feature-Map Designs Improve Projected Quantum Kernels?

Ravi Kumar Jha, Hsuan-Yin Lin, Eirik Rosnes

quant-phcs.AIcs.LGSubmitted Oct 22, 2026• Announced Oct 23, 2026• 0 citations
arXivHTMLPDF

Abstract

Projected quantum kernels (PQKs) have emerged as a notable approach to circumvent the hardness of machine learning tasks arising from the exponential dimensionality of the quantum Hilbert space. However, recent PQK studies often rely heavily on extensive classical hyperparameter tuning of the radial basis function (RBF) kernel parameter and the support vector machine regularization parameter. The extensive tuning can mask the true representational power of the underlying PQKs induced by quantum feature maps, which has not been explored in detail. Thus, this work aims to expose the structural capabilities of PQKs by isolating and evaluating their native inductive bias through comparisons between untuned and tuned PQKs against the RBF baseline. Furthermore, we propose novel quantum feature maps that leverage two-qubit entanglement to capture multivariate correlations in IoT data. The results show that extensive tuning can lead to competitive performance architectures, while our proposed entanglement topologies exhibit a significantly stronger native inductive bias. This reveals that superior quantum architectural design can yield structurally better PQKs with improvements arising from quantum-mechanical properties rather than from classical hyperparameter tuning.

AI Summary

The paper asks whether projected quantum kernels (PQKs) benefit from feature-map design independently of classical kernel and SVM hyperparameter tuning. It compares rotation-based and IQP feature maps with two proposed variants using selected, feature-dependent two-qubit interactions. Entangling topologies are chosen by empirical performance over candidate pairwise interaction structures. Experiments use noiseless six-qubit PennyLane simulations on one room-occupancy dataset containing 2,865 samples and six sensor features. PQKs apply an RBF kernel to 18 single-qubit or adjacent-pair Pauli expectation values, or their 36-dimensional concatenation. Evaluation uses 10-fold cross-validation with reported 95% confidence intervals, comparing fixed regularization and variance-based bandwidth heuristics against grid-search tuning. Classical comparisons include RBF SVMs, random forests, and neural networks. The proposed entangled maps reach tuned accuracy of $0.903\pm0.011$ and $0.903\pm0.008$, compared with $0.893\pm0.008$ for the tuned classical RBF and $0.902\pm0.006$ for random forests. The strongest untuned proposed map reaches $0.868\pm0.014$, versus $0.826\pm0.017$ for the untuned RBF; standard rotation maps reach up to $0.864$. Generic circular-CNOT and IQP designs do not improve on standard rotation maps. An unentangled ablation is also reported. Smaller tuned–untuned performance differences are interpreted as evidence of task-specific inductive bias under the prescribed defaults. The stated limitations are heuristic feature-map design and evaluation on a single, relatively small dataset. Performance comparisons may depend on baseline hyperparameter choices; broader dataset and baseline robustness tests are left for future work.

Little sign of AI-generated textIncrementalSmall numerics onlyOverclaims

Central claim may not hold: The proposed Rot(X)^en map has equal or lower untuned accuracy than standard Rot(X) in all three measurement settings, contradicting stronger native performance for both proposed architectures. The reported results do not establish the abstract's statistically suggestive claim of a 'significantly stronger' native inductive bias. Both proposed maps have larger combined-measurement tuning gains than their corresponding standard rotation maps, so reduced tuning dependence is not demonstrated consistently relative to existing PQKs. The purportedly untuned architectures were selected through empirical topology optimization, which remains a model-selection contribution not isolated by fixing SVM and bandwidth parameters. The ablation supports a task-specific benefit of selected entangling interactions, but does not establish the broader attribution to intrinsically quantum properties rather than nonlinear representation design and empirical selection.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Comparative performance analysis of quantum feature maps for quantum kernel-based machine learning

Ravi Kumar Jha, Nikola Kirilov Kasabov, Saugat Bhattacharyya +2 more

Quantum algorithms have become a popular research domain in recent times for discovering quantum-enhanced solutions in machine learning applications. Quantum kernels are one of the directions that establish such quantum-enhanced solutions to some extent. This work presents a detailed analysis of the quantum kernel approach leveraging feature maps and relevant hyperparameters to develop enhanced quantum kernels. The study includes a new high-order feature map and assesses five existing state-of-the-art feature maps for enhanced quantum kernel classifiers. Additionally, the significance of the rotational factor as a hyperparameter is highlighted for improving kernel performance. Also, it is analyzed whether different hyperparameter-tuned feature maps can lead to enhanced decision boundaries, demonstrating kernel expressivity. The analysis is undertaken on classification tasks using four different nonlinear datasets of distinct complexity. Comparative evaluations are also made with traditional machine learning models-Support Vector Machines (Linear and RBF), Naïve Bayes, Linear Discriminant Analysis, Decision Tree, Random Forest, Adaptive Boosting, and MLP. Overall, the study demonstrates that a well-tuned quantum feature map can enhance the generalization ability of quantum kernels, making them more effective for broader quantum-enhanced machine learning applications.

Scientific Reports•Feb 10, 2026•3 citations

Quantum kernel methods under scrutiny: a benchmarking study

Jan Schnabel, Marco Roth

Abstract Since the entry of kernel theory in the field of quantum machine learning, quantum kernel methods (QKMs) have gained increasing attention with regard to both probing promising applications and delivering intriguing research insights. Benchmarking these methods is crucial to gain robust insights and to understand their practical utility. In this work, we present a comprehensive large-scale study examining QKMs based on fidelity quantum kernels (FQKs) and projected quantum kernels (PQKs) across a manifold of design choices. Our investigation encompasses both classification and regression tasks for five dataset families and 64 datasets, systematically comparing the use of FQKs and PQKs quantum support vector machines and kernel ridge regression. This resulted in over 20,000 models that were trained and optimized using a state-of-the-art hyperparameter search to ensure robust and comprehensive insights. We delve into the importance of hyperparameters on model performance scores and support our findings through rigorous correlation analyses. Additionally, we provide an in-depth analysis addressing the design freedom of PQKs and explore the underlying principles responsible for learning. Our goal is not to identify the best-performing model for a specific task but to uncover the mechanisms that lead to effective QKMs and reveal universal patterns.

arXiv:2409.04406•Quantum Machine Intelligence•Apr 24, 2025•84 citations

Numerical evidence against advantage with quantum fidelity kernels on classical data

Lucas Slattery, Ruslan Shaydulin, Shouvanik Chakrabarti +3 more

Quantum machine learning techniques are commonly considered one of the most promising candidates for demonstrating practical quantum advantage. In particular, quantum kernel methods have been demonstrated to be able to learn certain classically intractable functions efficiently if the kernel is well aligned with the target function. In the more general case, quantum kernels are known to suffer from exponential ``flattening'' of the spectrum as the number of qubits grows, preventing generalization and necessitating the control of the inductive bias by hyperparameters. We show that the general-purpose hyperparameter-tuning techniques proposed to improve the generalization of quantum kernels lead to the kernel becoming well approximated by a classical kernel, removing the possibility of quantum advantage. We provide extensive numerical evidence for this phenomenon utilizing multiple previously studied quantum feature maps and both synthetic and real data. Our results show that unless novel techniques are developed to control the inductive bias of quantum kernels, they are unlikely to provide a quantum advantage on classical data that lacks special structure.

arXiv:2211.16551•Physical Review A•Jun 20, 2023•29 citations

Investigating Quantum Kernel Feature Maps and Kernel Alignment for Multivariate Spatio-Temporal Pattern Classification

Vishwambhar Pathak, Nisheeth Joshi, Prabhat Mahanti

AI-driven solutions and simulations often involve spatio-temporal multivariate signals. However, such real-life signals are mostly nonlinear, noisy, and high-dimensional. Fetching sparse and subtle spatio-temporal patterns from them for descriptive and predictive applications poses challenge to traditional machine learning models. With recent practicable advancements in quantum computing technologies, quantum kernel methods have been exploited to map classical data into high-dimensional Hilbert spaces which transform complex relationships into separable patterns. In this work we investigate the effectiveness of quantum kernel methods for the case of EEG signal classification and compares their performance with classical radial basis function (RBF) kernels. Quantum encoding was performed using angle-encoding and necessary circuit elements including swap-test. The investigation was conducted using two sets of synthetic EEG datasets: (1) simple sinusoidal signals and (2) nonlinear signals with phase and amplitude variability. Principal Component Analysis was used to reduce dimensionality before kernel construction. For contrasting the Classical vs Quantum workflows, feature maps produced by Classical and Quantum kernel matrices were computed and fed to Support Vector Machine (SVM) classifier. The workflow then evaluated Kernel-target alignment for estimation of the correspondence between kernel similarity structures and class labels. For simple sinusoidal signals, training with the classical kernels achieved accuracies up to 0.967 for 8 principal component features as compared to 0.86 accuracy with the quantum kernels. However, for nonlinear EEG signals, while both workflows gave lower accuracies, still quantum kernels yielded slightly better accuracy 0.46 as compared to 0.40 by the classical kernels. The kernel-target alignment was mostly better with classical kernel, with slightly better for quantum kernel in one case. The slight improvement with quantum kernel in non-linear signal case suggests that quantum kernels may provide advantages in modelling complex nonlinear relationships. Limited alignment and limited accuracy improvement with the quantum kernel indicate need for further improvement in quantum-feature-map design to achieve quantum advantage.

•May 1, 2026•0 citations

Assessing projected quantum kernels for the classification of IoT data

Francesco D’Amore, Luca Mariani, Carlo Mastroianni +4 more

The use of quantum computing for machine learning is among the most promising applications of quantum technologies. Quantum models inspired by classical algorithms are developed to explore some possible advantages over classical approaches. A primary challenge in the development and testing of Quantum Machine Learning (QML) algorithms is the scarcity of datasets designed specifically for a quantum approach. Existing datasets, often borrowed from classical machine learning, need modifications to be compatible with current quantum hardware. In this work, we utilize a dataset generated by Internet-of-Things (IoT) devices in a format directly compatible with the proposed quantum data process, eliminating the need for feature reduction. Among quantum-inspired machine learning algorithms, the Projected Quantum Kernel (PQK) stands out for its elegant solution of projecting the data encoded in the Hilbert space into a classical space. For a prediction task concerning office room occupancy, we compare PQK with the standard Quantum Kernel (QK) and their classical counterparts to investigate how different feature maps affect the encoding of IoT data. Our findings show that the PQK demonstrates comparable effectiveness to classical methods when the proposed shallow circuit is used for quantum encoding.

arXiv:2505.14593•Array•Jan 27, 2026•5 citations

Projected Quantum Kernel for IoT Data Analysis

Francesco D’Amore, Luca Mariani, Carlo Mastroianni +2 more

The use of quantum computing for machine learning is among the most exciting applications of quantum technologies. Researchers are developing quantum models inspired by classical ones to find some possible quantum advantages over classical approaches. Although such a clear quantum advantage has not yet been achieved, the need for rigorous methodologies to test quantum machine learning (QML) algorithms is an evident requirement. A major challenge in QML development and testing is the lack of datasets specifically designed for quantum algorithms. Existing datasets, often borrowed from classical machine learning, need modifications to be compatible with current noisy quantum hardware. In this work, we use a dataset produced by internet-of-things (IoT) devices in a form usable for quantum algorithms without the need for feature reductions. Among quantum-inspired machine learning algorithms, the Projected Quantum Kernel (PQK) stands out for its elegant solution of projecting the data encoded in Hilbert space into classical space. In this paper, we detail how a PQK approach can be used to develop a prediction model on IoT data using quantum machine learning.

IEEE Conference on Pervasive and Intelligent Computing (PICom)•Nov 5, 2024•1 citation
Projected quantum kernels (PQKs) have emerged as a notable approach to circumvent the hardness of machine learning tasks arising from the exponential dimensionality of the quantum Hilbert space. However, recent PQK studies often rely heavily on extensive classical hyperparameter tuning of the radial basis function (RBF) kernel parameter and the support vector machine regularization parameter. The extensive tuning can mask the true representational power of the underlying PQKs induced by quantum feature maps, which has not been explored in detail. Thus, this work aims to expose the structural capabilities of PQKs by isolating and evaluating their native inductive bias through comparisons between untuned and tuned PQKs against the RBF baseline. Furthermore, we propose novel quantum feature maps that leverage two-qubit entanglement to capture multivariate correlations in IoT data. The results show that extensive tuning can lead to competitive performance architectures, while our proposed entanglement topologies exhibit a significantly stronger native inductive bias. This reveals that superior quantum architectural design can yield structurally better PQKs with improvements arising from quantum-mechanical properties rather than from classical hyperparameter tuning.
The paper asks whether projected quantum kernels (PQKs) benefit from feature-map design independently of classical kernel and SVM hyperparameter tuning. It compares rotation-based and IQP feature maps with two proposed variants using selected, feature-dependent two-qubit interactions. Entangling topologies are chosen by empirical performance over candidate pairwise interaction structures.
Experiments use noiseless six-qubit PennyLane simulations on one room-occupancy dataset containing 2,865 samples and six sensor features. PQKs apply an RBF kernel to 18 single-qubit or adjacent-pair Pauli expectation values, or their 36-dimensional concatenation. Evaluation uses 10-fold cross-validation with reported 95% confidence intervals, comparing fixed regularization and variance-based bandwidth heuristics against grid-search tuning. Classical comparisons include RBF SVMs, random forests, and neural networks.
The proposed entangled maps reach tuned accuracy of 0.903±0.0110.903\pm0.0110.903±0.011 and 0.903±0.0080.903\pm0.0080.903±0.008, compared with 0.893±0.0080.893\pm0.0080.893±0.008 for the tuned classical RBF and 0.902±0.0060.902\pm0.0060.902±0.006 for random forests. The strongest untuned proposed map reaches 0.868±0.0140.868\pm0.0140.868±0.014, versus 0.826±0.0170.826\pm0.0170.826±0.017 for the untuned RBF; standard rotation maps reach up to 0.8640.8640.864. Generic circular-CNOT and IQP designs do not improve on standard rotation maps. An unentangled ablation is also reported. Smaller tuned–untuned performance differences are interpreted as evidence of task-specific inductive bias under the prescribed defaults.
The stated limitations are heuristic feature-map design and evaluation on a single, relatively small dataset. Performance comparisons may depend on baseline hyperparameter choices; broader dataset and baseline robustness tests are left for future work.
Quantum algorithms have become a popular research domain in recent times for discovering quantum-enhanced solutions in machine learning applications. Quantum kernels are one of the directions that establish such quantum-enhanced solutions to some extent. This work presents a detailed analysis of the quantum kernel approach leveraging feature maps and relevant hyperparameters to develop enhanced quantum kernels. The study includes a new high-order feature map and assesses five existing state-of-the-art feature maps for enhanced quantum kernel classifiers. Additionally, the significance of the rotational factor as a hyperparameter is highlighted for improving kernel performance. Also, it is analyzed whether different hyperparameter-tuned feature maps can lead to enhanced decision boundaries, demonstrating kernel expressivity. The analysis is undertaken on classification tasks using four different nonlinear datasets of distinct complexity. Comparative evaluations are also made with traditional machine learning models-Support Vector Machines (Linear and RBF), Naïve Bayes, Linear Discriminant Analysis, Decision Tree, Random Forest, Adaptive Boosting, and MLP. Overall, the study demonstrates that a well-tuned quantum feature map can enhance the generalization ability of quantum kernels, making them more effective for broader quantum-enhanced machine learning applications.
Abstract Since the entry of kernel theory in the field of quantum machine learning, quantum kernel methods (QKMs) have gained increasing attention with regard to both probing promising applications and delivering intriguing research insights. Benchmarking these methods is crucial to gain robust insights and to understand their practical utility. In this work, we present a comprehensive large-scale study examining QKMs based on fidelity quantum kernels (FQKs) and projected quantum kernels (PQKs) across a manifold of design choices. Our investigation encompasses both classification and regression tasks for five dataset families and 64 datasets, systematically comparing the use of FQKs and PQKs quantum support vector machines and kernel ridge regression. This resulted in over 20,000 models that were trained and optimized using a state-of-the-art hyperparameter search to ensure robust and comprehensive insights. We delve into the importance of hyperparameters on model performance scores and support our findings through rigorous correlation analyses. Additionally, we provide an in-depth analysis addressing the design freedom of PQKs and explore the underlying principles responsible for learning. Our goal is not to identify the best-performing model for a specific task but to uncover the mechanisms that lead to effective QKMs and reveal universal patterns.
Quantum machine learning techniques are commonly considered one of the most promising candidates for demonstrating practical quantum advantage. In particular, quantum kernel methods have been demonstrated to be able to learn certain classically intractable functions efficiently if the kernel is well aligned with the target function. In the more general case, quantum kernels are known to suffer from exponential ``flattening'' of the spectrum as the number of qubits grows, preventing generalization and necessitating the control of the inductive bias by hyperparameters. We show that the general-purpose hyperparameter-tuning techniques proposed to improve the generalization of quantum kernels lead to the kernel becoming well approximated by a classical kernel, removing the possibility of quantum advantage. We provide extensive numerical evidence for this phenomenon utilizing multiple previously studied quantum feature maps and both synthetic and real data. Our results show that unless novel techniques are developed to control the inductive bias of quantum kernels, they are unlikely to provide a quantum advantage on classical data that lacks special structure.
AI-driven solutions and simulations often involve spatio-temporal multivariate signals. However, such real-life signals are mostly nonlinear, noisy, and high-dimensional. Fetching sparse and subtle spatio-temporal patterns from them for descriptive and predictive applications poses challenge to traditional machine learning models. With recent practicable advancements in quantum computing technologies, quantum kernel methods have been exploited to map classical data into high-dimensional Hilbert spaces which transform complex relationships into separable patterns. In this work we investigate the effectiveness of quantum kernel methods for the case of EEG signal classification and compares their performance with classical radial basis function (RBF) kernels. Quantum encoding was performed using angle-encoding and necessary circuit elements including swap-test. The investigation was conducted using two sets of synthetic EEG datasets: (1) simple sinusoidal signals and (2) nonlinear signals with phase and amplitude variability. Principal Component Analysis was used to reduce dimensionality before kernel construction. For contrasting the Classical vs Quantum workflows, feature maps produced by Classical and Quantum kernel matrices were computed and fed to Support Vector Machine (SVM) classifier. The workflow then evaluated Kernel-target alignment for estimation of the correspondence between kernel similarity structures and class labels. For simple sinusoidal signals, training with the classical kernels achieved accuracies up to 0.967 for 8 principal component features as compared to 0.86 accuracy with the quantum kernels. However, for nonlinear EEG signals, while both workflows gave lower accuracies, still quantum kernels yielded slightly better accuracy 0.46 as compared to 0.40 by the classical kernels. The kernel-target alignment was mostly better with classical kernel, with slightly better for quantum kernel in one case. The slight improvement with quantum kernel in non-linear signal case suggests that quantum kernels may provide advantages in modelling complex nonlinear relationships. Limited alignment and limited accuracy improvement with the quantum kernel indicate need for further improvement in quantum-feature-map design to achieve quantum advantage.
The use of quantum computing for machine learning is among the most promising applications of quantum technologies. Quantum models inspired by classical algorithms are developed to explore some possible advantages over classical approaches. A primary challenge in the development and testing of Quantum Machine Learning (QML) algorithms is the scarcity of datasets designed specifically for a quantum approach. Existing datasets, often borrowed from classical machine learning, need modifications to be compatible with current quantum hardware. In this work, we utilize a dataset generated by Internet-of-Things (IoT) devices in a format directly compatible with the proposed quantum data process, eliminating the need for feature reduction. Among quantum-inspired machine learning algorithms, the Projected Quantum Kernel (PQK) stands out for its elegant solution of projecting the data encoded in the Hilbert space into a classical space. For a prediction task concerning office room occupancy, we compare PQK with the standard Quantum Kernel (QK) and their classical counterparts to investigate how different feature maps affect the encoding of IoT data. Our findings show that the PQK demonstrates comparable effectiveness to classical methods when the proposed shallow circuit is used for quantum encoding.
The use of quantum computing for machine learning is among the most exciting applications of quantum technologies. Researchers are developing quantum models inspired by classical ones to find some possible quantum advantages over classical approaches. Although such a clear quantum advantage has not yet been achieved, the need for rigorous methodologies to test quantum machine learning (QML) algorithms is an evident requirement. A major challenge in QML development and testing is the lack of datasets specifically designed for quantum algorithms. Existing datasets, often borrowed from classical machine learning, need modifications to be compatible with current noisy quantum hardware. In this work, we use a dataset produced by internet-of-things (IoT) devices in a form usable for quantum algorithms without the need for feature reductions. Among quantum-inspired machine learning algorithms, the Projected Quantum Kernel (PQK) stands out for its elegant solution of projecting the data encoded in Hilbert space into classical space. In this paper, we detail how a PQK approach can be used to develop a prediction model on IoT data using quantum machine learning.