{
  "annotation_id": "1e5dfc6b-2b21-4d30-b4bb-f70313ad7808",
  "date_created": "2026-03-02T18:02:03.584000Z",
  "date_modified": "2026-03-02T18:02:03.584000Z",
  "file_hash": "826c89425a2d08cd16a09fbc40841f772cc1adafd1963701a95b3197c1f7da8d",
  "private": false,
  "record": {
    "abstract": "It is an established fact that for many of the interesting problems quantum\nalgorithms based on queries of the standard oracle bring no significant\nimprovement in comparison to known classical algorithms. It is conceivable that\nthere are other oracles of algorithmic importance acting in a less intuitive\nfashion to which such limitations do not apply. Thus motivated this article\nsuggests a broader understanding towards what a general quantum oracle is.\n  We propose a general definition of a quantum oracle and give a classification\nof quantum oracles based on the behavior of the eigenvalues and eigenvectors of\ntheir queries. Our aim is to determine the computational characteristics of a\nquantum oracle in terms of these eigenvalues and eigenvectors. Within this\nframework we attempt to describe the class of quantum oracles that are\nefficiently simulated by the standard oracle and compare the computational\nstrength of different kinds of quantum oracles by an adversary argument using\ntrigonometric polynomials.",
    "arxiv_id": "quant-ph/0312107",
    "authors": [
      "Alp Atici"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Comparative Computational Strength of Quantum Oracles",
    "url": "https://arxiv.org/abs/quant-ph/0312107"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7abe2edd-d780-47e5-8587-bf2673f41c3f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}