{
  "annotation_id": "aed656d1-a672-4a86-ae55-269c1aeb61b3",
  "date_created": "2026-03-02T18:02:20.590000Z",
  "date_modified": "2026-03-02T18:02:20.590000Z",
  "file_hash": "3180b066990bb13f5b697a386e14f52cf2640c8eba19046f0485bae6a5bbfc8b",
  "private": false,
  "record": {
    "abstract": "We propose the use of a quantum algorithm to deal with the problem of\nsearching with errors in the framework of two-person games. Specifically, we\npresent a solution to the Ulam\u0027s problem that polynomially reduces its query\ncomplexity and makes it independent from the dimension of the search space.",
    "arxiv_id": "quant-ph/0508156",
    "authors": [
      "Stefano Mancini",
      "Lorenzo Maccone"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Int. J. of Quant. Inf. Vol.3, No.4, pp.729-733 (2005)",
    "title": "Using Quantum Mechanics to Cope with Liars",
    "url": "https://arxiv.org/abs/quant-ph/0508156"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c58ecab6-d2b6-4a4d-8908-82b7900292ca",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}