{
  "annotation_id": "390ba4ac-2249-48ac-a6c0-432049938adb",
  "date_created": "2026-03-02T18:02:41.596000Z",
  "date_modified": "2026-03-02T18:02:41.596000Z",
  "file_hash": "70f290c52e03a4316d915f59ab549aae6fda6cbe6f848dc9df218f8900942e42",
  "private": false,
  "record": {
    "abstract": "If quantum states exhibit small nonlinearities during time evolution, then\nquantum computers can be used to solve NP-complete problems in polynomial time.\nWe provide algorithms that solve NP-complete and #P oracle problems by\nexploiting nonlinear quantum logic gates. It is argued that virtually any\ndeterministic nonlinear quantum theory will include such gates, and the method\nis explicitly demonstrated using the Weinberg model of nonlinear quantum\nmechanics.",
    "arxiv_id": "quant-ph/9801041",
    "authors": [
      "Daniel S. Abrams",
      "Seth Lloyd"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.81.3992",
    "journal_ref": "Phys.Rev.Lett. 81 (1998) 3992-3995",
    "title": "Nonlinear quantum mechanics implies polynomial-time solution for   NP-complete and #P problems",
    "url": "https://arxiv.org/abs/quant-ph/9801041"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "60d54187-cf8d-4393-adc9-45ca77d85396",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}