{
  "annotation_id": "d71953a8-c09b-4677-854b-14a8c2c28144",
  "date_created": "2026-03-02T18:01:48.833000Z",
  "date_modified": "2026-03-02T18:01:48.833000Z",
  "file_hash": "ea4511db710957091af95e31bfb480e2dbfb5d338eca052b06d866ff25a1282e",
  "private": false,
  "record": {
    "abstract": "A language L has a property tester if there exists a probabilistic algorithm\nthat given an input x only asks a small number of bits of x and distinguishes\nthe cases as to whether x is in L and x has large Hamming distance from all y\nin L. We define a similar notion of quantum property testing and show that\nthere exist languages with quantum property testers but no good classical\ntesters. We also show there exist languages which require a large number of\nqueries even for quantumly testing.",
    "arxiv_id": "quant-ph/0201117",
    "authors": [
      "H. Buhrman",
      "L. Fortnow",
      "I. Newman",
      "H. Roehrig"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Property Testing",
    "url": "https://arxiv.org/abs/quant-ph/0201117"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "714606e2-4476-44e4-bd28-1f7d38dcf857",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}