In this paper we attempt to analyze the concept of quantum probability within quantum computation and quantum computational logic. While the subjectivist interpretation of quantum probability explains it as a reliable predictive tool for an agent in order to compute measurement outcomes, the objectivist interpretation understands quantum probability as providing reliable information of a real state of affairs. After discussing these different viewpoints we propose a particular objectivist interpretation grounded on the idea that the Born rule provides information about an (...) intensive realm of reality. We then turn our attention to the way in which the subjectivist interpretation of probability is presently applied within both quantum computation and quantum computational logic. Taking as a standpoint our proposed intensive account of quantum probability we discuss the possibilities and advantages it might open for the modeling and development of both quantum computation and quantum computational logic. (shrink)

We investigate the hypothesis that within a combination of a ‘number concept’ plus a ‘substantive concept’, such as ‘eleven animals’, the identity and indistinguishability present on the level of the concepts, i.e., all eleven animals are identical and indistinguishable, gives rise to a statistical structure of the Bose–Einstein type similar to how Bose–Einstein statistics is present for identical and indistinguishable quantum particles. We proceed by identifying evidence for this hypothesis by extracting the statistical data from the World-Wide-Web utilizing the Google (...) Search tool. By using the Kullback–Leibler divergence method, we then compare the obtained distribution with the Maxwell–Boltzmann as well as with the Bose–Einstein distributions and show that the Bose–Einstein’s provides a better fit as compared to the Maxwell–Boltzmann’s. (shrink)

We show that data collected from corpuses of documents violate the Clauser-Horne-Shimony-Holt version of Bell’s inequality and therefore indicate the presence of quantum entanglement in their structure. We obtain this result by considering two concepts and their combination and coincidence operations consisting of searches of co-occurrences of exemplars of these concepts in specific corpuses of documents. Measuring the frequencies of these co-occurrences and calculating the relative frequencies as approximate probabilities entering in the CHSH inequality, we obtain manifest violations of the (...) latter for all considered corpuses of documents. In comparing these violations with those analogously obtained in an earlier work for the same combined concepts in psychological coincidence experiments with human participants, also violating the CHSH inequality, we identify the entanglement as being carried by the meaning connection between the two considered concepts within the combination they form. We explain the stronger violation for the corpuses of documents, as compared to the violation in the psychology experiments, as being due to the superior meaning domain of the human mind and, on the other side, to the latter reaching a broader domain of meaning and being possibly also actively influenced during the experimentation. We mention some of the issues to be analyzed in future work such as the violations of the CHSH inequality being larger than the ‘Cirel’son bound’ for all of the considered corpuses of documents. (shrink)

The theory of logical gates in quantum computation has inspired the development of new forms of quantum logic where the meaning of a formula is identified with a density operator and the logical connectives are interpreted as operations defined in terms of quantum gates. We show some relations between the Bertini gate and many valued connectives by probability values. On this basis, one can deal with quantum circuits as expressions in an algebraic environment such as product many valued algebra for (...) combinational circuits. As can be expected, we show that the compositional logic characterized by the qubit semantics is stronger than the compositional Łukasiewicz quantum computational logic by a counterexample. But, in the holistic case, we conjecture that they can characterize the same logic. (shrink)

Unlike the standard Quantum Computational Logic, where the carrier of information is conventionally assumed to be only the last qubit over a sequence of many qubits, here we propose an extended version of the QCL where the number and the position of the target qubits are arbitrary.