Reversibility and irreversibility in quantum computation and in quantum computational logics

A characteristic feature of quantum computation is the use of reversible logical operations. These correspond to quantum logical gates that are mathematically represented by unitary operators defined on convenient Hilbert spaces. Two questions arise: 1) to what extent is quantum computation bound to the use of reversible logical operations? 2) How to identify the logical operations that admit a quantum computational simulation by means of appropriate gates? We introduce the notion of quantum computational simulation of a binary function defined on the real interval [0, 1], and we prove that for any binary Boolean function there exists a unique fuzzy extension admitting a quantum computational simulation. As a consequence, the Lukasiewicz conjunction and disjunction do not admit a quantum computational simulation.