We develop a synthesis of Turing’s paradigm of computation and von Neumann’s quantum logic to serve as a model for quantum computation with recursion, such that potentially non-terminating computation can take place, as in a quantum Turing machine. This model is based on the extension of von Neumann’s quantum logic to partial states, defined here as sub-probability measures on the Hilbert space...

In this paper, we obtain some matrix inequalities in Löwner partial ordering for Khatri-Rao products of positive semidefinite Hermitian matrices. Furthermore, we generalize the Oppenheim’s inequality, with which we will improve some recent results.

We study the natural partial ordering in the set of all tripotents of a real JB∗-triple. We prove some characterizations of real-minimal tripotents and an atomic deocmpostion theorem for real JBW∗-triples is given.