NP Problem in Quantum Algorithm

Authors:
Masanori Ohya;Natsuki Masuda
Affiliations:
Science University of Tokyo, Noda City, Chiba 278-8510, Japan;Science University of Tokyo, Noda City, Chiba 278-8510, Japan
Venue:
Open Systems & Information Dynamics
Year:
2000

Citing 0
Cited 5

A Stochastic Limit Approach to the SAT Problem

Open Systems & Information Dynamics
Three "quantum" algorithms to solve 3-SAT

Theoretical Computer Science
On generalized quantum turing machine and its language classes

MATH'07 Proceedings of the 11th WSEAS International Conference on Applied Mathematics
Quantum algorithm for multiple alignment of amino acid sequences

MCBC'09 Proceedings of the 10th WSEAS international conference on Mathematics and computers in biology and chemistry
Mathematical characterization of quantum algorithm

MATH'09 Proceedings of the 14th WSEAS International Conference on Applied mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In complexity theory, a famous unsolved problem is whether NP is equal to P or not. In this paper, we discuss this aspect in SAT (satisfiability) problem, and it is shown that SAT can be solved in polynomial time by means of a quantum algorithm if the superposition of two orthogonal vectors |0 and |1 prepared is detected physically.