Estimation of Complexity for the Ohya-Masuda-Volovich SAT Algorithm

Details Estimation of Complexity for the Ohya-Masuda-Volovich SAT Algorithm Estimation of Complexity for the Ohya-Masuda-Volovich SAT Algorithm

2003-12-09

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

Physics

Quantum Physics

Scientific paper

Ohya and Volovich have been proposed a new quantum computation model with chaos amplification to solve the SAT problem, which went beyond usual quantum algorithm. In this paper we study the complexity of the SAT algorithm by counting the steps of computation algorithm rigorously, which was mentioned in the paper [1,2,3,5,7]For this purpose, we refine the quantum gates treating the SAT problem step by step.

Affiliated with

Also associated with

No associations

Rating

Estimation of Complexity for the Ohya-Masuda-Volovich SAT 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 Estimation of Complexity for the Ohya-Masuda-Volovich SAT Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Estimation of Complexity for the Ohya-Masuda-Volovich SAT Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-41633