On Halting Process of Quantum Turing Machine
Takayuki Miyadera, Masanori Ohya · Open Systems & Information Dynamics · 2005
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, cannot avoid the notion of halting to be probabilistic in Quantum Turing Machine.