{
  "annotation_id": "25e0b602-e291-4abc-b475-b16243d8831b",
  "date_created": "2026-03-02T18:01:52.172000Z",
  "date_modified": "2026-03-02T18:01:52.172000Z",
  "file_hash": "e18defb8a5531b2b635acac707a076b5e0ca87ddd8ca3b1dbeb5737d0a19e001",
  "private": false,
  "record": {
    "abstract": "We develop a computation model for solving Boolean networks by implementing\nwires through quantum ground-mode computation and gates through identities\nfollowing from angular momentum algebra and statistics. Gates are represented\nby three-dimensional (triplet) symmetries due to particle indistinguishability\nand are identically satisfied throughout computation being constants of the\nmotion. The relaxation of the wires yields the network solutions. Such gates\ncost no computation time, which is comparable with that of an easier Boolean\nnetwork where all the gate constraints implemented as constants of the motion\nare removed. This model computation is robust with respect to decoherence and\nyields a generalized quantum speed-up for all NP problems.",
    "arxiv_id": "quant-ph/0209169",
    "authors": [
      "Giuseppe Castagnoli",
      "David Ritz Finkelstein"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum ground-mode computation with static gates",
    "url": "https://arxiv.org/abs/quant-ph/0209169"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d962eebf-e9e0-4093-a3b3-37fa18a417ba",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}