{
  "annotation_id": "a31268a0-e699-4d51-85db-97523a8c861f",
  "date_created": "2026-03-02T18:01:59.611000Z",
  "date_modified": "2026-03-02T18:01:59.611000Z",
  "file_hash": "877ae88cb351147b3035a00f54b9794dafed944a6bed25074639fa21120a835d",
  "private": false,
  "record": {
    "abstract": "Because the subject of relativistic quantum field theory (QFT) contains all\nof non-relativistic quantum mechanics, we expect quantum field computation to\ncontain (non-relativistic) quantum computation. Although we do not yet have a\nquantum theory of the gravitational field, and are far from a practical\nimplementation of a quantum field computer, some pieces of the puzzle (without\ngravity) are now available. We consider a general model for computation with\nquantum field theory, and obtain some results for relativistic quantum\ncomputation. Moreover, it is possible to see new connections between principal\nmodels of computation, namely, computation over the continuum and computation\nover the integers (Turing computation). Thus we identify a basic problem in\nQFT, namely Wightman\u0027s computation problem for domains of holomorphy, which we\ncall WHOLO. Inspired by the same analytic functions which are central to the\nfamous CPT theorem of QFT, it is possible to obtain a computational complexity\nstructure for QFT and shed new light on certain complexity classes for this\nproblem WHOLO.",
    "arxiv_id": "quant-ph/0304136",
    "authors": [
      "A. C. Manoharan"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Beyond Quantum Computation and Towards Quantum Field Computation",
    "url": "https://arxiv.org/abs/quant-ph/0304136"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0d29fc63-cb02-455d-8d7a-f7e1d31793b2",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}