{
  "annotation_id": "53c381c4-dcda-49ee-aa80-32dced5b6e03",
  "date_created": "2026-03-02T18:01:42.263000Z",
  "date_modified": "2026-03-02T18:01:42.263000Z",
  "file_hash": "f4e30b8095b40f22fb22c0c6287164254cb32695d2403a138b0491011215e411",
  "private": false,
  "record": {
    "abstract": "Sorting is a fundamental computational process, which facilitates subsequent\nsearching of a database. It can be thought of as factorisation of the search\nprocess. The location of a desired item in a sorted database can be found by\nclassical queries that inspect one letter of the label at a time. For an\nunsorted database, no such classical quick search algorithm is available. If\nthe database permits quantum queries, however, then mere digitisation is\nsufficient for efficient search. Sorting becomes redundant with the quantum\nsuperposition of states. A quantum algorithm is written down which locates the\ndesired item in an unsorted database a factor of two faster than the best\nclassical algorithm can in a sorted database. This algorithm has close\nresemblance to the assembly process in DNA replication.",
    "arxiv_id": "quant-ph/0012149",
    "authors": [
      "Apoorva Patel"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.64.034303",
    "journal_ref": "Phys. Rev. A64 (2001) 034303",
    "title": "Quantum Database Search can do without Sorting",
    "url": "https://arxiv.org/abs/quant-ph/0012149"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7f13913c-ff8b-462c-bf78-57c405aa9963",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}