{
  "annotation_id": "2d0fbecc-6441-4a44-ad5f-c1408443eb24",
  "date_created": "2026-03-02T18:02:10.297000Z",
  "date_modified": "2026-03-02T18:02:10.297000Z",
  "file_hash": "f9e768449557d50c6b38147367c96e22044a508aa013e76d356f666c912e1023",
  "private": false,
  "record": {
    "abstract": "In this paper, we consider the partial database search problem where given a\ndatabase on N items, we are required to determine the first k bits of an\naddress x such that f(x)=1. We derive an algorithm and a lower bound for this\nproblem in the quantum circuits model. Let q(k,N) be the minimum number of\nqueries needed to find the first k bits of the required address x. We show that\nthere exist constants c_k and d_k such that (pi/4) (1 - d_k/sqrt{K}) sqrt{N} \u003c=\nq(k,n) \u003c= (pi/4) (1 - c_k/sqrt{K}) sqrt{N}, where K=2^k. Thus, it is always\neasier to determine a few bits of the target address than to find the entire\naddress, but as k becomes large this advantage reduces rapidly.",
    "arxiv_id": "quant-ph/0407122",
    "authors": [
      "Lov K. Grover",
      "Jaikumar Radhakrishnan"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Is partial quantum search of a database any easier?",
    "url": "https://arxiv.org/abs/quant-ph/0407122"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "130bc3cb-52e8-49d0-adcf-333d6b51a424",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}