In this paper we solve the problem how to axiomatize a system of quantum computational gates known as the Poincar´e irreversible quantum computational system. A Hilbert-style calculus is introduced obtaining a strong completeness theorem.
Quantum computational logic with mixed states
FREYTES, HECTOR CARLOS;
2013-01-01
Abstract
In this paper we solve the problem how to axiomatize a system of quantum computational gates known as the Poincar´e irreversible quantum computational system. A Hilbert-style calculus is introduced obtaining a strong completeness theorem.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I metadati presenti in IRIS UNICA sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono protetti da diritto d'autore, salvo diversa indicazione.
