|Subjects (previous Academic Years):|
|91054||Computer Security||Sicurezza dei sistemi informatici|
|6626||Networks and Network Issues (1 module)||Reti e problematiche di rete (1 modulo)|
|6625||Networks and Network Issues (2 modules)||Reti e problematiche di rete (2 moduli)|
|6614||Networks and Network Issues (3 modules)||Reti e problematiche di rete (3 moduli)|
In the qubit semantics the meaning of any sentence is represented by a quregister : a unit vector of the n-fold tensor product, where n depends on the number of occurrences of atomic sentences in a formula. The logic characterized by this semantics, called quantum computational logic (QCL), is unsharp, because the noncontradiction 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 a formula can be regarded as a quantum circuit that transforms the quregister associated to the occurrences of atomic subformulas of the formula into the quregister associated to the formula.