The objective of this paper is to propose a feasible computational framework based on quantum logic. The usual quantum logic-based computational processes easily get stuck. The difficulty with the computation is ascribed to the difference in the inference rules for quantum and classical negations. It is shown that the new inference rule for negation which is akin to the classical one is partially applicable even to the quantum case. The resulting framework makes it possible to go beyond what the usual quantum logic-based computation could do.