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.

Logical structures underlying quantum computing

Holik, Federico;Sergioli, Giuseppe;Freytes, Hector;
2019-01-01

Abstract

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.
2019
Non-kolmogorovian probability; Quantum computational gates; Quantum computing; Physics and Astronomy (all)
File in questo prodotto:
File Dimensione Formato  
entropy-21-00077.pdf

accesso aperto

Tipologia: versione editoriale
Dimensione 258.92 kB
Formato Adobe PDF
258.92 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11584/264967
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 5
social impact