Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Digitale Welt

Distance-based classifier on the Quantum Inspire

Robert S. Wezeman, Niels M. P. Neumann, Frank Phillipson

Published Dec 4, 2019• 8 citations
Publisher
DOI
10.1007/s42354-019-0240-5

Related papers

A quantum-inspired version of the nearest mean classifier

Giuseppe Sergioli, Enrica Santucci, Luca Didaci +2 more

arXiv:1603.00173•Soft Computing•Jan 2, 2017•36 citations

Quantum variational distance-based centroid classifier

Nicolas M. de Oliveira, Daniel K. Park, Israel F. Araujo +1 more

Neurocomputing•Jan 30, 2024•10 citations

Effect of Different Encodings and Distance Functions on Quantum Instance-Based Classifiers

Alessandro Berti, Anna Bernasconi, Gianna M. Del Corso +1 more

Lecture notes in computer science•Jan 1, 2022•5 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.02749•International Journal of Quantum Information•Dec 1, 2018•21 citations

Quantum-inspired Classification Algorithms

Emmanuel Zambrini Cruzeiro, Christine De Mol, Serge Massar +1 more

Trends in mathematics•Jan 1, 2025•0 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 Reports•May 24, 2022•9 citations
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).
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.