{
  "annotation_id": "722cfbf2-06f5-4d2e-a145-f191c6b83aae",
  "date_created": "2026-03-02T18:02:41.659000Z",
  "date_modified": "2026-03-02T18:02:41.659000Z",
  "file_hash": "24c92225b25f407bc4812c37fab1d125ee9de94e97ab4079828ac15423b820c4",
  "private": false,
  "record": {
    "abstract": "If one modifies the laws of Quantum Mechanics to allow nonlinear evolution of\nquantum states, this paper shows that NP-complete problems would be efficiently\nsolvable in polynomial time with bounded probability (NP in BQP). With that\n(admittedly very unlikely) assumption, this is demonstrated by describing a\npolynomially large network of quantum gates that solves the 3SAT problem with\nbounded probability in polynomial time. As in a previous paper by Abrams and\nLloyd (but by a somewhat simpler argument), allowing nonlinearity in the laws\nof Quantum Mechanics would prove the \"weak Church-Turing thesis\" to be false.\nGeneral Relativity is suggested as a possible mechanism to supply the necessary\nnonlinearity.",
    "arxiv_id": "quant-ph/9804025",
    "authors": [
      "Phil Gossett"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "NP in BQP with Nonlinearity",
    "url": "https://arxiv.org/abs/quant-ph/9804025"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d3205d28-99b1-45cd-ab0d-1e9430535002",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}