Discrimination against or in favor of qubits in quantum theory

Abstract

Within context of quantum logic, it is possible to assign dispersion-free probabilities to experimental propositions pertaining to qubits. This makes qubits distinct from the rest of quantum systems since the latter do not admit probabilities having only values 0 and 1. The present paper shows that erasing qubit discrimination leads to a model of computation which permits execution of many primitive operations in a massive parallel way. In the paper, it is demonstrated that such a model (that can be called a quantum parallel random-access machine, QPRAM) is quantum mechanically plausible.