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 documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
