Quantum-Inspired Applications for Classification Problems.

In the context of quantum-inspired machine learning, quantum state discrimination is a useful tool for classification problems. We implement a local approach combining the k-nearest neighbors algorithm with some quantum-inspired classifiers. We compare the performance with respect to well-known classifiers applied to benchmark datasets.

An efficient geometric approach to quantum-inspired classifications.

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.

Quantum Uncertainties and Holism Seem to Render Irrelevant Qudit-Semantics.

We consider a semantics based on the peculiar holistic features of the quantum formalism. Any formula of the language gives rise to a quantum circuit that transforms the density operator associated to the formula into the density operator associated to the atomic subformulas in a reversible way. The procedure goes from the whole to the parts against the compositionality-principle and gives rise to a semantic characterization for a new form of quantum logic that has been called "Łukasiewicz quantum computational logic".

Probabilities and Epistemic Operations in the Logics of Quantum Computation.

Quantum computation theory has inspired new forms of quantum logic, called , where formulas are supposed to denote pieces of quantum information, while logical connectives are interpreted as special examples of quantum logical gates. The most natural semantics for these logics is a form of , where meanings behave in a contextual way. In this framework, the concept of can assume different forms.

Quantum information, cognition, and music.

Parallelism represents an essential aspect of human mind/brain activities. One can recognize some common features between psychological parallelism and the characteristic parallel structures that arise in quantum theory and in quantum computation. The article is devoted to a discussion of the following questions: a comparison between classical probabilistic Turing machines and quantum Turing machines.