{
  "annotation_id": "36b2d5aa-f937-4fbf-917b-036e9b8b4193",
  "date_created": "2026-03-02T18:02:44.523000Z",
  "date_modified": "2026-03-02T18:02:44.523000Z",
  "file_hash": "5fd4bec3948a95b2e3d619d0319f9c4d7bb5fe6fab56edfae6c94203c10a58c3",
  "private": false,
  "record": {
    "abstract": "We combine the classical notions and techniques for bounded query classes\nwith those developed in quantum computing. We give strong evidence that quantum\nqueries to an oracle in the class NP does indeed reduce the query complexity of\ndecision problems. Under traditional complexity assumptions, we obtain an\nexponential speedup between the quantum and the classical query complexity of\nfunction classes.\n  For decision problems and function classes we obtain the following results: o\nP_||^NP[2k] is included in EQP_||^NP[k] o P_||^NP[2^(k+1)-2] is included in\nEQP^NP[k] o FP_||^NP[2^(k+1)-2] is included in FEQP^NP[2k] o FP_||^NP is\nincluded in FEQP^NP[O(log n)] For sets A that are many-one complete for PSPACE\nor EXP we show that FP^A is included in FEQP^A[1]. Sets A that are many-one\ncomplete for PP have the property that FP_||^A is included in FEQP^A[1]. In\ngeneral we prove that for any set A there is a set X such that FP^A is included\nin FEQP^X[1], establishing that no set is superterse in the quantum setting.",
    "arxiv_id": "quant-ph/9903035",
    "authors": [
      "Harry Buhrman",
      "Wim van Dam"
    ],
    "categories": [
      "quant-ph",
      "cs.CC"
    ],
    "doi": "10.1109/CCC.1999.766273",
    "journal_ref": "Proceedings of the 14th Annual IEEE Conference on Computational\n  Complexity, pp. 149-156 (1999)",
    "title": "Quantum Bounded Query Complexity",
    "url": "https://arxiv.org/abs/quant-ph/9903035"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "887f7ca8-6054-457e-94fe-ee80f4deca32",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}