Robust Quantum Feature Selection With Sparse Optimization Circuit

Jiaye Li, Jiagang Song, Jinjing Shi, Hang Xu, Hao Yu, Gang Chen, Shichao Zhang

Abstract: High-dimensional data has long been a notoriously challenging issue. Existing quantum dimension reduction technology primarily focuses on quantum principal component analysis. However, there are only a few studies on quantum feature selection (QFS) algorithms, and these algorithms are often not robust. Additionally, there are limited quantum circuits specifically designed for feature selection, and they still cannot address the objective function based on sparse learning. To address these issues, this article proposes a robust QFS algorithm by designing a novel sparse optimization circuit. Specifically, we first apply sparse regularization and least squares loss to construct the proposed objective function. Then, six types of quantum registers and their initial states are prepared. Furthermore, quantum techniques such as quantum phase estimation and controlled rotation are employed to construct a sparse optimization circuit, which is used to obtain the final quantum state of the feature selection variable. Finally, a series of experiments are conducted to verify the accuracy of the feature selection and the robustness of the proposed algorithm.