NP problem in quantum algorithm

Details NP problem in quantum algorithm NP problem in quantum algorithm

1998-09-24

arxiv.org/abs/quant-ph/9809075v2

OpenSyst.Info.Dyn.7:33-39,2000

Physics

Quantum Physics

8 pages, 1 figure, Latex2e

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

NP problem in quantum algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with NP problem in quantum algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and NP problem in quantum algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-709104