{
  "annotation_id": "28a35eca-cc81-4c16-a4c6-c77a6f9b503e",
  "date_created": "2026-03-02T18:02:34.702000Z",
  "date_modified": "2026-03-02T18:02:34.702000Z",
  "file_hash": "383dfe803065373a5a0322b3ac23b60c653ff0b0b7f1ef29aa83aab75b19a51b",
  "private": false,
  "record": {
    "abstract": "Recently, Farhi, Goldstone, and Gutmann gave a quantum algorithm for\nevaluating NAND trees that runs in time O(sqrt(N log N)) in the Hamiltonian\nquery model. In this note, we point out that their algorithm can be converted\ninto an algorithm using O(N^{1/2 + epsilon}) queries in the conventional\nquantum query model, for any fixed epsilon \u003e 0.",
    "arxiv_id": "quant-ph/0702160",
    "authors": [
      "Andrew M. Childs",
      "Richard Cleve",
      "Stephen P. Jordan",
      "David Yonge-Mallo"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.4086/toc.2009.v005a005",
    "journal_ref": "Theory of Computing, Vol. 5 (2009) 119-123",
    "license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
    "title": "Discrete-query quantum algorithm for NAND trees",
    "url": "https://arxiv.org/abs/quant-ph/0702160"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ed4e0550-b9cc-4e36-b775-9206384a5841",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}