{
  "annotation_id": "712f7781-1a4e-4c17-beff-bf38c1109f86",
  "date_created": "2026-03-02T18:02:06.637000Z",
  "date_modified": "2026-03-02T18:02:06.637000Z",
  "file_hash": "4308e002681594eeaffa8adcea6d00aec2a546badfafeb3ab239bfe670c5d08d",
  "private": false,
  "record": {
    "abstract": "Ohya and Volovich have proposed a new quantum computation model with chaotic\namplification to solve the SAT problem, which went beyond usual quantum\nalgorithm. In this paper, we generalize quantum Turing machine, and we show in\nthis general quantum Turing machine (GQTM) that we can treat the Ohya-Volovich\n(OV) SAT algorithm.",
    "arxiv_id": "quant-ph/0405191",
    "authors": [
      "Satoshi Iriyama",
      "Masanori Ohya",
      "Igor Volovich"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Generalized Quantum Turing Machine and its Application to the SAT Chaos   Algorithm",
    "url": "https://arxiv.org/abs/quant-ph/0405191"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8b939106-6c5a-472b-b993-43f8a807d220",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}