10.1023/a:1009651417615
doi
pub.1012766077
dimensions_id
2019-04-10T14:02
NP Problem in Quantum Algorithm
https://scigraph.springernature.com/explorer/license/
http://link.springer.com/10.1023/A:1009651417615
2000-03
research_article
en
articles
false
2000-03-01
33-39
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.
Natsuki
Masuda
1573-1324
1230-1612
Open Systems and Information Dynamics
readcube_id
3cd0d6ff7644f12b90ae2e4d4057749b01d77757be976032dd93ce5722d543fb
Computation Theory and Mathematics
1
Science University of Tokyo, 278-8510, Noda City, Chiba, Japan
Tokyo University of Science
7
Ohya
Masanori
Springer Nature - SN SciGraph project
Information and Computing Sciences