dorsal/arxiv
View SchemaNP problem in quantum algorithm
| Authors | Masanori Ohya, Natsuki Masuda |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/9809075 |
| URL | https://arxiv.org/abs/quant-ph/9809075 |
| Journal | OpenSyst.Info.Dyn.7:33-39,2000 |
Abstract
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.
{
"annotation_id": "11b38552-63e8-4c0f-a6bf-f568fc5919f9",
"date_created": "2026-03-02T18:02:44.642000Z",
"date_modified": "2026-03-02T18:02:44.642000Z",
"file_hash": "2e6848a4ce0a90357af431f22535ac705efab643bf9dccc203869be09626e04f",
"private": false,
"record": {
"abstract": "In complexity theory, there exists a famous unsolved problem whether NP can\nbe P or not. In this paper, we discuss this aspect in SAT (satisfiability)\nproblem, and it is shown that the SAT can be solved in plynomial time by means\nof quantum algorithm.",
"arxiv_id": "quant-ph/9809075",
"authors": [
"Masanori Ohya",
"Natsuki Masuda"
],
"categories": [
"quant-ph"
],
"journal_ref": "OpenSyst.Info.Dyn.7:33-39,2000",
"title": "NP problem in quantum algorithm",
"url": "https://arxiv.org/abs/quant-ph/9809075"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "34b7a730-bb28-4b06-8bb2-e1a199075927",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}