Ohya-Masuda-Volovich SAT算法的复杂度估计
Estimation of Complexity for the Ohya-Masuda-Volovich SAT Algorithm
摘要：
Ohya和Volovich提出了一种新的基于混沌放大的量子计算模型来解决SAT问题，这是一种超越常规量子算法的新方法。本文通过严格统计计算算法的步骤来研究SAT算法的复杂性，正如文献[1，2，3，5，7]中所提到的那样。为此，我们对处理SAT问题的量子门进行了逐步细化。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
