{
  "annotation_id": "c99c3784-ccc9-45c6-aa71-d3dc3b3dcc3d",
  "date_created": "2026-03-02T18:01:45.134000Z",
  "date_modified": "2026-03-02T18:01:45.134000Z",
  "file_hash": "800144390ad28407a0b1d451118cd0a8b4fe243220c1280836e8d3a546f45539",
  "private": false,
  "record": {
    "abstract": "It is indicated that principal models of computation are indeed significantly\nrelated. The quantum field computation model contains the quantum computation\nmodel of Feynman. (The term \"quantum field computer\" was used by Freedman.)\nQuantum field computation (as enhanced by Wightman\u0027s model of quantum field\ntheory) involves computation over the continuum which is remarkably related to\nthe real computation model of Smale. The latter model was established as a\ngeneralization of Turing computation. All this is not surprising since it is\nwell known that the physics of quantum field theory (which includes Einstein\u0027s\nspecial relativity) contains quantum mechanics which in turn contains classical\nmechanics. The unity of these computing models, which seem to have grown\nlargely independently, could shed new light into questions of computational\ncomplexity, into the central P (Polynomial time) versus NP (Non-deterministic\nPolynomial time) problem of computer science, and also into the description of\nNature by fundamental physics theories.",
    "arxiv_id": "quant-ph/0109015",
    "authors": [
      "A. C. Manoharan"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "The unity between quantum field computation, real computation, and   quantum computation",
    "url": "https://arxiv.org/abs/quant-ph/0109015"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e9324a47-808e-4016-bd7f-d57c1a58fcd4",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}