{
  "annotation_id": "6ca29254-504a-42d4-9dec-c47a91f2fed1",
  "date_created": "2026-03-02T18:02:41.163000Z",
  "date_modified": "2026-03-02T18:02:41.163000Z",
  "file_hash": "f580bfb21e62140d6b7fe13466fe30bf4956def8db1c565cbeb0d6eb13e34e9a",
  "private": false,
  "record": {
    "abstract": "We present a class of fast quantum algorithms, based on Bernstein and\nVazirani\u0027s parity problem, that retrieve the entire contents of a quantum\ndatabase $Y$ in a single query. The class includes binary search problems and\ncoin-weighing problems. Our methods far exceed the efficiency of classical\nalgorithms which are bounded by the classical information-theoretic bound. We\nshow the connection between classical algorithms based on several compression\ncodes and our quantum-mechanical method.",
    "arxiv_id": "quant-ph/9705041",
    "authors": [
      "B. M. Terhal",
      "J. A. Smolin"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.58.1822",
    "journal_ref": "Phys.Rev.A58:1822,1998",
    "title": "Single quantum querying of a database",
    "url": "https://arxiv.org/abs/quant-ph/9705041"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "705c6eef-3772-469e-9a42-cd627fefab17",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}