Quantum computation and quantum computational logics are intrinsically connected with some puzzling epistemic problems. In the framework of a quantum computational approach to epistemic logic we investigate the following question: is it possible to i

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.