NP problem in quantum algorithm
classification
🪐 quant-ph
keywords
problemalgorithmquantumaspectcomplexitydiscussexistsfamous
read the original abstract
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.
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.