{
  "annotation_id": "e56bdd82-c13b-43e6-915e-e5c59902e265",
  "date_created": "2026-03-02T18:01:51.841000Z",
  "date_modified": "2026-03-02T18:01:51.841000Z",
  "file_hash": "bce0fdc11a50e85d2e42e21765b29fa48475f1fc5e836bd887fa28f5d8f1a154",
  "private": false,
  "record": {
    "abstract": "This is a comment on a recent publication claiming to have found a ``quantum\noptimization\u0027\u0027 algorithm which outperforms known algorithms for minimizing some\n``cost function\u0027\u0027. Unfortunately, this algorithm is no better than choosing a\nstate at random and checking whether it has low cost.",
    "arxiv_id": "quant-ph/0206081",
    "authors": [
      "Christof Zalka",
      "Todd A. Brun"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1088/1367-2630/4/1/401",
    "journal_ref": "New J. Phys. 4, C1 (2002). http://www.njp.org",
    "title": "Comment on \"Quantum optimization for combinatorial searches\"",
    "url": "https://arxiv.org/abs/quant-ph/0206081"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "08e3ad6a-c4a3-429f-8bdf-32c2c153198a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}