arXiv:1704.06475

Classification Problem in a Quantum Framework

Enrica Santucci, Giuseppe Sergioli

Published Apr 21, 2017• 0 citations

Abstract

The aim of this paper is to provide a quantum counterpart of the well known minimum-distance classifier named Nearest Mean Classifier (NMC). In particular, we refer to the following previous works: i) in Sergioli et al. 2016, we have introduced a detailed quantum version of the NMC, named Quantum Nearest Mean Classifier (QNMC), for two-dimensional problems and we have proposed a generalization to abitrary dimensions; ii) in Sergioli et al. 2017, the n-dimensional problem was analyzed in detail and a particular encoding for arbitrary n-feature vectors into density operators has been presented. In this paper, we introduce a new promizing encoding of arbitrary n-dimensional patterns into density operators, starting from the two-feature encoding provided in the first work. Further, unlike the NMC, the QNMC shows to be not invariant by rescaling the features of each pattern. This property allows us to introduce a free parameter whose variation provides, in some case, an improvement of the QNMC performance. We show experimental results where: i) the NMC and QNMC performances are compared on different datasets; ii) the effects of the non-invariance under uniform rescaling for the QNMC are investigated.

DOI: 10.48550/arxiv.1704.06475

Related papers

Quantum Minimum Distance Classifier

Enrica Santucci

We propose a quantum version of the well known minimum distance classification model called Nearest Mean Classifier (NMC). In this regard, we presented our first results in two previous works. First, a quantum counterpart of the NMC for two-dimensional problems was introduced, named Quantum Nearest Mean Classifier (QNMC), together with a possible generalization to any number of dimensions. Secondly, we studied the n-dimensional problem into detail and we showed a new encoding for arbitrary n-feature vectors into density operators. In the present paper, another promising encoding is considered, suggested by recent debates on quantum machine learning. Further, we observe a significant property concerning the non-invariance by feature rescaling of our quantum classifier. This fact, which represents a meaningful difference between the NMC and the respective quantum version, allows us to introduce a free parameter whose variation provides, in some cases, better classification results for the QNMC. The experimental section is devoted: (i) to compare the NMC and QNMC performance on different datasets; and (ii) to study the effects of the non-invariance under uniform rescaling for the QNMC.

EntropyDec 1, 201710 citations

Quantum-inspired minimum distance classification in a biomedical context

Giuseppe Sergioli, Giorgio Ivan Russo, Enrica Santucci +5 more

We propose an application of a quantum-inspired version of the Nearest Mean Classifier (NMC) (G. Sergioli, E. Santucci, L. Didaci, J. A. Miszczak and R. Giuntini, A quantum inspired version of the NMC classifier, Soft Comput. 22(3) (2018) 691. G. Sergioli, G. M. Bosyk, E. Santucci and R. Giuntini, A quantum-inspired version of the classification problem, Int. J. Theo. Phys. 56(12) (2017) 3880. E. Santucci and G. Sergioli, Classification problem in a quantum framework, in quantum foundations, probability and information, Proc. Quantum and Beyond Conf., 13–16 June 2016, Vaxjo, Sweden, A. Khrennikov and T. Bourama, Springer-Berlin, Germany, 2018 (in press, 2018). E. Santucci, Quantum minimum distance classifier, Entropy 19(12) (2017) 659.) to a biomedical context. In particular, we benchmark the performances of such a quantum-variant of NMC against NMC and other (nonlinear) classifiers with respect to the problem of classifying the probability of survival for patients affected by idiopathic pulmonary fibrosis (IPF).

arXiv:1803.02749International Journal of Quantum InformationDec 1, 201819 citations

An efficient geometric approach to quantum-inspired classifications

Roberto Leporini, Davide Pastorello

Optimal measurements for the discrimination of quantum states are useful tools for classification problems. In order to exploit the potential of quantum computers, feature vectors have to be encoded into quantum states represented by density operators. However, quantum-inspired classifiers based on nearest mean and on Helstrom state discrimination are implemented on classical computers. We show a geometric approach that improves the efficiency of quantum-inspired classification in terms of space and time acting on quantum encoding and allows one to compare classifiers correctly in the presence of multiple preparations of the same quantum state as input. We also introduce the nearest mean classification based on Bures distance, Hellinger distance and Jensen-Shannon distance comparing the performance with respect to well-known classifiers applied to benchmark datasets.

Scientific ReportsMay 24, 20227 citations

Density Matrix Classifier

Oleksiy Kondratyev

The authors introduce a new type of quantum machine learning classifier based on the estimation of the Frobenius distance between density matrices. The central idea is to encode all samples in the dataset belonging to a particular class into a corresponding density matrix using the quantum feature map methodology. The same quantum feature map is used to encode every new test sample into its own corresponding density matrix. The Frobenius distances between the sample density matrix and the density matrices encoding all classes present in the training dataset are calculated. The class label is assigned by selecting the class with minimum distance. The density matrix classifier uses parameterized quantum circuits. On the Glass Identification dataset, it performed on par with, or sometimes exceeded, performance of standard classical classifiers including multi-layer perceptron, random forest, support vector machine, and logistic regression. The model is resistant to certain types of noise and is suitable for execution on NISQ computers.

WilmottApr 8, 20250 citations

Quantum-inspired classifiers

Roberto Leporini, Cesarino Bertini

Quantum-inspired machine learning is a new branch of machine learning based on the application of the mathematical formalism of quantum mechanics to devise novel algorithms for classical computers.We implement some quantum-inspired classification algorithms, based on quantum state discrimination, within a local approach in the feature space by taking into account elements close to the element to be classified.This local approach improves the accuracy in classification and motivates the integration with the classifiers.The quantum-inspired classifiers require the encoding of the feature vectors into density operators and methods for estimating the distinguishability of quantum states like the Helstrom state discrimination and the Pretty-Good measurement.We present a comparison of the performances of the local quantum-inspired classifiers against well-known classical algorithms in order to show that the local approach can be a valuable tool for increasing the performances of this kind of classifiers.

Computer Science Research NotesJan 1, 20250 citations

A new quantum approach to binary classification

Giuseppe Sergioli, Roberto Giuntini, Héctor Freytes

This paper proposes a new quantum-like method for the binary classification applied to classical datasets. Inspired by the quantum Helstrom measurement, this innovative approach has enabled us to define a new classifier, called Helstrom Quantum Centroid (HQC). This binary classifier (inspired by the concept of distinguishability between quantum states) acts on density matrices-called density patterns-that are the quantum encoding of classical patterns of a dataset. In this paper we compare the performance of HQC with respect to twelve standard (linear and non-linear) classifiers over fourteen different datasets. The experimental results show that HQC outperforms the other classifiers when compared to the Balanced Accuracy and other statistical measures. Finally, we show that the performance of our classifier is positively correlated to the increase in the number of "quantum copies" of a pattern and the resulting tensor product thereof.

PLoS ONEMay 9, 201954 citations