In this work we advance a generalization of quantum computational logics capable of dealing with some important examples of quantum algorithms. We outline an algebraic axiomatization of these structures.
Keywords: non-kolmogorovian probability; quantum computational gates; quantum computing.