NP problem in quantum algorithm
量子物理
2008-11-26 v2
摘要
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.
引用
@article{arxiv.quant-ph/9809075,
title = {NP problem in quantum algorithm},
author = {Masanori Ohya and Natsuki Masuda},
journal= {arXiv preprint arXiv:quant-ph/9809075},
year = {2008}
}
评论
8 pages, 1 figure, Latex2e