Estimation of Complexity for the Ohya-Masuda-Volovich SAT Algorithm
classification
🪐 quant-ph
keywords
algorithmquantumcomplexitycomputationproblemstepamplificationbeen
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.