{
  "annotation_id": "44b5d11b-8c87-45a9-aa38-2c51f21eec10",
  "date_created": "2026-03-02T18:02:31.152000Z",
  "date_modified": "2026-03-02T18:02:31.152000Z",
  "file_hash": "91bbd7031fdf1b9b75ac7331657b633c629d77b47330295aaa7d4a7b2c1017b1",
  "private": false,
  "record": {
    "abstract": "One of the most basic computational problems is the task of finding a desired\nitem in an ordered list of N items. While the best classical algorithm for this\nproblem uses log_2 N queries to the list, a quantum computer can solve the\nproblem using a constant factor fewer queries. However, the precise value of\nthis constant is unknown. By characterizing a class of quantum query algorithms\nfor ordered search in terms of a semidefinite program, we find new quantum\nalgorithms for small instances of the ordered search problem. Extending these\nalgorithms to arbitrarily large instances using recursion, we show that there\nis an exact quantum ordered search algorithm using 4 log_{605} N \\approx 0.433\nlog_2 N queries, which improves upon the previously best known exact algorithm.",
    "arxiv_id": "quant-ph/0608161",
    "authors": [
      "Andrew M. Childs",
      "Andrew J. Landahl",
      "Pablo A. Parrilo"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.75.032335",
    "journal_ref": "Phys. Rev. A 75, 032335 (2007)",
    "title": "Improved quantum algorithms for the ordered search problem via   semidefinite programming",
    "url": "https://arxiv.org/abs/quant-ph/0608161"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "43f8da09-88a6-41bf-8cf5-ed0d92fe4f32",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}