Quantum machine learning is one of the fields where quantum computers are expected to bring advantages over classical methods. However, the limited size of current computers restricts the exploitation of the full potential of quantum machine learning methods. Additionally, different computing paradigms, both quantum and classical, each have their own strengths and weaknesses. Obtaining optimal results with algorithms thus requires algorithms to be tweaked to the underlying computational paradigm, and the tasks to be optimally distributed over the available computational resources. In this work, we explore the potential gains from combining different computing paradigms to solve the complex task of data classification for three different datasets. We use a gate-based quantum model to implement a quantum kernel and implement a complex feature map. Next, we formulate a quadratic unconstrained optimisation problem to be solved on quantum annealing hardware. We then evaluate the losses on classical hardware and reconfigure the model parameters accordingly. We tested this so-called triple-hybrid quantum support vector machine on various data sets, and find that it achieves higher precision than other support vector machines (both quantum and classical) on complex quantum data, whereas it achieves varying performance on simple classical data using limited training. For the complex data sets, the triple-hybrid version converges faster, requiring fewer circuit evaluations.
Quantum machine learning is one of the fields where quantum computers are expected to bring advantages over classical methods. However, the limited size of current computers restricts the exploitation of the full potential of quantum machine learning methods. Additionally, different computing paradigms, both quantum and classical, each have their own strengths and weaknesses. Obtaining optimal results with algorithms thus requires algorithms to be tweaked to the underlying computational paradigm, and the tasks to be optimally distributed over the available computational resources. In this work, we explore the potential gains from combining different computing paradigms to solve the complex task of data classification for three different datasets. We use a gate-based quantum model to implement a quantum kernel and implement a complex feature map. Next, we formulate a quadratic unconstrained optimisation problem to be solved on quantum annealing hardware. We then evaluate the losses on classical hardware and reconfigure the model parameters accordingly. We tested this so-called triple-hybrid quantum support vector machine on various data sets, and find that it achieves higher precision than other support vector machines (both quantum and classical) on complex quantum data, whereas it achieves varying performance on simple classical data using limited training. For the complex data sets, the triple-hybrid version converges faster, requiring fewer circuit evaluations.
Over The past decade, quantum computing and machine learning have each witnessed tremendous growth in their respective fields. While quantum computing promises a completely novel paradigm for computation, based on the principles of superposition, entanglement, and interference, machine learning has firmly cemented its place in the sphere of data-driven decision-making. This paper seeks to provide a practical solution to this question, implementing a quantum classical learning system that is capable of performing binary classification tasks. We achieve this through the creation of a Quantum Kernel Support Vector Classifier (QSVC) using the Qiskit framework. While the classical feature set from the Iris dataset is scaled appropriately for the quantum system, the feature set is then represented in the quantum state through the ZZFeatureMap circuit. The QSVC utilizes the kernel-based similarity between quantum states. The results were promising, with the QSVC obtaining a classification accuracy of 92% over a test set, with the model trained in 6.32 seconds on a simulated quantum backend. The decision boundaries learned by the model were complex, and the quantum kernel representation of the feature set was able to capture the underlying class structure, which would have been difficult to achieve in a classical low-dimensional feature space. Our method, with quantum circuits relegated to state preparation and measurement while leaving the optimization to classical processes, is designed to operate within these limits. This makes our method not only theoretically interesting but also immediately applicable to existing simulators and quantum hardware.
Quantum computing has emerged as a promising technology for solving complex computational problems by leveraging the principles of quantum mechanics, including superposition and entanglement. Integrating quantum computing with classical machine learning offers a potential approach to improving learning capabilities and classification performance. This research proposes a Hybrid Quantum-Classical Machine Learning Framework that combines classical data preprocessing techniques with parameterized quantum circuits to perform classification tasks. The framework uses classical machine learning components for feature preprocessing and data encoding, while a variational quantum circuit extracts quantum representations of the input data. A classical optimizer updates the quantum circuit parameters iteratively to minimize a predefined classification loss function. The proposed framework is evaluated using benchmark classification datasets and compared with conventional machine learning models, including Support Vector Machines, Logistic Regression, and classical Neural Networks. Performance is assessed using accuracy, precision, recall, F1-score, computational cost, and training time. Experiments also investigate the effects of circuit depth, feature selection, and simulated quantum noise on classification performance. The framework is implemented using the PennyLane quantum simulation library alongside standard machine learning libraries. The study identifies the conditions under which hybrid quantum-classical learning can provide competitive classification performance and determines the practical limitations of current quantum machine learning approaches. The findings contribute to a better understanding of the effectiveness, scalability, and feasibility of hybrid quantum classical models for realworld classification problems.
Quantum computers acting as ML accelerators have attracted considerable interest as a promising avenue for addressing the limitations of classical computing confronted with solving complex, high-dimensional problems and handling large data sets. The most exciting aspect of quantum computing lies in its quantum advantage via techniques such as quantum parallelism, superposition, and entanglement which allows not only for rapid data processing, but also a means to resolve complex optimization problems beyond the capacity of classical algorithms. Nevertheless, the usage of quantum computing in machine learning is still a fledgling domain, with challenges concerning quantum noise, hardware restrictions, and algorithmic development. In particular, this research is concerned with the development of and study on hybrid quantum-classical algorithms that target to improve ML models in terms of computational capabilities by making use of the best of both worlds. To address this, researchers are developing hybrid algorithms that leverage the strengths of quantum computing for specific tasks, like optimization and pattern recognition, while still relying on classical computing for more flexible and larger-scale processing, ultimately achieving more efficient machine learning systems that can handle large datasets and complex problem-solving more effectively. It includes potential hybrid approaches like quantum-enhanced optimization algorithms, quantum neural networks, and quantum support vector machines, and examines how such algorithms can be used for practical ML problems including data classification, regression and clustering. Furthermore, the paper proposes that hybrid quantum algorithms offer several advantages over their classical counterparts, such as faster convergence rates, higher accuracy in high-dimensional spaces, and improved handling of non-linear and complex problem landscapes. Key advancements in the area of data processing speed and efficiency in problem-solving with and without quantum in the machine learning workflow are also highlighted in the research through comparative analysis and simulation studies. Lastly, the paper concludes by outlining the obstacles yet to be surmounted and the opportunities that lie ahead for hybrid quantum-classical algorithms, such as further improvement of quantum hardware and error mitigation methods, as well as the design of new algorithmic paradigms that seamlessly integrates the classical and quantum computing spaces.
This work presents a fully quantum approach to support vector machine (SVM) learning by integrating gate-based quantum kernel methods with quantum annealing-based optimization. We explore the construction of quantum kernels using various feature maps and qubit configurations, evaluating their suitability through Kernel-Target Alignment (KTA). The SVM dual problem is reformulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem, enabling its solution via quantum annealers. Our experiments demonstrate that a high degree of alignment in the kernel and an appropriate regularization parameter lead to competitive performance, with the best model achieving an F1-score of 90%. These results highlight the feasibility of an end-to-end quantum learning pipeline and the potential of hybrid quantum architectures in quantum high-performance computing (QHPC) contexts.
Quantum computing has been proven to excel in factorization issues and unordered search problems due to its capability of quantum parallelism. This unique feature allows exponential speed-up in solving certain problems. However, this advantage does not apply universally, and challenges arise when combining classical and quantum computing to achieve acceleration in computation speed. This paper aims to address these challenges by exploring the current state of quantum machine learning and benchmarking the performance of quantum and classical algorithms in terms of accuracy. Specifically, we conducted experiments with three datasets for binary classification, implementing Support Vector Machine (SVM) and Quantum SVM (QSVM) algorithms. Our findings suggest that the QSVM algorithm outperforms classical SVM on complex datasets, and the performance gap between quantum and classical models increases with dataset complexity, as simple models tend to overfit with complex datasets. While there is still a long way to go in terms of developing quantum hardware with sufficient resources, quantum machine learning holds great potential in areas such as unsupervised learning and generative models. Moving forward, more efforts are needed to explore new quantum learning models that can leverage the power of quantum mechanics to overcome the limitations of classical machine learning.
This thesis explores the integration of quantum computing into Machine Learning (ML), aiming to evaluate the effectiveness and limitations of quantum-enhanced models compared to classical approaches. As quantum technologies continue to develop, they offer the potential for solving complex computational problems more efficiently, particularly in fields requiring high-dimensional data processing. A literature review is conducted to contextualize current advancements in Quantum Machine Learning, highlighting theoretical benefits and existing practical limitations. This work investigates whether quantum methods, specifically the Quantum Support Vector Classifier (QSVC), can provide measurable improvements over its classical counterpart. The QSVC, implemented using IBM’s Qiskit ML library, replaces traditional kernel functions with quantum kernels computed via quantum circuits and feature maps, embedding classical data into a Hilbert space. The experimental portion of this thesis compares classical and quantum models on two distinct datasets: one from the healthcare domain and another from particle physics. Various parameters are tested in a constrained grid search due to the high computational demands of quantum circuits. Results indicate that while quantum models are significantly more resource-intensive, they can achieve comparable or even improved performance on data that has more complex relations between their variables. However, scalability remains a major challenge. This work concludes that although QSVC does not yet consistently outperform classical models, it offers advantages in specific contexts and lays the groundwork for identifying future use cases where quantum computing may offer a practical advantage in ML.