{
  "annotation_id": "a4bc9e61-a9da-4b4f-980d-20c833ff9e7e",
  "date_created": "2026-03-02T18:02:13.512000Z",
  "date_modified": "2026-03-02T18:02:13.512000Z",
  "file_hash": "02750c1636f587db94ba34b1e7036ba34c08c2741fc0fc6d0c8e548ecb47feea",
  "private": false,
  "record": {
    "abstract": "We study randomized and quantum query (a.k.a. decision tree) complexity for\nall total Boolean functions, with emphasis to derandomization and\ndequantization (removing quantumness from algorithms). Firstly, we show that\n$D(f) = O(Q_1(f)^3)$ for any total function $f$, where $D(f)$ is the minimal\nnumber of queries made by a deterministic query algorithm and $Q_1(f)$ is the\nnumber of queries made by any quantum query algorithm (decision tree analog in\nquantum case) with one-sided constant error; both algorithms compute function\n$f$. Secondly, we show that for all total Boolean functions $f$ holds\n$R_0(f)=O(R_2(f)^2 \\log N)$, where $R_0(f)$ and $R_2(f)$ are randomized\nzero-sided (a.k.a Las Vegas) and two-sided (a.k.a. Monte Carlo) error query\ncomplexities.",
    "arxiv_id": "quant-ph/0501142",
    "authors": [
      "Gatis Midrijanis"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "On Randomized and Quantum Query Complexities",
    "url": "https://arxiv.org/abs/quant-ph/0501142"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "fe0c26f1-fec8-4ad3-93e0-d1d2829c0e60",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}