On Halting Process of Quantum Turing Machine

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-295095

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.