{
  "annotation_id": "187e16d6-06f6-490a-8a3b-6d3e8e893aa7",
  "date_created": "2026-03-02T18:02:03.432000Z",
  "date_modified": "2026-03-02T18:02:03.432000Z",
  "file_hash": "96be2e438499773d3fd1459d7dd61f456ad365bc34d34355b8779bf02a72e6da",
  "private": false,
  "record": {
    "abstract": "Ohya and Volovich have been proposed a new quantum computation model with\nchaos amplification to solve the SAT problem, which went beyond usual quantum\nalgorithm. In this paper we study the complexity of the SAT algorithm by\ncounting the steps of computation algorithm rigorously, which was mentioned in\nthe paper [1,2,3,5,7]For this purpose, we refine the quantum gates treating the\nSAT problem step by step.",
    "arxiv_id": "quant-ph/0312074",
    "authors": [
      "Shigeo Akashi",
      "Satoshi Iriyama"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Estimation of Complexity for the Ohya-Masuda-Volovich SAT Algorithm",
    "url": "https://arxiv.org/abs/quant-ph/0312074"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8f75ad4b-d342-4c5f-93b0-c71dfc1e69ee",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}