Binary Gates in Three Valued Quantum Computational Logics

Abstract

The standard theory of quantum computation relies on the idea that the qubit-the basic information quantity-is represented by a superposition of elements of the standard quantum computational basis B (2) = {|0 , |1 }. In the present paper we focus on the case of qutrits where the standard quantum computational bases is replaced by a three-valued computational basis B (3) = {|0 , | 1 2 , |1 }. Recently in [13], unary gates on the Hilbert space C 3 were considered. In this work we propose an extensive method that allows to extend binary gates to the framework of qutrits.

Quantum probability: a reliable tool for an agent or a reliable source of reality?

“…The theory of Quantum Computation has naturally inspired new forms of quantum logic, such as the so called Quantum Computational Logic (QCL) [10,57]. From a semantic point of view, any formula of the language in QCL denotes a piece of quantum information, i.e.…”