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.
Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Questionnaire and social

Share on:
Impostazioni cookie