{
  "annotation_id": "b5bc953d-231d-48da-a1ff-752db77c9709",
  "date_created": "2026-03-02T18:02:16.726000Z",
  "date_modified": "2026-03-02T18:02:16.726000Z",
  "file_hash": "859c27fb22e52f1b8e93ab05b516f44e0ce72790148c30e658b74664593d6284",
  "private": false,
  "record": {
    "abstract": "A quantum algorithm is proposed to solve the Satisfiability problems by the\nground-state quantum computer. The scale of the energy gap of the ground-state\nquantum computer is analyzed for the 3-bit Exact Cover problem. The time cost\nof this algorithm on the general SAT problems is discussed.",
    "arxiv_id": "quant-ph/0506200",
    "authors": [
      "Wenjin Mao"
    ],
    "categories": [
      "quant-ph",
      "cond-mat.mes-hall",
      "cs.CC"
    ],
    "doi": "10.1103/PhysRevA.72.052316",
    "journal_ref": "Phys. Rev. A 72, 052316 (2005)",
    "title": "Solving Satisfiability Problems by the Ground-State Quantum Computer",
    "url": "https://arxiv.org/abs/quant-ph/0506200"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "9986b582-a6ae-4de3-b0b2-6d63808dbc02",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}