Classification Problem in a Quantum Framework
From MaRDI portal
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.
Recommendations
- A quantum-inspired version of the classification problem
- A hybrid classical-quantum approach for multi-class classification
- Quantum measurement classification with qudits
- Quantum classifiers for domain adaptation
- Classifying data using near-term quantum devices
- Quantum classification algorithm with multi-class parallel training
- A steady state quantum classifier
- Quantum decision tree classifier
- Local approach to quantum-inspired classification
- Quantum classifier with entangled subgraph states
Cites work
- A quantum-inspired version of the classification problem
- A quantum-inspired version of the nearest mean classifier
- An invitation to quantum game theory
- Applications of quantum statistics in psychological studies of decision processes
- Applied multivariate statistical analysis.
- Bagging, boosting and the random subspace method for linear classifiers
- scientific article; zbMATH DE number 2038320 (Why is no real title available?)
- scientific article; zbMATH DE number 3289061 (Why is no real title available?)
- Pattern classification.
- Quantum computation and quantum information. 10th anniversary edition
- Quantum Games and Quantum Strategies
- Quantum machine learning. What quantum computing means to data mining
- Quantum-like tunnelling and levels of arbitrage
- The quest for a quantum neural network
Cited in
(10)- A quantum-inspired version of the nearest mean classifier
- Quantum \(K\)-nearest neighbor classification algorithm based on Hamming distance
- Compact data encoding for data re-uploading quantum classifier
- Classification of patterns representing apples and oranges in three-qubit system
- Using diverging predictions from classical and quantum models to dissociate between categorization systems
- Quantum classifiers for domain adaptation
- Quantum-inspired minimum distance classification in a biomedical context
- Quantum classification algorithm with multi-class parallel training
- A quantum-inspired version of the classification problem
- A steady state quantum classifier
This page was built for publication: Classification Problem in a Quantum Framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4646390)
