Home  /  Entropy  /  Vol: 21 Núm: 1 Par: January (2019)  /  Article
ARTICLE
TITLE

Logical Structures Underlying Quantum Computing

SUMMARY

In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.

 Articles related

Piyanuch Silapachote,Ananta Srisuphab    

Computational thinking sits at the core of every engineering and computing related discipline. It has increasingly emerged as its own subject in all levels of education. It is a powerful cornerstone for cognitive development, creative problem solving, al... see more


Dariel Mena Méndez, Enma Fernández Arner, Yamilet Ferrán Fernández    

The examination from a hermeneutic, systemic, and reflective view of the public symbolic production of island society in Cuba, during the Republican period, 40 and 50 decades of the 20th century, accuses the relevance of the historiography of communicati... see more


Maciej Brodowicz,Thomas Sterling    

With nano-scale technology and Moore's Law end, architecture advance serves as the principal means of achieving enhanced efficiency and scalability into the exascale era. Ironically, the field that has demonstrated the greatest leaps of technology in the... see more


Danuta Roszko    

Semantic contrastive linguistics theory and dialectological studiesTheoretical contrastive studies (hereinafter referred to as TCS) emerged with a view to compare and contrast natural languages on the basis of a logical interlanguage. The idea of making ... see more


Violetta Koseska-Toszewa    

Form, its meaning, and dictionary entriesAs we know, a language form is a unit which plays a specific form in the language, e.g. a semantic or syntactical one. We establish the function of a form based on its use (occurrence), i.e. its relation... see more