  Watson-Crick quantum finite automata were introduced by Ganguly et.al. by
combining properties of DNA and Quantum automata. In this paper we introduce a
multi-head version of the above automaton. We further show that the multi-head
variant is computationally more powerful than one-way multi-head reversible
finite automata. In fact we also show that the multi-head variant accepts a
language which is not accepted by any one-way multi-head deterministic finite
automata.
