.png){kind=icon}
.png){kind=icon}
Return
Empirical power of quantum encoding methods for binary classification
.png){kind=icon}
PRE
AI
DOI：10.1007/s42484-025-00298-w.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Quantum machine learning is one of the many potential applications of quantum computing, each of which is hoped to provide some novel computational advantage. However, quantum machine learning applications often fail to outperform classical approaches on real-world classical data. The ability of these models to generalize well from few training data points is typically considered one of the few definitive advantages of this approach. In this work, we will instead focus on encoding schemes and their effects on various machine learning metrics. Specifically, we focus on real-world data encoding to demonstrate differences between quantum encoding strategies for several real-world datasets and the classification model standard, LightGBM. In particular, we apply the following encoding strategies, including three standard approaches and two modified approaches: angle, amplitude, IQP, entangled angle, and alternative IQP. As these approaches require either a significant number of qubits or gates to encode larger datasets, we perform feature selection to support the limited computing power of quantum simulators. This feature selection is performed through a quantum annealing enhanced approach that builds on a QUBO formulation of the problem. In this work, we provide a preliminary demonstration that quantum machine learning with the IQP encoding and LightGBM produce statistically equivalent results for a large majority of the assigned learning tasks.
Keywords:
Quantum machine learning
Instantaneous quantum polynomial
Quantum encoding
Quantum support vector machine
Journal
Q
IF:
4.4
Papers:
429
Citations:
796