# Quantum Adiabatic Feature Selection

Source: [Quantum Adiabatic Feature Selection](<https://www.sota2.com/research/paper/68fa3a981e209131ce8cbc18>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-27T03:58:29.621Z

Authors: Kapil K. Sharma

Published: 2019-09-18T23:10:49.000Z

## Abstract

Dimensionality reduction is the fundamental problem for machine learning and pattern recognition. During data preprocessing, the feature selection is often demanded to reduce the computational complexity. The problem of feature selection is categorized as a NP optimization problem. Exhaustive search of huge set of features takes huge amount of time on classical computer. In the present paper we discuss the role of quantum adiabatic computation to perform feature selection with bi-quadratic optimization and provide a quantum feature selection algorithm. Our algorithm runs with the quantum adiabatic time complexity bound $O(1/g\_{min}^{2})$, which is better than classical approach for bi-quadratic feature selection.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1909.08732>)

[PDF](<https://arxiv.org/pdf/1909.08732.pdf>)
