Affiliation:
1. Tokyo University of Science, Depertment of Information Science, 8641, Yamasaki, Noda City, Chiba, Japan
Abstract
For SAT problem, which is known to be NP-complete, Ohya and Masuda found a quantum algorithm calculating a given boolean function for all truth assignments. They showed that we can decide whether this boolean function is satisfiable or not in polynomial time if a certain superposed state can be detected physically, which turns out to be related to an amplification process. Then Ohya and Volovich realized this amplification by means of chaos dynamics [4, 5]. In this paper, we study the complexity of the SAT algorithm by rigorously counting the steps of OMV algorithm discussed previously in [1, 2, 4, 5].
Publisher
World Scientific Pub Co Pte Lt
Subject
Mathematical Physics,Statistics and Probability,Statistical and Nonlinear Physics
Reference6 articles.
1. Quantum computing and the chaotic amplifier
2. New quantum algorithm for studying NP-complete problems
3. J. Franco, Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science (American Mathematical Society, 1997) pp. 19–152.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献