The way in which classical data are encoded into quantum states plays a significant role in both classification performance and quantum circuit complexity in Quantum Machine Learning. In this study, the effects of different quantum feature encoding strategies on Quantum Support Vector Machine performance were investigated using five binary classification datasets. In particular, the statistical relationships between features were incorporated into quantum circuits through \(RY(θ)\) and controlled-\(RY(θ)\) gates, and this approach was compared with conventional quantum feature maps. The results demonstrate that incorporating statistical relationships into the encoding process can influence classification performance. However, more complex and densely entangled circuits do not necessarily yield higher performance. In addition, a composite evaluation metric was employed to jointly assess predictive performance, generalization, and circuit cost. The findings across the five datasets indicate that the choice of quantum feature encoding strategy should account for the underlying structure of the data and that predictive performance should be evaluated together with quantum circuit complexity.
The way in which classical data are encoded into quantum states plays a significant role in both classification performance and quantum circuit complexity in Quantum Machine Learning. In this study, the effects of different quantum feature encoding strategies on Quantum Support Vector Machine performance were investigated using five binary classification datasets. In particular, the statistical relationships between features were incorporated into quantum circuits through (RY(θ)) and controlled-(RY(θ)) gates, and this approach was compared with conventional quantum feature maps. The results demonstrate that incorporating statistical relationships into the encoding process can influence classification performance. However, more complex and densely entangled circuits do not necessarily yield higher performance. In addition, a composite evaluation metric was employed to jointly assess predictive performance, generalization, and circuit cost. The findings across the five datasets indicate that the choice of quantum feature encoding strategy should account for the underlying structure of the data and that predictive performance should be evaluated together with quantum circuit complexity.
The support vector machine algorithm with a quantum kernel estimator (QSVM-Kernel), as a leading example of a quantum machine learning technique, has undergone significant advancements. Nevertheless, its integration with classical data presents unique challenges. While quantum computers primarily interact with data in quantum states, embedding classical data into quantum states using feature mapping techniques is essential for leveraging quantum algorithms Despite the recognized importance of feature mapping, its specific impact on data classification outcomes remains largely unexplored. This study addresses this gap by comprehensively assessing the effects of various feature mapping methods on classification results, taking medical data analysis as a case study. In this study, the QSVM-Kernel method was applied to classification problems in two different and publicly available medical datasets, namely, the Wisconsin Breast Cancer (original) and The Cancer Genome Atlas (TCGA) Glioma datasets. In the QSVM-Kernel algorithm, quantum kernel matrices obtained from 9 different quantum feature maps were used. Thus, the effects of these quantum feature maps on the classification results of the QSVM-Kernel algorithm were examined in terms of both classifier performance and total execution time. As a result, in the Wisconsin Breast Cancer (original) and TCGA Glioma datasets, when Rx and Ry rotational gates were used, respectively, as feature maps in the QSVM-Kernel algorithm, the best classification performances were achieved both in terms of classification performance and total execution time. The contributions of this study are that (1) it highlights the significant impact of feature mapping techniques on medical data classification outcomes using the QSVM-Kernel algorithm, and (2) it also guides undertaking research for improved QSVM classification performance.
Background: Classical algorithms often struggle with the high dimensionality of medical data critical for early lung cancer diagnosis. While Quantum Machine Learning (QML) offers enhanced pattern recognition capabilities, the impact of specific quantum feature encoding strategies on diagnostic accuracy remains underexplored.Methods: We evaluated Quantum Support Vector Machines (QSVM) using a dataset of 309 lung cancer patients, divided into six balanced subsets to mitigate class imbalance. Models were implemented on a qasm simulator, comparing three encoding strategies: ZFeatureMap, ZZFeatureMap, and PauliFeatureMap. Performance was assessed using standard classification metrics.Results: The choice of feature map significantly influenced model efficacy. The PauliFeatureMap outperformed other kernels, achieving 100% classification accuracy in three of the six subsets, whereas ZFeatureMap and ZZFeatureMap yielded lower predictive consistency.Conclusion: Quantum feature map selection is a decisive factor in QSVM performance. Specifically, the PauliFeatureMap demonstrates high separability for medical data, highlighting the potential of optimized quantum kernels to improve diagnostic precision.
Machine learning has exploded in popularity in recent years with applications on a wide range of tasks. However, this has often been achieved by scaling compute resources, which has its limits. To further improve these systems both in performance and efficiency it is worth investigating other approaches. One such approach is quantum machine learning. Using quantum mechanics it is possible to more efficiently solve certain problems, and the hope is for it to transfer into machine learning as well. An important part of quantum machine learning is the feature map: the function that converts classical data into quantum data. This study investigated the impact of the choice of feature map on binary classification performance, for quantum support vector machines. By controlling multiple parameters of generated datasets, as well as comparing with real-world datasets, it is possible to learn how different aspects affect feature maps. There were clear differences in performance, with the angle and IQP feature maps generally performing well, while the amplitude for example did not. However the best performing feature map depended on the dataset, for example the angle entangled feature map performed the best on the high overlap dataset, while it was not for the low overlap dataset. It is therefore important to adapt the choice of feature map based on the dataset used. When comparing with a classical baseline it can be concluded that the unique mechanics of quantum circuits sometimes allow the models to achieve higher performance than classical models. This indicates that quantum machine learning is a useful research direction.
In this work, we studied the use of Quantum Machine Learning (QML) algorithms for binary classification and compared their performance with classical Machine Learning (ML) methods. QML merges principles of Quantum Computing (QC) and ML, offering improved efficiency and potential quantum advantage in data-driven tasks and when solving complex problems. In binary classification, where the goal is to assign data to one of two categories, QML uses quantum algorithms to process large datasets efficiently. Quantum algorithms like Quantum Support Vector Machines (QSVM) and Quantum Neural Networks (QNN) exploit quantum parallelism and entanglement to enhance performance over classical methods. This study focuses on two common QML algorithms, Quantum Support Vector Classifier (QSVC) and QNN. We used the Qiskit software and conducted the experiments with three different datasets. Data preprocessing included dimensionality reduction using Principal Component Analysis (PCA) and standardization using scalers. The results showed that quantum algorithms demonstrated competitive performance against their classical counterparts in terms of accuracy, while QSVC performed better than QNN. These findings suggest that QML holds potential for improving computational efficiency in binary classification tasks. This opens the way for more efficient and scalable solutions in complex classification challenges and shows the complementary role of quantum computing.
Quantum computing has the capability to efficiently solve complex problems that would require significantly longer processing times on classical computing systems. This study investigates the practical applications of quantum machine learning by comparing the performance of classical Support Vector Machines (SVM) and Quantum Support Vector Machines (QSVM) across three simulation-based quantum computing platforms: Qiskit, Cirq, and Pennylane. Through experiments conducted on various datasets, the study examines the influence of different feature mapping techniques—ZFeatureMap, ZZFeatureMap, and Pauli-FeatureMap—on the encoding of data into quantum states within QSVM models. The results demonstrate that both the choice of computational environment and the feature mapping strategy play a crucial role in determining the performance of quantum machine learning applications. The findings underscore the potential advantages of quantum-based approaches for tackling complex computational problems.
Quantum-enhanced machine learning is a rapidly evolving field that aims to leverage the unique properties of quantum mechanics to enhance classical machine learning. However, the practical applicability of these methods remains an open question, particularly beyond the context of specifically crafted toy problems, and given the current limitations of quantum hardware. This study focuses on quantum kernel methods in the context of classification tasks. In particular, it examines the performance of quantum kernel estimation and quantum kernel training (QKT) in connection with two quantum feature mappings, namely, ZZFeatureMap and CovariantFeatureMap. Remarkably, these feature maps have been proposed in the literature under the conjecture of possible near-term quantum advantage and have shown promising performance in ad hoc datasets. This study aims to evaluate their versatility and generalization capabilities in a more general benchmark, encompassing both artificial and established reference datasets. Classical machine learning methods, specifically support vector machines and logistic regression, are also incorporated as baseline comparisons. Experimental results indicate that quantum methods exhibit varying performance across different datasets. Despite outperforming classical methods in ad hoc datasets, mixed results are obtained for the general case among standard classical benchmarks. The experimental data call into question a general added value of applying QKT optimization, for which the additional computational cost does not necessarily translate into improved classification performance. Instead, it is suggested that a careful choice of the quantum feature map in connection with proper hyperparameterization may prove more effective.