Generalized Quantum Turing Machine and its Application to the SAT Chaos Algorithm

Details Generalized Quantum Turing Machine and its Application to the SAT Chaos Algorithm Generalized Quantum Turing Machine and its Application to the SAT Chaos Algorithm

2004-05-31

arxiv.org/abs/quant-ph/0405191v1

Physics

Quantum Physics

19 pages

Scientific paper

Ohya and Volovich have proposed a new quantum computation model with chaotic
amplification to solve the SAT problem, which went beyond usual quantum
algorithm. In this paper, we generalize quantum Turing machine, and we show in
this general quantum Turing machine (GQTM) that we can treat the Ohya-Volovich
(OV) SAT algorithm.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-368731