The 3x8 bitmap of the saptbhangi propositions can be suitably portioned to implement logic gates. The classical computing bit has either F (0) or T (1) scalar state. The quantum logic is implemented with qubits (quantum bits) of quantum states. A qubit of two basis vectors (0 1) and (1 0) includes their linear combination by quantum superposition (1 1) and interference (0 0). A qubit with n vectors can simultaneously maintain 2n states, which cuts down the number of memory swaps during a computing operation. In principle, each additional vector in a qubit increases the computing speed by 2-fold. Superposition of the basis vectors permits reversibility of quantum logic operations that conserves information. A family of reversible and conservative gates are generated from n+1 bit inputs for n valued logics.

Ancient roots and assumptions of the Jain Nyay
Quantum logic and computing
Doubt is a necessity
Paradox of binary T or F