Qubit semantics and quantum trees
| dc.creator | Chiara, M. L. Dalla | |
| dc.creator | Giuntini, R. | |
| dc.creator | Leporini, R. | |
| dc.creator | Leporati, A. | |
| dc.date | 2002-11-28 | |
| dc.date | 2003-06-01 | |
| dc.date.accessioned | 2026-07-07T06:05:38Z | |
| dc.date.available | 2026-07-07T06:05:38Z | |
| dc.description | In the qubit semantics the \emph{meaning} of any sentence $α$ is represented by a \emph{quregister}: a unit vector of the $n$--fold tensor product $\otimes^n \C^2$, where $n$ depends on the number of occurrences of atomic sentences in $α$. The logic characterized by this semantics, called {\it quantum computational logic} (QCL), is {\it 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 \emph{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 $α$. | |
| dc.description | 10 pages, 2 figures | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0211190 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0211190 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/90697 | |
| dc.subject | Quantum Physics | |
| dc.title | Qubit semantics and quantum trees | |
| dc.type | text |