{
  "annotation_id": "0e712f65-a85b-46f9-bf4b-a0f168f71976",
  "date_created": "2026-03-02T18:02:19.901000Z",
  "date_modified": "2026-03-02T18:02:19.901000Z",
  "file_hash": "f1cac6dae79c9a6f171a694395bab05804f312375bee39a299b4938d476bd02a",
  "private": false,
  "record": {
    "abstract": "We present a new method for proving lower bounds on quantum query algorithms.\nThe new method is an extension of adversary method, by analyzing the eigenspace\nstructure of the problem.\n  Using the new method, we prove a strong direct product theorem for quantum\nsearch. This result was previously proven by Klauck, Spalek and de Wolf\n(quant-ph/0402123) using polynomials method. No proof using adversary method\nwas known before.",
    "arxiv_id": "quant-ph/0508200",
    "authors": [
      "Andris Ambainis"
    ],
    "categories": [
      "quant-ph",
      "cs.CC"
    ],
    "title": "A new quantum lower bound method, with an application to strong direct   product theorem for quantum search",
    "url": "https://arxiv.org/abs/quant-ph/0508200"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "bfab3d74-67d3-4d4b-bbf4-4cdd002a6878",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}