In this paper we present a supervised machine learning quantum classifier. It consists of a quantum data re-uploading classifier with binary trainable parameters, the optimal values of which are found by a quantum search algorithm. We show that we can reach the quadratic speed-up in optimization trainable parameters compared to classical brute force search.
In this paper we present a supervised machine learning quantum classifier. It consists of a quantum data re-uploading classifier with binary trainable parameters, the optimal values of which are found by a quantum search algorithm. We show that we can reach the quadratic speed-up in optimization trainable parameters compared to classical brute force search.
In this paper, we present classical machine learning algorithms enhanced by quantum technology to classify a data set. The data set contains binary input variables and binary output variables. The goal is to extend classical approaches such as neural networks by using quantum machine learning principles. Classical algorithms struggle as the dimensionality of the feature space increases. We examine the usage of quantum technologies to speed up these classical algorithms and to introduce the new quantum paradigm into machine diagnostic domain. Most of the prognosis models based on binary or multi-valued classification have become increasingly complex throughout the recent past. Starting with a short introduction into quantum computing, we will present an approach of combining quantum computing and classical machine learning to the reader. Further, we show different implementations of quantum classification algorithms. Finally, the algorithms presented are applied to a data set. The results of the implementations are shown and discussed in the last section.
With the advent of the era of big data, how to efficiently process data has become an urgent problem. Although classical machine learning algorithms are very mature in processing data, they require a large amount of data to complete the training process. Quantum machine learning uses the superposition, entanglement, parallelism and other characteristics of quantum computing to improve the performance of classical machine learning algorithms. At the same time, circuit optimization of the quantum classifier can reduce the computational complexity. This paper proposes an automatic optimization model of the classifier based on the variational quantum algorithm, which reduces the complexity of the parameter update process through the deep optimization of the core circuit. This model greatly speeds up the training process and has lower complexity than other quantum classifiers. In addition, a unique regularization method is used to avoid overfitting. The simulation results show that the classification of some typical data sets can achieve better classification results, and the training parameters and training speed are significantly better than other quantum classifiers. Finally, the robustness of the classifier is further verified in the presence of noise.
Machine learning is widely regarded as a promising application in which quantum computing could offer a computational advantage. However, general quantum machine learning models with provable guarantees on performance, trainability, and efficient inference remain limited. In this work, we introduce quantum Hamiltonian embeddings, a supervised learning framework in which a classical training dataset is encoded into a single effective, parameterized Hamiltonian. Training optimizes the parameters of this data-dependent Hamiltonian, whose approximate ground state defines the classification rule. Once the ground state has been approximated using a quantum algorithm, inference can be performed either classically using a classical representation of the learned state, or with a quantum representation of the state. We establish efficient methods for gradient estimation and prove favorable generalization guarantees. Furthermore, under standard cryptographic assumptions, we show that Hamiltonian embeddings can realize hypothesis functions beyond the reach of efficient classical algorithms. We then demonstrate the framework at scale on IBM Heron processors using a standard benchmark dataset. Together, these results establish Hamiltonian embeddings as a new framework for quantum machine learning, combining theoretical guarantees with a path for experimental investigations at scale on quantum hardware.
Supervised machine learning is the classification of new data based on already classified training examples. In this work, we show that the support vector machine, an optimized binary classifier, can be implemented on a quantum computer, with complexity logarithmic in the size of the vectors and the number of training examples. In cases where classical sampling algorithms require polynomial time, an exponential speedup is obtained. At the core of this quantum big data algorithm is a nonsparse matrix exponentiation technique for efficiently performing a matrix inversion of the training data inner-product (kernel) matrix.
In this work, we investigate the use of a quantum circuit as a binary classification model in the context of quantum machine learning. We call this model, binary quantum classifier.
First, we describe fundamental concepts of quantum computing and introduce the computational tool used: Qibo, an open-source framework for efficient quantum simulations and quantum hardware control. Then, we describe how to design a binary quantum classifier for the classification of images and small arrays of variables by showing how to input data in the circuit, defining a quantum circuit model Ansatz with trainable parameters and a loss function, and implementing multiple minimizers. We test our quantum classifier with two data sets. The first one is the MNIST data set which is composed of handwritten digits (reduced to only handwritten zeros and handwritten ones for binary classification). We study the behavior of different minimizers by increasing the number of layers of the Ansatz. The second data set represents two different high energy collisions that can occur at colliders such as LHC (CERN). Due to in-time proton-proton interactions known as pile-up, we distinguish two different data sets: "without pile-up" and "with pile-up". These collisions can be represented by images of size 32x32 or by six high-level variables that we call features. By increasing the size of the training data set and the number of layers of the Ansatz, we search for the best minimizer. Splitting the data set in training set and test set, we compute: ROC curve, AUC score, confusion matrices and test set accuracy. For "with pile-up" images, we compare the results obtained with the quantum classifier with a small convolutional neural network.
We conclude that is possible to build a binary quantum classifier with a quantum circuit and we highlight its performances and limitations in comparison with classical technologies.
Abstract Hybrid quantum machine learning combines classical minimization with parameterized quantum circuits, enabling powerful learning models even on near-term quantum hardware. This work presents an evaluation of hybrid quantum machine learning classifiers using the data re-uploading framework across nine binary and multi-class classification tasks with varying geometric complexity. We compare three quantum circuit architectures, single-qubit, two-qubit, and two-qubit entangled, trained with three classical minimizers: COBYLA, Nelder-Mead, and SLSQP. Our experiments span training sizes from 1 to 200 samples and reveal that two-qubit classifiers, when paired with the SLSQP minimizer, achieve the highest overall test accuracy of 99.775% on structured tasks and strong performance (up to 89.78%) on complex multi-class pattern. Among minimizers, SLSQP consistently provides the best generalization, while entanglement improves accuracy in non-linear and fragmented tasks. By analyzing accuracy trends, generalization gaps, and confusion matrices, this study offers practical guidance for designing quantum classifiers that scale effectively and generalize well, providing a foundation for real-world Hybrid quantum machine learning applications.