Quantum machine learning (QML) is an evolving field which is capable of surpassing the classical machine learning in solving classification and clustering problems. The enormous growth in data size started creating barrier for classical machine learning techniques. QML stand out as a best solution to handle big and complex data. In this paper quantum support vector machine (QSVM) based models for the classification of three benchmarking datasets namely, Iris species, Pumpkin seed and Raisin has been constructed. These QSVM based classification models are implemented on real-time superconducting quantum computers/simulators. The performance of these classification models is evaluated in the context of execution time and accuracy and compared with the classical support vector machine (SVM) based models. The kernel based QSVM models for the classification of datasets when run on IBMQ_QASM_simulator appeared to be 232, 207 and 186 times faster than the SVM based classification model. The results indicate that quantum computers/algorithms deliver quantum speed-up.
The primary question in the emerging field of machine learning (QML) is: can we achieve speed-up of machine learning? and/or what and how the effects contribute to the speed-up? The positive answers to such questions have recently been provided, for example, by the support vector machine (QSVM) which classifies many data vectors exponentially fast. However, to realize such an exponential learning speed-up, it is demanded to develop full-scale computer with a specific device, so-called quantum random access memory (QRAM)---which stores the classical big data, extremely fast, in the novel form of being quantum-mechanically superposed. Therefore, another question now arises: is it possible to attain learning speed-up even with the classical training data, and hence, requiring no full-scale computer and QRAM? To seek a satisfactory answer to this question, we consider a binary classification learning where the classicality of the training data are preserved. We then focus on a small unit structure for whole classification task, in which the minimum achievable learning speed-up would be exhibited. We provide the analysis and proof-of-principle experimental validation of a certain degree of learning speed-up in such a small unit, advocating an affirmative answer to the aforementioned main question. Through further investigation, it is also shown that our QML scheme is quite robust against the decoherence.
Quantum machine learning integrates quantum computing with classical machine learning techniques to enhance computational power and efficiency. A major challenge in quantum machine learning is developing robust quantum classifiers capable of accurately processing and classifying complex datasets. In this work, we present an advanced approach leveraging data re-uploading, a strategy that cyclically encodes classical data into quantum states to improve classifier performance. We examine two cost functions, fidelity and trace distance, across various quantum classifier configurations, including single-qubit, two-qubit, and entangled two-qubit systems. Additionally, we evaluate four optimization techniques (L-BFGS-B, COBYLA, Nelder-Mead, and SLSQP) to determine their effectiveness in optimizing quantum circuits for both linear and non-linear classification tasks. Our results show that the choice of optimization method significantly impacts classifier performance, with L-BFGS-B and COBYLA often yielding superior accuracy. The two-qubit entangled classifier shows improved accuracy over its non-entangled counterpart, albeit with increased computational cost. Also, the two-qubit entangled classifier is the best option for real-world random datasets in terms of accuracy and computational cost. Linear classification tasks generally exhibit more stable performance across optimization techniques compared to non-linear tasks. Our findings highlight the potential of data re-uploading in quantum machine learning, outperforming existing quantum classifier models in terms of accuracy and robustness. This work contributes to the growing field of quantum machine learning by providing a comprehensive comparison of classification strategies and optimization techniques in quantum computing environments, offering a foundation for developing more efficient and accurate quantum classifiers.