首页 | 本学科首页   官方微博 | 高级检索  
     


Qubit Semantics and Quantum Trees
Authors:Maria?Luisa?Dalla?Chiara  author-information"  >  author-information__contact u-icon-before"  >  mailto:dallachiara@unifi.it"   title="  dallachiara@unifi.it"   itemprop="  email"   data-track="  click"   data-track-action="  Email author"   data-track-label="  "  >Email author,Roberto?Giuntini,Alberto?Leporati,Roberto?Leporini
Affiliation:(1) Dipartimento di Filosofia, Università di Firenze, Firenze, Italy;(2) Dipartimento di Scienze Pedagogiche e Filosofiche, Università di Cagliari, Cagliari, Italy;(3) Dipartimento di Informatica, Sistemistica e Comunicazione (DISCo), Università degli Studi di Milano, Bicocca, Milano, Italy;(4) Dipartimento di Filosofia, Università di Firenze, Via Bolognese 52, 50139 Firenze, Italy
Abstract:In the qubit semantics the meaning of any sentence α is represented by a quregister: a unit vector of the n–fold tensor product ⊗n2, where n depends on the number of occurrences of atomic sentences in α (see Cattaneo et al.). 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 α can be regarded as a quantum circuit that transforms the quregister associated to the occurrences of atomic subformulas of α into the quregister associated to α.
Keywords:quantum computation  quantum logic
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号