{
  "annotation_id": "fcbb3012-08fb-4205-b484-724d24fa04d9",
  "date_created": "2026-03-02T18:02:03.583000Z",
  "date_modified": "2026-03-02T18:02:03.583000Z",
  "file_hash": "d2c303f9fbed7524894fd80d128c366ea1ea62ea0dca08fd0e6f4d7694192020",
  "private": false,
  "record": {
    "abstract": "Quantum computation with quantum data that can traverse closed timelike\ncurves represents a new physical model of computation. We argue that a model of\nquantum computation in the presence of closed timelike curves can be formulated\nwhich represents a valid quantification of resources given the ability to\nconstruct compact regions of closed timelike curves. The notion of\nself-consistent evolution for quantum computers whose components follow closed\ntimelike curves, as pointed out by Deutsch [Phys. Rev. D {\\bf 44}, 3197\n(1991)], implies that the evolution of the chronology respecting components\nwhich interact with the closed timelike curve components is nonlinear. We\ndemonstrate that this nonlinearity can be used to efficiently solve\ncomputational problems which are generally thought to be intractable. In\nparticular we demonstrate that a quantum computer which has access to closed\ntimelike curve qubits can solve NP-complete problems with only a polynomial\nnumber of quantum gates.",
    "arxiv_id": "quant-ph/0309189",
    "authors": [
      "Dave Bacon"
    ],
    "categories": [
      "quant-ph",
      "gr-qc"
    ],
    "doi": "10.1103/PhysRevA.70.032309",
    "journal_ref": "Phys.Rev.A70:032309,2004",
    "title": "Quantum Computational Complexity in the Presence of Closed Timelike   Curves",
    "url": "https://arxiv.org/abs/quant-ph/0309189"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2e2b0da2-0b52-4175-abcb-407cf77d52fa",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}