{
  "annotation_id": "43694c45-edcc-4e3d-aded-364c28698ae8",
  "date_created": "2026-03-02T18:01:52.159000Z",
  "date_modified": "2026-03-02T18:01:52.159000Z",
  "file_hash": "2e2ba43f0f7c293ed8b50f1037b433fcf9a9e6788399764c413d5628c9868fe1",
  "private": false,
  "record": {
    "abstract": "We develop a computation model for solving Boolean networks that implements\nwires through quantum ground-state computation and implements gates through\nidentities following from angular momentum algebra and statistics. The gates\nare static in the sense that they contribute Hamiltonian 0 and hold as\nconstants of the motion; only the wires are dynamic. Just as a spin 1/2 makes\nan ideal 1-bit memory element, a spin 1 makes an ideal 3-bit gate. Such gates\ncost no computation time: relaxing the wires alone solves the network. We\ncompare computation time with that of an easier Boolean network where all the\ngate constraints are simply removed. This computation model is robust with\nrespect to decoherence and yields a generalized quantum speed-up for all NP\nproblems.",
    "arxiv_id": "quant-ph/0209084",
    "authors": [
      "Giuseppe Castagnoli",
      "David Ritz Finkelstein"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum ground-state computation with static gates",
    "url": "https://arxiv.org/abs/quant-ph/0209084"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ce079468-e420-4c7a-8e6f-8cfcd7446406",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}