{
  "annotation_id": "b474f398-df1f-432f-a3b2-85e08f37ce5f",
  "date_created": "2026-03-02T18:02:10.013000Z",
  "date_modified": "2026-03-02T18:02:10.013000Z",
  "file_hash": "fdc44631481e58f0964033fb98767be910ad9b78b65eafd9ca540873b5cee8cc",
  "private": false,
  "record": {
    "abstract": "In this paper, we consider a quantum algorithm for solving the following\nproblem: ``Suppose $f$ is a function given as a black box (that is also called\nan oracle) and $f$ is invariant under some AND-mask. Examine a property of $f$\nby querying the oracle.\u0027\u0027 We compare the efficiency of our quantum algorithm\nwith that of classical algorithms by evaluating the expected number of queries\nfor each algorithm. We show that our quantum algorithm is more efficient than\nany classical algorithm in some cases. However, our quantum algorithm does not\nexhibit an exponential speedup in the size of an input, compared with the best\nclassical algorithm. Our algorithm extracts a global property of $f$ (that is,\ninvariance of $f$) while it neglects local properties of $f$ (that is, outputs\nof $f$). We can regard our algorithm as an application of Simon\u0027s algorithm.",
    "arxiv_id": "quant-ph/0408013",
    "authors": [
      "Hiroo Azuma"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A quantum algorithm for examining oracles",
    "url": "https://arxiv.org/abs/quant-ph/0408013"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c606b20b-e07f-48a5-8709-53ddd97fe8e8",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}