Quantum Computational Logics. A Survey

Simple item page
dc.creatorChiara, M. L. Dalla
dc.creatorGiuntini, R.
dc.creatorLeporini, R.
dc.date2003-05-06
dc.date.accessioned2026-07-07T06:06:42Z
dc.date.available2026-07-07T06:06:42Z
dc.descriptionQuantum computation has suggested new forms of quantum logic, called quantum computational logics. The basic semantic idea is the following: the meaning of a sentence is identified with a quregister, a system of qubits, representing a possible pure state of a compound quantum system. The generalization to mixed states, which might be useful to analyse entanglement-phenomena, is due to Gudder. Quantum computational logics represent non standard examples of unsharp quantum logic, where the non-contradiction principle is violated, while conjunctions and disjunctions are strongly non-idempotent. In this framework, any sentence of the language gives rise to a quantum tree: a kind of quantum circuit that transforms the quregister associated to the atomic subformulas of the sentence into the quregister associated to the sentence.
dc.description35 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/0305029
dc.identifierhttp://arxiv.org/abs/quant-ph/0305029
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91071
dc.subjectQuantum Physics
dc.titleQuantum Computational Logics. A Survey
dc.typetext

Files

Collections

arXiv