NP problem in quantum algorithm

Simple item page
dc.creatorOhya, Masanori
dc.creatorMasuda, Natsuki
dc.date1998-09-24
dc.date1998-12-13
dc.date.accessioned2026-07-07T10:55:08Z
dc.date.available2026-07-07T10:55:08Z
dc.descriptionIn 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.
dc.description8 pages, 1 figure, Latex2e
dc.identifierhttps://arxiv.org/abs/quant-ph/9809075
dc.identifierhttp://arxiv.org/abs/quant-ph/9809075
dc.identifierOpenSyst.Info.Dyn.7:33-39,2000
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/186021
dc.subjectQuantum Physics
dc.titleNP problem in quantum algorithm
dc.typetext

Files

Collections

arXiv