We extend the basic principles and results of conservative logic to include the main features of many-valued logics with a finite number of truth values. Different approaches to many-valued logics are examined in order to determine some possible functionally complete sets of logic connectives. As a result, we describe some possible finite-valued gates which realize a functionally complete set of fundamental connectives. One of the purposes of this work is to show that the framework of reversible and conservative computation can be extended toward some non-classical reasoning environments, originally proposed to deal with propositions which embed imprecise and/or uncertain information, that are usually based upon many-valued and modal logics. We also describe a possible quantum realization of the proposed gates, using creation and annihilation operators. In such realization the gates are expressed as formulas that are obtained using three techniques: a brute force technique, an extension of the conditional quantum control method introduced by Barenco, Deutsch, Ekert and Jozsa, and a new technique that we call the Constants method. We show the Constants method allows one to reduce the number of local operators in the formulas which correspond to the proposed gates.

(2008). Quantum conservative many-valued computing [journal article - articolo]. In FUZZY SETS AND SYSTEMS. Retrieved from http://hdl.handle.net/10446/21638

Quantum conservative many-valued computing

Leporini, Roberto;
2008-01-01

Abstract

We extend the basic principles and results of conservative logic to include the main features of many-valued logics with a finite number of truth values. Different approaches to many-valued logics are examined in order to determine some possible functionally complete sets of logic connectives. As a result, we describe some possible finite-valued gates which realize a functionally complete set of fundamental connectives. One of the purposes of this work is to show that the framework of reversible and conservative computation can be extended toward some non-classical reasoning environments, originally proposed to deal with propositions which embed imprecise and/or uncertain information, that are usually based upon many-valued and modal logics. We also describe a possible quantum realization of the proposed gates, using creation and annihilation operators. In such realization the gates are expressed as formulas that are obtained using three techniques: a brute force technique, an extension of the conditional quantum control method introduced by Barenco, Deutsch, Ekert and Jozsa, and a new technique that we call the Constants method. We show the Constants method allows one to reduce the number of local operators in the formulas which correspond to the proposed gates.
articolo
2008
Leporini, Roberto; Leporati, Alberto; Cattaneo, Gianpiero
(2008). Quantum conservative many-valued computing [journal article - articolo]. In FUZZY SETS AND SYSTEMS. Retrieved from http://hdl.handle.net/10446/21638
File allegato/i alla scheda:
File Dimensione del file Formato  
Quantum conservative many-valued computing.pdf

Solo gestori di archivio

Versione: publisher's version - versione editoriale
Licenza: Licenza default Aisberg
Dimensione del file 327 kB
Formato Adobe PDF
327 kB Adobe PDF   Visualizza/Apri
Pubblicazioni consigliate

Aisberg ©2008 Servizi bibliotecari, Università degli studi di Bergamo | Terms of use/Condizioni di utilizzo

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10446/21638
Citazioni
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 2
social impact