{
  "annotation_id": "639e3e30-b767-485f-9894-e2baf0c0d884",
  "date_created": "2026-03-02T18:01:45.905000Z",
  "date_modified": "2026-03-02T18:01:45.905000Z",
  "file_hash": "81ff0bf8da50f91baef149d447dcc04cabb3ca07b1218c831b9b3866a1054e96",
  "private": false,
  "record": {
    "abstract": "The classical Yao principle states that the complexity R_epsilon(f) of an\noptimal randomized algorithm for a function f with success probability\n1-epsilon equals the complexity max_mu D_epsilon^mu(f) of an optimal\ndeterministic algorithm for f that is correct on a fraction 1-epsilon of the\ninputs, weighed according to the hardest distribution mu over the inputs. In\nthis paper we investigate to what extent such a principle holds for quantum\nalgorithms. We propose two natural candidate quantum Yao principles, a ``weak\u0027\u0027\nand a ``strong\u0027\u0027 one. For both principles, we prove that the quantum\nbounded-error complexity is a lower bound on the quantum analogues of max mu\nD_epsilon^mu(f). We then prove that equality cannot be obtained for the\n``strong\u0027\u0027 version, by exhibiting an exponential gap. On the other hand, as a\npositive result we prove that the ``weak\u0027\u0027 version holds up to a constant\nfactor for the query complexity of all symmetric Boolean functions",
    "arxiv_id": "quant-ph/0109070",
    "authors": [
      "Mart de Graaf",
      "Ronald de Wolf"
    ],
    "categories": [
      "quant-ph",
      "cs.CC"
    ],
    "title": "On Quantum Versions of the Yao Principle",
    "url": "https://arxiv.org/abs/quant-ph/0109070"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d797182c-b73f-479e-bdd2-f1dd9ee0850a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}