{
  "annotation_id": "8008307d-38d2-4599-a579-76f779aef2d0",
  "date_created": "2026-03-02T18:01:42.581000Z",
  "date_modified": "2026-03-02T18:01:42.581000Z",
  "file_hash": "a845d646dcfdd428c55d0b6624b9646b1a19e032ce60c376383e4d9764e49fdd",
  "private": false,
  "record": {
    "abstract": "There is no known polynomial-time algorithm that can solve an NP problem.\nEvolutionary search has been shown to be a viable method of finding acceptable\nsolutions within a reasonable time period. Recently quantum computers have\nsurfaced as another alternative method. But these two methods use radically\ndifferent philosophies for solving NP problems even though both search methods\nare non-deterministic. This paper uses instances of {\\bf SAT}, {\\bf 3SAT} and\n{\\bf TSP} to describe how these two methods differ in their approach to solving\nNP problems.",
    "arxiv_id": "quant-ph/0010021",
    "authors": [
      "G. W. Greenwood"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Finding Solutions to NP Problems: Philosophical Difference Between   Quantum and Evolutionary Search Algorithms",
    "url": "https://arxiv.org/abs/quant-ph/0010021"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d8a7dc81-5d7d-4e9f-a736-920977482e25",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}