dorsal/arxiv
View SchemaQuantum Computational Logics. A Survey
| Authors | M. L. Dalla Chiara, R. Giuntini, R. Leporini |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0305029 |
| URL | https://arxiv.org/abs/quant-ph/0305029 |
Abstract
Quantum 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.
{
"annotation_id": "49775020-f8d6-45aa-b547-fea874a69369",
"date_created": "2026-03-02T18:01:58.933000Z",
"date_modified": "2026-03-02T18:01:58.933000Z",
"file_hash": "2fa8860c6e69edab61fb4b2d2bada95f7707cea55a1ee89926656a4a5e3d52d3",
"private": false,
"record": {
"abstract": "Quantum computation has suggested new forms of quantum logic, called quantum\ncomputational logics. The basic semantic idea is the following: the meaning of\na sentence is identified with a quregister, a system of qubits, representing a\npossible pure state of a compound quantum system. The generalization to mixed\nstates, which might be useful to analyse entanglement-phenomena, is due to\nGudder. Quantum computational logics represent non standard examples of unsharp\nquantum logic, where the non-contradiction principle is violated, while\nconjunctions and disjunctions are strongly non-idempotent. In this framework,\nany sentence of the language gives rise to a quantum tree: a kind of quantum\ncircuit that transforms the quregister associated to the atomic subformulas of\nthe sentence into the quregister associated to the sentence.",
"arxiv_id": "quant-ph/0305029",
"authors": [
"M. L. Dalla Chiara",
"R. Giuntini",
"R. Leporini"
],
"categories": [
"quant-ph"
],
"title": "Quantum Computational Logics. A Survey",
"url": "https://arxiv.org/abs/quant-ph/0305029"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "e5cc94e0-3731-43de-b23a-0be6cf0d24cf",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}