  We prove that there is no algorithm to tell whether an arbitrarily
constructed Quantum Turing Machine has same time steps for different branches
of computation. We, hence, can not avoid the notion of halting to be
probabilistic in Quantum Turing Machine. Our result suggests that halting
scheme of Quantum Turing Machine and quantum complexity theory based upon the
existing halting scheme sholud be reexamined.
