{
  "id": "quant-ph/9809075",
  "version": "v2",
  "published": "1998-09-24T12:05:56.000Z",
  "updated": "1998-12-13T09:09:23.000Z",
  "title": "NP problem in quantum algorithm",
  "authors": [
    "Masanori Ohya",
    "Natsuki Masuda"
  ],
  "comment": "8 pages, 1 figure, Latex2e",
  "journal": "OpenSyst.Info.Dyn.7:33-39,2000",
  "categories": [
    "quant-ph"
  ],
  "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.",
  "revisions": [
    {
      "version": "v2",
      "updated": "1998-12-13T09:09:23.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "quantum algorithm",
      "np problem",
      "complexity theory",
      "plynomial time"
    ],
    "tags": [
      "journal article"
    ],
    "publication": {
      "doi": "10.1023/A:1009651417615"
    },
    "note": {
      "typesetting": "LaTeX",
      "pages": 8,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "inspire": 476835,
      "adsabs": "1998quant.ph..9075O"
    }
  }
}