Basic Logic and Quantum Entanglement
| dc.creator | Zizzi, Paola | |
| dc.date | 2006-11-10 | |
| dc.date | 2007-02-05 | |
| dc.date.accessioned | 2026-07-07T10:43:02Z | |
| dc.date.available | 2026-07-07T10:43:02Z | |
| dc.description | As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up. In a sense, quantum entanglement is considered as an implicit property of quantum computation itself. But...can it be made explicit? In other words, is it possible to find the connective "entanglement" in a logical sequent calculus for the machine language? And also, is it possible to "teach" the quantum computer to "mimic" the EPR "paradox"? The answer is in the affirmative, if the logical sequent calculus is that of the weakest possible logic, namely Basic logic. A weak logic has few structural rules. But in logic, a weak structure leaves more room for connectives (for example the connective "entanglement"). Furthermore, the absence in Basic logic of the two structural rules of contraction and weakening corresponds to the validity of the no-cloning and no-erase theorems, respectively, in quantum computing. | |
| dc.description | 10 pages, 1 figure,LaTeX. Shorter version for proceedings requirements. Contributed paper at DICE2006, Piombino, Italy | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0611119 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0611119 | |
| dc.identifier | J.Phys.Conf.Ser.67:012045,2007 | |
| dc.identifier | doi:10.1088/1742-6596/67/1/012045 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/182159 | |
| dc.subject | Quantum Physics | |
| dc.subject | High Energy Physics - Theory | |
| dc.subject | Logic | |
| dc.title | Basic Logic and Quantum Entanglement | |
| dc.type | text |