Masanori Ohya, Natsuki Masuda
Published 1998-09-24, updated 1998-12-13Version 2
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.
Comments: 8 pages, 1 figure, Latex2e
Journal: OpenSyst.Info.Dyn.7:33-39,2000
Quantum algorithm for exact Monte Carlo sampling
Calculating Unknown Eigenvalues with a Quantum Algorithm
Programmable networks for quantum algorithms
