Estimation of Complexity for the Ohya-Masuda-Volovich SAT Algorithm
نویسندگان
چکیده
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.
منابع مشابه
Generalized Quantum Turing Machine and its Application to the SAT Chaos Algorithm
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.
متن کاملOn generalized quantum Turing machine and its language classes
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 by rewriting usual quantum Turing machine in terms of channel transformation. Moreover, we define some computational classes of generalized quantum Turing machine and show that we can t...
متن کاملNp Problem in Quantum Algorithm
In complexity theory, there exists a famous unsolved problem whether NP can be P or not. In this paper, we discuss this aspect in SAT (satisfiability) problem, and it is shown that the SAT can be solved in plynomial time by means of quantum algorithm.
متن کاملOn Quantum Algorithm for Binary Search and Its Computational Complexity
A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2n objects that our algorithm runs in polynomial time.
متن کاملA New Quantum Algorithm for NP-complete Problems
An approach to the solution of NP-complete problems based on quantum computing and chaotic dynamics is proposed. We consider the satisfiability problem and argue that the problem, in principle, can be solved in polynomial time if we combine the quantum computer with the chaotic dynamics amplifier based on the logistic map. ∗To be presented at the Third International Conference on “Unconventiona...
متن کامل