{
  "annotation_id": "7fd6e1b8-3ab9-4e44-ba25-a6c693020cf8",
  "date_created": "2026-03-02T18:02:06.878000Z",
  "date_modified": "2026-03-02T18:02:06.878000Z",
  "file_hash": "20e6d74904a74239ebbbe6359e835c3a76bd26b07212cadaa73b4440eaf4dfd8",
  "private": false,
  "record": {
    "abstract": "Given a blackbox for f, a smooth real scalar function of d real variables,\none wants to estimate the gradient of f at a given point with n bits of\nprecision. On a classical computer this requires a minimum of d+1 blackbox\nqueries, whereas on a quantum computer it requires only one query regardless of\nd. The number of bits of precision to which f must be evaluated matches the\nclassical requirement in the limit of large n.",
    "arxiv_id": "quant-ph/0405146",
    "authors": [
      "Stephen P. Jordan"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.95.050501",
    "journal_ref": "Phys. Rev. Lett. 95, 050501 (2005)",
    "title": "Fast quantum algorithm for numerical gradient estimation",
    "url": "https://arxiv.org/abs/quant-ph/0405146"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "50e6fdf7-7b2c-44bb-a37e-437b7a3a9e07",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}