{
  "annotation_id": "8a574a42-57ce-4b6b-875b-aa48bd608333",
  "date_created": "2026-03-02T18:01:59.333000Z",
  "date_modified": "2026-03-02T18:01:59.333000Z",
  "file_hash": "9cc8f853a069901955a6119795b9d65697c2d62d207bbc80351ece59ecca691c",
  "private": false,
  "record": {
    "abstract": "We study the probability of making an error if, by querying an oracle a fixed\nnumber of times, we declare constant a randomly chosen n-bit\n  Boolean function. We compare the classical and the quantum case, and we\ndetermine for how many oracle-queries k and for how many bits n one querying\nprocedure is more efficient than the other.",
    "arxiv_id": "quant-ph/0304073",
    "authors": [
      "Fabio Benatti",
      "Luca Marinatto"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "Int. J. Quantum Inf.; Vol.1, No. 2 (2003) 237-246",
    "title": "On deciding whether a Boolean function is constant or not",
    "url": "https://arxiv.org/abs/quant-ph/0304073"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8742636c-48fd-4bcb-bb0e-7484b47c0f8a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}