{
  "annotation_id": "171083ef-fe57-47ba-87fa-f90274ec05e4",
  "date_created": "2026-03-02T18:02:13.832000Z",
  "date_modified": "2026-03-02T18:02:13.832000Z",
  "file_hash": "e9c5bffa323c1a7b4ae52ac3c78a23c5a31104018bd49f0d1dc9e650ee798a93",
  "private": false,
  "record": {
    "abstract": "A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by\ntaking advantage of non-unitary transformation in ground state quantum\ncomputer. The energy gap scale of the ground state quantum computer is analyzed\nfor 3-bit Exact Cover problems. The time cost of this algorithm on general SAT\nproblems is discussed.",
    "arxiv_id": "quant-ph/0411194",
    "authors": [
      "Wenjin Mao"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.72.052316",
    "journal_ref": "Extended version is published on Phys. Rev. A 72, 052316 (2005)",
    "title": "Quantum Algorithm to Solve Satisfiability Problems",
    "url": "https://arxiv.org/abs/quant-ph/0411194"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "37342b00-bfbb-4e2f-bfa8-04f188aafdaa",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}