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

EPJ Quantum Technology

Quantum hybrid feature selector

Vadim Lopatkin, Asel Sagingalieva, Luca Lusnig, Tatjana Protasevich, Bernadette Behnke, Alexey A. Melnikov

Published Mar 18, 2026• 2 citations
Publisher

Abstract

Abstract Unsupervised feature selection is essential for high-dimensional machine learning tasks, as it improves model quality and efficiency while providing interpretable insights into datasets. However, existing methods often struggle to simultaneously achieve robustness, reliability, interpretability, and computational efficiency. Furthermore, feature selection in quantum machine learning remains largely unexplored despite the potential of quantum approaches to capture complex feature interactions. In this work, we propose the Quantum Hybrid Feature Selector, a novel unsupervised feature selection framework that combines quantum-enhanced feature extraction with interpretable scoring algorithms. Our main contributions are threefold: we introduce a quantum hybrid autoencoder pipeline that couples feature extraction with feature ranking in the original input space, we define three scoring mechanisms: SHAP-based scoring, correlation-matrix scoring, and weight-based analysis, that relate latent features to original features without requiring external predictive models, and we provide comprehensive empirical evaluation on synthetic and real-world benchmarks with statistical validation. On Madelon-style synthetic datasets, our quantum SCM achieves up to 23.5% improvement in Mean Informative Rank and 9.7% improvement in Informative Ratio compared to classical alternatives, with all improvements statistically significant at $p < 0.001$ p < 0.001 . On the Communities and Crime dataset with injected noise features, both quantum and classical SCM variants achieve near-perfect noise elimination, demonstrating effective denoising capability on real-world data. We also show that expert input is essential for evaluating feature selectors, as different methods emphasize distinct aspects of the data despite similar aggregate metrics. Finally, we evaluate QHFS under realistic hardware noise conditions using device-informed simulations based on IBM superconducting quantum processors, demonstrating graceful performance degradation and systematic improvement with increased shot budgets, which supports the practical viability of our approach on near-term quantum devices.

DOI
10.1140/epjqt/s40507-026-00491-1

Related papers

Hybrid Quantum-Classical Feature Extraction approach for Image Classification using Autoencoders and Quantum SVMs

Donovan Slabbert, Francesco Petruccione

In order to leverage quantum computers for machine learning tasks such as image classification, careful consideration is required: NISQ-era quantum computers have limitations, which include noise, scalability, read-in and read-out times, and gate operation times. Therefore, strategies should be devised to mitigate the impact that complex datasets can have on the overall efficiency of a quantum machine learning pipeline. This may otherwise lead to excessive resource demands or increased noise. We apply a classical feature extraction method using a ResNet10-inspired convolutional autoencoder to both reduce the dimensionality of the dataset and extract abstract and meaningful features before feeding them into a quantum machine learning block. The quantum block of choice is a quantum-enhanced support vector machine (QSVM), as support vector machines typically do not require large sample sizes to identify patterns in data and have short-depth quantum circuits, which limits the impact of noise. The autoencoder is trained to extract meaningful features through image reconstruction, aiming to minimize the mean squared error across a training set. Three image datasets are used to illustrate the pipeline: HTRU-1, MNIST, and CIFAR-10. We also include a quantum-enhanced one-class support vector machine (QOCSVM) for the highly unbalanced HTRU-1 set, as well as classical machine learning results to serve as a benchmark. Finally, the HTRU-2 dataset is also included to serve as a benchmark for a dataset with well-correlated features. The autoencoder achieved near-perfect reconstruction and high classification accuracy for MNIST, while CIFAR-10 showed poorer performance due to image complexity, and HTRU-1 struggled because of dataset imbalance. This highlights the need for a balance between dimensionality reduction through classical feature extraction and prediction performance using quantum methods.

arXiv:2410.18814•Oct 24, 2024•9 citations

Towards Explainable Quantum Machine Learning: A Hybrid Quantum SHAP-based Framework

M. Ramu, Donapati Deepika, Nikhila Baddula +3 more

Quantum machine learning is becoming popular as a method to enhance computational intelligence using concepts of quantum mechanics. However, quantum models tend to be complex and probabilistic, making them difficult to interpret and limiting their application in real-world scenarios where transparent decision-making is important. This work introduces a quantum-aware feature attribution framework that combines hybrid quantum-classical models with Quantum SHAP-based explainability. The proposed methodology enables prediction interpretation by analyzing the sensitivity of classical input features within quantum circuits. Experiments conducted on benchmark datasets demonstrate that the proposed method achieves competitive predictive performance while improving the stability and consistency of explanations. The framework also provides better understanding of feature contributions even in the presence of quantum noise. Overall, the findings indicate that explainability methods can improve transparency and trust in quantum machine learning models. This work contributes toward the development of more reliable and interpretable quantum-based learning systems by bridging quantum computing and explainable artificial intelligence.

International Conference on Computing Methodologies and Communication (ICCMC)•Jul 1, 2026•0 citations

Quantum-Based Feature Selection and Dimensionality Reduction

Jincheng Zhang

This paper explores the application of quantum computing to the critical tasks of feature selection and dimensionality reduction within machine learning. Traditional methods often struggle with high-dimensional data, leading to computational bottlenecks and potentially reduced model accuracy. We propose a novel approach leveraging the principles of quantum error correction and quantum entanglement to construct an algorithm capable of efficiently identifying and reducing the most relevant features. The core mechanism utilizes quantum machine learning techniques, specifically quantum feature mapping and feature extraction, to transform data into a quantum state that inherently captures feature relationships. This allows for a more effective selection process based on quantum interference and the exploration of complex correlations. We demonstrate, theoretically, the potential advantages of this approach over classical methods, highlighting improvements in both efficiency and predictive accuracy. The algorithm's design incorporates error correction to mitigate the effects of noise inherent in quantum systems, further enhancing its robustness. The research contributes to the growing field of quantum machine learning, offering a new paradigm for tackling complex data challenges.

•Sep 5, 2026•0 citations

Quantum Feature Selection Methods for Improved Machine Learning Models

Prasanth Sp, Yukti Varshney

Feature selection was a critical process in machine learning that enhances model performance by identifying the most relevant features from high-dimensional datasets. This book chapter delves into various feature selection methodologies, emphasizing the significance of hybrid approaches that leverage the strengths of different techniques, including filter, wrapper, and embedded methods. It critically examines the advantages and limitations of each method, providing insights into their applicability across diverse domains. The chapter also explores future directions in hybrid feature selection, including the integration of advanced algorithms, adaptation to varying data types, and the incorporation of domain knowledge. Emphasizing computational efficiency and real-time application potential, this work serves as a comprehensive guide for researchers and practitioners aiming to enhance machine learning models through effective feature selection. The findings and discussions presented herein contribute to the ongoing discourse in the field and provide a roadmap for future research initiatives.

•Dec 7, 2024•0 citations

A HYBRID QUANTUM-CLASSICAL MACHINE LEARNING FRAMEWORK FOR IMPROVED CLASSIFICATION ACCURACY

Shweta Narayan Bamne, Prof. M.S Shegokar

Quantum computing has emerged as a promising technology for solving complex computational problems by leveraging the principles of quantum mechanics, including superposition and entanglement. Integrating quantum computing with classical machine learning offers a potential approach to improving learning capabilities and classification performance. This research proposes a Hybrid Quantum-Classical Machine Learning Framework that combines classical data preprocessing techniques with parameterized quantum circuits to perform classification tasks. The framework uses classical machine learning components for feature preprocessing and data encoding, while a variational quantum circuit extracts quantum representations of the input data. A classical optimizer updates the quantum circuit parameters iteratively to minimize a predefined classification loss function. The proposed framework is evaluated using benchmark classification datasets and compared with conventional machine learning models, including Support Vector Machines, Logistic Regression, and classical Neural Networks. Performance is assessed using accuracy, precision, recall, F1-score, computational cost, and training time. Experiments also investigate the effects of circuit depth, feature selection, and simulated quantum noise on classification performance. The framework is implemented using the PennyLane quantum simulation library alongside standard machine learning libraries. The study identifies the conditions under which hybrid quantum-classical learning can provide competitive classification performance and determines the practical limitations of current quantum machine learning approaches. The findings contribute to a better understanding of the effectiveness, scalability, and feasibility of hybrid quantum classical models for realworld classification problems.

International Journal of Engineering Applied Sciences and Technology•Oct 1, 2026•0 citations

Quantum-Enhanced Feature Selection for High-Dimensional Data

Jincheng Zhang

Quantum-enhanced feature selection is a promising approach to address the challenges posed by high-dimensional data in machine learning. Traditional feature selection methods often struggle to effectively identify the most informative features, leading to suboptimal model performance and increased computational cost. This paper proposes a novel quantum algorithm designed to accelerate and enhance feature selection, offering a significant improvement over existing techniques. We explore the potential of quantum algorithms, specifically focusing on Grover's search algorithm and quantum-enhanced k-means clustering, to achieve efficient identification of relevant features. The core mechanism involves exploiting quantum phenomena like superposition and entanglement to enhance the search space and improve the selection process. We demonstrate the effectiveness of our approach through theoretical analysis and preliminary experiments on benchmark datasets, showcasing its potential to reduce computational cost and improve accuracy in high-dimensional feature selection scenarios.

•Sep 1, 2026•0 citations
Abstract Unsupervised feature selection is essential for high-dimensional machine learning tasks, as it improves model quality and efficiency while providing interpretable insights into datasets. However, existing methods often struggle to simultaneously achieve robustness, reliability, interpretability, and computational efficiency. Furthermore, feature selection in quantum machine learning remains largely unexplored despite the potential of quantum approaches to capture complex feature interactions. In this work, we propose the Quantum Hybrid Feature Selector, a novel unsupervised feature selection framework that combines quantum-enhanced feature extraction with interpretable scoring algorithms. Our main contributions are threefold: we introduce a quantum hybrid autoencoder pipeline that couples feature extraction with feature ranking in the original input space, we define three scoring mechanisms: SHAP-based scoring, correlation-matrix scoring, and weight-based analysis, that relate latent features to original features without requiring external predictive models, and we provide comprehensive empirical evaluation on synthetic and real-world benchmarks with statistical validation. On Madelon-style synthetic datasets, our quantum SCM achieves up to 23.5% improvement in Mean Informative Rank and 9.7% improvement in Informative Ratio compared to classical alternatives, with all improvements statistically significant at p<0.001p < 0.001p<0.001 p < 0.001 . On the Communities and Crime dataset with injected noise features, both quantum and classical SCM variants achieve near-perfect noise elimination, demonstrating effective denoising capability on real-world data. We also show that expert input is essential for evaluating feature selectors, as different methods emphasize distinct aspects of the data despite similar aggregate metrics. Finally, we evaluate QHFS under realistic hardware noise conditions using device-informed simulations based on IBM superconducting quantum processors, demonstrating graceful performance degradation and systematic improvement with increased shot budgets, which supports the practical viability of our approach on near-term quantum devices.
In order to leverage quantum computers for machine learning tasks such as image classification, careful consideration is required: NISQ-era quantum computers have limitations, which include noise, scalability, read-in and read-out times, and gate operation times. Therefore, strategies should be devised to mitigate the impact that complex datasets can have on the overall efficiency of a quantum machine learning pipeline. This may otherwise lead to excessive resource demands or increased noise. We apply a classical feature extraction method using a ResNet10-inspired convolutional autoencoder to both reduce the dimensionality of the dataset and extract abstract and meaningful features before feeding them into a quantum machine learning block. The quantum block of choice is a quantum-enhanced support vector machine (QSVM), as support vector machines typically do not require large sample sizes to identify patterns in data and have short-depth quantum circuits, which limits the impact of noise. The autoencoder is trained to extract meaningful features through image reconstruction, aiming to minimize the mean squared error across a training set. Three image datasets are used to illustrate the pipeline: HTRU-1, MNIST, and CIFAR-10. We also include a quantum-enhanced one-class support vector machine (QOCSVM) for the highly unbalanced HTRU-1 set, as well as classical machine learning results to serve as a benchmark. Finally, the HTRU-2 dataset is also included to serve as a benchmark for a dataset with well-correlated features. The autoencoder achieved near-perfect reconstruction and high classification accuracy for MNIST, while CIFAR-10 showed poorer performance due to image complexity, and HTRU-1 struggled because of dataset imbalance. This highlights the need for a balance between dimensionality reduction through classical feature extraction and prediction performance using quantum methods.
Quantum machine learning is becoming popular as a method to enhance computational intelligence using concepts of quantum mechanics. However, quantum models tend to be complex and probabilistic, making them difficult to interpret and limiting their application in real-world scenarios where transparent decision-making is important. This work introduces a quantum-aware feature attribution framework that combines hybrid quantum-classical models with Quantum SHAP-based explainability. The proposed methodology enables prediction interpretation by analyzing the sensitivity of classical input features within quantum circuits. Experiments conducted on benchmark datasets demonstrate that the proposed method achieves competitive predictive performance while improving the stability and consistency of explanations. The framework also provides better understanding of feature contributions even in the presence of quantum noise. Overall, the findings indicate that explainability methods can improve transparency and trust in quantum machine learning models. This work contributes toward the development of more reliable and interpretable quantum-based learning systems by bridging quantum computing and explainable artificial intelligence.
This paper explores the application of quantum computing to the critical tasks of feature selection and dimensionality reduction within machine learning. Traditional methods often struggle with high-dimensional data, leading to computational bottlenecks and potentially reduced model accuracy. We propose a novel approach leveraging the principles of quantum error correction and quantum entanglement to construct an algorithm capable of efficiently identifying and reducing the most relevant features. The core mechanism utilizes quantum machine learning techniques, specifically quantum feature mapping and feature extraction, to transform data into a quantum state that inherently captures feature relationships. This allows for a more effective selection process based on quantum interference and the exploration of complex correlations. We demonstrate, theoretically, the potential advantages of this approach over classical methods, highlighting improvements in both efficiency and predictive accuracy. The algorithm's design incorporates error correction to mitigate the effects of noise inherent in quantum systems, further enhancing its robustness. The research contributes to the growing field of quantum machine learning, offering a new paradigm for tackling complex data challenges.
Feature selection was a critical process in machine learning that enhances model performance by identifying the most relevant features from high-dimensional datasets. This book chapter delves into various feature selection methodologies, emphasizing the significance of hybrid approaches that leverage the strengths of different techniques, including filter, wrapper, and embedded methods. It critically examines the advantages and limitations of each method, providing insights into their applicability across diverse domains. The chapter also explores future directions in hybrid feature selection, including the integration of advanced algorithms, adaptation to varying data types, and the incorporation of domain knowledge. Emphasizing computational efficiency and real-time application potential, this work serves as a comprehensive guide for researchers and practitioners aiming to enhance machine learning models through effective feature selection. The findings and discussions presented herein contribute to the ongoing discourse in the field and provide a roadmap for future research initiatives.
Quantum computing has emerged as a promising technology for solving complex computational problems by leveraging the principles of quantum mechanics, including superposition and entanglement. Integrating quantum computing with classical machine learning offers a potential approach to improving learning capabilities and classification performance. This research proposes a Hybrid Quantum-Classical Machine Learning Framework that combines classical data preprocessing techniques with parameterized quantum circuits to perform classification tasks. The framework uses classical machine learning components for feature preprocessing and data encoding, while a variational quantum circuit extracts quantum representations of the input data. A classical optimizer updates the quantum circuit parameters iteratively to minimize a predefined classification loss function. The proposed framework is evaluated using benchmark classification datasets and compared with conventional machine learning models, including Support Vector Machines, Logistic Regression, and classical Neural Networks. Performance is assessed using accuracy, precision, recall, F1-score, computational cost, and training time. Experiments also investigate the effects of circuit depth, feature selection, and simulated quantum noise on classification performance. The framework is implemented using the PennyLane quantum simulation library alongside standard machine learning libraries. The study identifies the conditions under which hybrid quantum-classical learning can provide competitive classification performance and determines the practical limitations of current quantum machine learning approaches. The findings contribute to a better understanding of the effectiveness, scalability, and feasibility of hybrid quantum classical models for realworld classification problems.
Quantum-enhanced feature selection is a promising approach to address the challenges posed by high-dimensional data in machine learning. Traditional feature selection methods often struggle to effectively identify the most informative features, leading to suboptimal model performance and increased computational cost. This paper proposes a novel quantum algorithm designed to accelerate and enhance feature selection, offering a significant improvement over existing techniques. We explore the potential of quantum algorithms, specifically focusing on Grover's search algorithm and quantum-enhanced k-means clustering, to achieve efficient identification of relevant features. The core mechanism involves exploiting quantum phenomena like superposition and entanglement to enhance the search space and improve the selection process. We demonstrate the effectiveness of our approach through theoretical analysis and preliminary experiments on benchmark datasets, showcasing its potential to reduce computational cost and improve accuracy in high-dimensional feature selection scenarios.