{
  "annotation_id": "2a003016-c07f-45a3-852e-57b3c07cac6f",
  "date_created": "2026-03-02T18:01:45.849000Z",
  "date_modified": "2026-03-02T18:01:45.849000Z",
  "file_hash": "0dbefc875035181220624416110bb9c27081962c9b150be75fc019621f5f3383",
  "private": false,
  "record": {
    "abstract": "Recently T. Kieu (arXiv:quant-ph/0110136) claimed a quantum algorithm\ncomputing some functions beyond the Church-Turing class. He notes that \"it is\nin fact widely believed that quantum computation cannot offer anything new\nabout computability\" and claims the opposite. However, his quantum algorithm\ndoes not work, which is the point of my short note. I still believe that\nquantum computation leads to new complexity but retains the old computability.",
    "arxiv_id": "quant-ph/0111009",
    "authors": [
      "Boris Tsirelson"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "The quantum algorithm of Kieu does not solve the Hilbert\u0027s tenth problem",
    "url": "https://arxiv.org/abs/quant-ph/0111009"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c366bcd4-45b3-47bc-8837-2b212fb6feac",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}