NP problem in quantum algorithm
Masanori Ohya, Natsuki Masuda
TL;DR
This paper explores the potential of quantum algorithms to solve NP problems, specifically SAT, in polynomial time, challenging traditional complexity theory assumptions.
Contribution
It demonstrates that SAT can be solved in polynomial time using quantum algorithms, offering a novel approach to NP problems.
Findings
SAT solvable in polynomial time with quantum algorithms
Quantum approach challenges classical NP complexity assumptions
Potential for quantum algorithms to revolutionize problem-solving in NP class
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Computability, Logic, AI Algorithms