{"paper":{"title":"On deciding whether a Boolean function is constant or not","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Fabio Benatti, Luca Marinatto","submitted_at":"2003-04-10T15:08:23Z","abstract_excerpt":"We study the probability of making an error if, by querying an oracle a fixed number of times, we declare constant a randomly chosen n-bit\n Boolean function. We compare the classical and the quantum case, and we determine for how many oracle-queries k and for how many bits n one querying procedure is more efficient than the other."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0304073","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}