Physics – Quantum Physics
Scientific paper
2003-02-07
Open Systems and Information Dynamics, Vol.12, No.3 261-264 (2005).
Physics
Quantum Physics
2 pages
Scientific paper
10.1007/s11080-005-0923-2
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.
Miyadera Takayuki
Ohya Masanori
No associations
LandOfFree
On Halting Process of Quantum Turing Machine does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On Halting Process of Quantum Turing Machine, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Halting Process of Quantum Turing Machine will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-295095