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:2104.04049 · International Journal of Information Technology

Predicting vehicle prices via quantum-assisted feature selection

David Von Dollen, Florian Neukart, Daniel Weimer, Thomas Bäck

Published Jul 21, 2023• 22 citations
arXivHTMLPDF

Abstract

Abstract Feature selection is a technique used to reduce complexity and improve performance in regards to generalization, fit, and accuracy of prediction for machine learning models. A central challenge in this selection process is that the search over the space of features to find the subset of k optimal features is a known NP-Hard problem. In this work, we study metrics for encoding the combinatorial search as a binary quadratic model, such as Generalized Mean Information Coefficient and Pearson Correlation Coefficient in application to the underlying regression problem of price prediction. We compare predictive model performance in regards to leveraging quantum-assisted vs. classical subroutines for the search, using minimum redundancy maximal relevancy as the heuristic for our approach. We cross validate predictive models on a real world problem of price prediction, and show a performance improvement of mean absolute error scores for our quantum-assisted method $$(1471.02 \pm {135.6})$$ ( 1471.02 ± 135.6 ) vs. similar methodologies such as greedy selection $$(1707.2 \pm {168})$$ ( 1707.2 ± 168 ) , recursive feature elimination $$(1678.3 \pm {143.7})$$ ( 1678.3 ± 143.7 ) , and all features $$(1546.2 \pm {154}$$ ( 1546.2 ± 154 ). Our findings show that by leveraging quantum assisted routines we find solutions which increase the quality of predictive model output while reducing the input dimensionality to the learning algorithm on synthetic and real-world data.

DOI
10.1007/s41870-023-01370-z

Related papers

Quantum annealing-based feature selection

Daniel Pranjić, Bharadwaj Chowdary Mummaneni, Christian Tutschku

Feature selection is crucial for enhancing the accuracy and efficiency of machine learning models. This work investigates the possibility of the usefulness of a quantum annealer to tackle the challenge of selecting features based on maximizing mutual information (MI) and conditional mutual information (CMI). Calculating the optimal feature set for maximum MI and CMI remains computationally intractable for large datasets on classical computers, even with approximation methods. This study employs a Mutual Information Quadratic Unconstrained Binary Optimization (MIQUBO) formulation, enabling its solution on a quantum annealer. Importantly, the study demonstrates the relevancy of this approach in identifying the best feature combinations that maximizes the MI and CMI. To showcase its real-world applicability, we apply MIQUBO to forecasting the price of used excavators. Our results demonstrate that using the MIQUBO approach there is an improvement in the prediction of machine learning models for datasets, with a smaller MI concentration on a subset of all features. • Problem Addressed: We tackle the computationally difficult problem of feature selection for machine learning models, specifically by maximizing mutual information (MI) and conditional mutual information (CMI) between features and the target variable. • Proposed Solution: We employ the adiabatic quantum computation paradigm to tackle this problem. The study utilizes a hybrid annealing approach, specifically the D-Wave Kerberos framework, which combines classical and quantum algorithms to solve the complex optimization problem. The feature selection task is reformulated as a Mutual Information Quadratic Unconstrained Binary Optimization (MIQUBO) problem, which can be solved on a quantum annealer. • Real-World Application: The MIQUBO method is applied to a practical, real-world scenario: forecasting the prices of used excavators. • Key Findings: The research demonstrates that using the MIQUBO approach leads to an improvement in the prediction performance of machine learning models. This is particularly true for datasets where the mutual information is less concentrated on a small subset of features.

arXiv:2411.19609•Neurocomputing•Oct 15, 2025•2 citations

A quantum computing-based approach for feature selection in regression models

Amirhossein Nourbakhshrezaei, Soroush Sheikh Gargar, Mojgan Jadidi

Feature Selection (FS) is an essential data preprocessing technique aimed at identifying the most relevant features for predictive models. However, traditional FS approaches often struggle to capture complex interactions in real-world datasets, limiting their ability to fully support high-performing Machine Learning (ML) models. This study introduces a QA-compatible QUBO-based FS formulation for regression that models both linear and non-linear feature dependencies through hybrid linear and quadratic coefficients. Using three datasets; Wine Quality, Insurance, and Bike Sharing System (BSS) we evaluate the method across multiple predictive models to assess its robustness and generalizability. Results show competitive predictive performance and, in several settings, more compact feature subsets than Mutual Information and the MI_QC baseline. This study introduces a methodological refinement over previous QUBO-based FS methods and demonstrates practical applicability through statistically robust benchmarking.

Scientific Reports•Sep 17, 2026•0 citations

Evaluating Quantum Support Vector Regression Methods for Price Forecasting Applications

Horst Stühler, Daniel Pranjić, Christian Tutschku

Support vector machines are powerful and frequently used machine learning methods for classification and regression tasks, which rely on the construction of kernel matrices. While crucial for the performance of this machine learning approach, choosing the most suitable kernel is highly problem-dependent. The emergence of quantum computers and quantum machine learning techniques provides new possibilities for generating powerful quantum kernels. Within this work, we solve a real-world price forecasting problem using fidelity and projected quantum kernels, which are promising candidates for the utility of near-term quantum computing. In our analysis, we examine and validate the most auspicious quantum kernels from literature and compare their performance with an optimized classical kernel. Unlike previous work on quantum support vector machines, our dataset includes categorical features that need to be encoded as numerical features, which we realize by using the one-hot-encoding scheme. One-hot-encoding, however, increases the dimensionality of the dataset significantly, which collides with the current limitations of noisy intermediate scale quantum computers. To overcome these limitations, we use autoencoders to learn a low-dimensional representation of the feature space that still maintains the most important information of the original data. To examine the impact of autoencoding, we compare the results of the encoded date with the results of the original, unencoded dataset. We could demonstrate that quantum kernels are comparable to or even better than the classical support vector machine kernels regarding the mean absolute percentage error scores for both encoded and unencoded datasets.

International Conference on Agents and Artificial Intelligence (ICAART)•Jan 1, 2024•7 citations

Feature selection on quantum computers

Sascha Mücke, Raoul Heese, Sabine Müller +2 more

Abstract In machine learning, fewer features reduce model complexity. Carefully assessing the influence of each input feature on the model quality is therefore a crucial preprocessing step. We propose a novel feature selection algorithm based on a quadratic unconstrained binary optimization (QUBO) problem, which allows to select a specified number of features based on their importance and redundancy. In contrast to iterative or greedy methods, our direct approach yields higher-quality solutions. QUBO problems are particularly interesting because they can be solved on quantum hardware. To evaluate our proposed algorithm, we conduct a series of numerical experiments using a classical computer, a quantum gate computer, and a quantum annealer. Our evaluation compares our method to a range of standard methods on various benchmark data sets. We observe competitive performance.

arXiv:2203.13261•Quantum Machine Intelligence•Feb 20, 2023•86 citations

QUANTUM-ASSISTED FEATURE SELECTION FOR IMPROVING PREDICTION MODEL ACCURACY ON LARGE AND IMBALANCED DATASETS

Safii Safii, Mochamad Wahyudi, Dedy Hartama

One of the biggest obstacles to creating precise machine learning models is choosing representative and pertinent characteristics from big, unbalanced datasets. While too many features raise the risk of overfitting and computational expense, class imbalance frequently results in decreased accuracy and bias. The Simulated Annealing technique is used in this study to tackle a Quadratic Unconstrained Binary Optimization (QUBO) problem that is formulated as a quantum-assisted feature selection method to handle these problems. The technique seeks to reduce inter-feature redundancy and the number of selected features. There are 102,487 samples in the majority class and 11,239 in the minority class, totaling 28 characteristics in the experimental dataset. Nine ideal features were found during the feature selection method (12, 14, 15, 22, 23, 24, 25, 27, and 28). Ten-fold cross-validation was used to assess a Random Forest Classifier that was trained using an 80:20 split. With precision, recall, f1-score, and accuracy all hitting 1.00, the suggested QUBO+SMOTE method demonstrated exceptional performance. Comparatively, QUBO without SMOTE performed worse with accuracy 0.95 and minority-class f1-score of only 0.71, whereas a traditional Recursive Feature Elimination (RFE) approach obtained accuracy 0.97 with minority-class f1-score of 0.94. These findings indicate that QUBO can reduce dimensionality and address class imbalance which requires its integration with SMOTE. This study demonstrates how quantum computing can enhance the effectiveness and efficiency of machine learning, especially for large-scale imbalanced datasets

JITK (Jurnal Ilmu Pengetahuan dan Teknologi Komputer)•Nov 27, 2025•0 citations

Feature Selection with Quantum Annealing for Biomedical Machine Learning Applications

Sarah Nixon Dudgeon, Seung Joo (Erin) Lee, Thomas J S Durant +5 more

Abstract Feature selection is a commonly used method in biomedical artificial intelligence and machine learning to identify a subset of high-quality variables that can be used to train downstream predictive models. It has been suggested that quantum feature selection (QFS), which takes advantage of the properties of quantum computers, may better identify variables that are correlated with the outcome while simultaneously reducing redundancy between selected variables. However, there are a limited number of studies evaluating their performance, particularly in real-world data sets. Here, we assess the performance of two QFS methods compared to random forest (RF) feature selection based on feature stability and the performance of a downstream classification algorithm when used to predict urinary tract infections in the emergency department from 211 original features extracted from the electronic health record. We found that a quantum binary quadratic model (BQM) and constrained quadratic model (CQM) had similar performance to RF feature selection (median F1 score of 0.60, 0.61, and 0.61 respectively) when 10 features were selected for an XGBoost classification model. The BQM and RF also had similar feature stability (0.91 and 0.94, respectively) while the CQM had lower stability (0.72). These findings show that QFS can be used with large, clinical data sets to identify features with high stability and predictive performance. As the capacity and quality of quantum computers continue to increase, these methods may offer additional benefits to classical feature selection methods.

•Jul 6, 2026•0 citations
Abstract Feature selection is a technique used to reduce complexity and improve performance in regards to generalization, fit, and accuracy of prediction for machine learning models. A central challenge in this selection process is that the search over the space of features to find the subset of k optimal features is a known NP-Hard problem. In this work, we study metrics for encoding the combinatorial search as a binary quadratic model, such as Generalized Mean Information Coefficient and Pearson Correlation Coefficient in application to the underlying regression problem of price prediction. We compare predictive model performance in regards to leveraging quantum-assisted vs. classical subroutines for the search, using minimum redundancy maximal relevancy as the heuristic for our approach. We cross validate predictive models on a real world problem of price prediction, and show a performance improvement of mean absolute error scores for our quantum-assisted method (1471.02±135.6)(1471.02 \pm {135.6})(1471.02±135.6) ( 1471.02 ± 135.6 ) vs. similar methodologies such as greedy selection (1707.2±168)(1707.2 \pm {168})(1707.2±168) ( 1707.2 ± 168 ) , recursive feature elimination (1678.3±143.7)(1678.3 \pm {143.7})(1678.3±143.7) ( 1678.3 ± 143.7 ) , and all features (1546.2±154(1546.2 \pm {154}(1546.2±154 ( 1546.2 ± 154 ). Our findings show that by leveraging quantum assisted routines we find solutions which increase the quality of predictive model output while reducing the input dimensionality to the learning algorithm on synthetic and real-world data.
Feature selection is crucial for enhancing the accuracy and efficiency of machine learning models. This work investigates the possibility of the usefulness of a quantum annealer to tackle the challenge of selecting features based on maximizing mutual information (MI) and conditional mutual information (CMI). Calculating the optimal feature set for maximum MI and CMI remains computationally intractable for large datasets on classical computers, even with approximation methods. This study employs a Mutual Information Quadratic Unconstrained Binary Optimization (MIQUBO) formulation, enabling its solution on a quantum annealer. Importantly, the study demonstrates the relevancy of this approach in identifying the best feature combinations that maximizes the MI and CMI. To showcase its real-world applicability, we apply MIQUBO to forecasting the price of used excavators. Our results demonstrate that using the MIQUBO approach there is an improvement in the prediction of machine learning models for datasets, with a smaller MI concentration on a subset of all features. • Problem Addressed: We tackle the computationally difficult problem of feature selection for machine learning models, specifically by maximizing mutual information (MI) and conditional mutual information (CMI) between features and the target variable. • Proposed Solution: We employ the adiabatic quantum computation paradigm to tackle this problem. The study utilizes a hybrid annealing approach, specifically the D-Wave Kerberos framework, which combines classical and quantum algorithms to solve the complex optimization problem. The feature selection task is reformulated as a Mutual Information Quadratic Unconstrained Binary Optimization (MIQUBO) problem, which can be solved on a quantum annealer. • Real-World Application: The MIQUBO method is applied to a practical, real-world scenario: forecasting the prices of used excavators. • Key Findings: The research demonstrates that using the MIQUBO approach leads to an improvement in the prediction performance of machine learning models. This is particularly true for datasets where the mutual information is less concentrated on a small subset of features.
Feature Selection (FS) is an essential data preprocessing technique aimed at identifying the most relevant features for predictive models. However, traditional FS approaches often struggle to capture complex interactions in real-world datasets, limiting their ability to fully support high-performing Machine Learning (ML) models. This study introduces a QA-compatible QUBO-based FS formulation for regression that models both linear and non-linear feature dependencies through hybrid linear and quadratic coefficients. Using three datasets; Wine Quality, Insurance, and Bike Sharing System (BSS) we evaluate the method across multiple predictive models to assess its robustness and generalizability. Results show competitive predictive performance and, in several settings, more compact feature subsets than Mutual Information and the MI_QC baseline. This study introduces a methodological refinement over previous QUBO-based FS methods and demonstrates practical applicability through statistically robust benchmarking.
Support vector machines are powerful and frequently used machine learning methods for classification and regression tasks, which rely on the construction of kernel matrices. While crucial for the performance of this machine learning approach, choosing the most suitable kernel is highly problem-dependent. The emergence of quantum computers and quantum machine learning techniques provides new possibilities for generating powerful quantum kernels. Within this work, we solve a real-world price forecasting problem using fidelity and projected quantum kernels, which are promising candidates for the utility of near-term quantum computing. In our analysis, we examine and validate the most auspicious quantum kernels from literature and compare their performance with an optimized classical kernel. Unlike previous work on quantum support vector machines, our dataset includes categorical features that need to be encoded as numerical features, which we realize by using the one-hot-encoding scheme. One-hot-encoding, however, increases the dimensionality of the dataset significantly, which collides with the current limitations of noisy intermediate scale quantum computers. To overcome these limitations, we use autoencoders to learn a low-dimensional representation of the feature space that still maintains the most important information of the original data. To examine the impact of autoencoding, we compare the results of the encoded date with the results of the original, unencoded dataset. We could demonstrate that quantum kernels are comparable to or even better than the classical support vector machine kernels regarding the mean absolute percentage error scores for both encoded and unencoded datasets.
Abstract In machine learning, fewer features reduce model complexity. Carefully assessing the influence of each input feature on the model quality is therefore a crucial preprocessing step. We propose a novel feature selection algorithm based on a quadratic unconstrained binary optimization (QUBO) problem, which allows to select a specified number of features based on their importance and redundancy. In contrast to iterative or greedy methods, our direct approach yields higher-quality solutions. QUBO problems are particularly interesting because they can be solved on quantum hardware. To evaluate our proposed algorithm, we conduct a series of numerical experiments using a classical computer, a quantum gate computer, and a quantum annealer. Our evaluation compares our method to a range of standard methods on various benchmark data sets. We observe competitive performance.
One of the biggest obstacles to creating precise machine learning models is choosing representative and pertinent characteristics from big, unbalanced datasets. While too many features raise the risk of overfitting and computational expense, class imbalance frequently results in decreased accuracy and bias. The Simulated Annealing technique is used in this study to tackle a Quadratic Unconstrained Binary Optimization (QUBO) problem that is formulated as a quantum-assisted feature selection method to handle these problems. The technique seeks to reduce inter-feature redundancy and the number of selected features. There are 102,487 samples in the majority class and 11,239 in the minority class, totaling 28 characteristics in the experimental dataset. Nine ideal features were found during the feature selection method (12, 14, 15, 22, 23, 24, 25, 27, and 28). Ten-fold cross-validation was used to assess a Random Forest Classifier that was trained using an 80:20 split. With precision, recall, f1-score, and accuracy all hitting 1.00, the suggested QUBO+SMOTE method demonstrated exceptional performance. Comparatively, QUBO without SMOTE performed worse with accuracy 0.95 and minority-class f1-score of only 0.71, whereas a traditional Recursive Feature Elimination (RFE) approach obtained accuracy 0.97 with minority-class f1-score of 0.94. These findings indicate that QUBO can reduce dimensionality and address class imbalance which requires its integration with SMOTE. This study demonstrates how quantum computing can enhance the effectiveness and efficiency of machine learning, especially for large-scale imbalanced datasets
Abstract Feature selection is a commonly used method in biomedical artificial intelligence and machine learning to identify a subset of high-quality variables that can be used to train downstream predictive models. It has been suggested that quantum feature selection (QFS), which takes advantage of the properties of quantum computers, may better identify variables that are correlated with the outcome while simultaneously reducing redundancy between selected variables. However, there are a limited number of studies evaluating their performance, particularly in real-world data sets. Here, we assess the performance of two QFS methods compared to random forest (RF) feature selection based on feature stability and the performance of a downstream classification algorithm when used to predict urinary tract infections in the emergency department from 211 original features extracted from the electronic health record. We found that a quantum binary quadratic model (BQM) and constrained quadratic model (CQM) had similar performance to RF feature selection (median F1 score of 0.60, 0.61, and 0.61 respectively) when 10 features were selected for an XGBoost classification model. The BQM and RF also had similar feature stability (0.91 and 0.94, respectively) while the CQM had lower stability (0.72). These findings show that QFS can be used with large, clinical data sets to identify features with high stability and predictive performance. As the capacity and quality of quantum computers continue to increase, these methods may offer additional benefits to classical feature selection methods.