On Quantum Turing Machine Halting Deterministically

Details On Quantum Turing Machine Halting Deterministically On Quantum Turing Machine Halting Deterministically

2012-02-29

arxiv.org/abs/1202.6530v1

Physics

Quantum Physics

13 pages, 7 figures

Scientific paper

We define a subclass of quantum Turing machine (QTM) named SR-QTM, which halts deterministically and has deterministic tape head position. A quantum state transition diagram (QSTD) is proposed to describe SR-QTM. With the help of QSTD, we construct a SR-QTM which is universal for all near-trivial transformations. This means there exists a QTM which is universal for the above subclass. Finally we prove that SR-QTM is computational equivalent with ordinary QTM in the bounded error setting. It can be seen that, because SR-QTM has the same time steps for different branches of computation, the halting scheme problem will not exist when considering SR-QTM as a model of quantum computing.

Affiliated with

Also associated with

No associations

Rating

On Quantum Turing Machine Halting Deterministically 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 Quantum Turing Machine Halting Deterministically, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Quantum Turing Machine Halting Deterministically will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-524154