Skip to content

Qubit semantics and quantum trees

M. L. Dalla Chiara, R. Giuntini, R. Leporini, A. Leporati

quant-pharXiv:quant-ph/0211190

Abstract

In the qubit semantics the meaning of any sentence α is represented by a quregister: a unit vector of the n--fold tensor product n 2, where n depends on the number of occurrences of atomic sentences in α. The logic characterized by this semantics, called quantum computational logic (QCL), is unsharp, because the non-contradiction principle is violated. We show that QCL does not admit any logical truth. In this framework, any sentence α gives rise to a quantum tree, consisting of a sequence of unitary operators. The quantum tree of α can be regarded as a quantum circuit that transforms the quregister associated to the atomic subformulas of α into the quregster associated to α.

Create a lesson