{
  "annotation_id": "4f3af9d2-4716-4615-9cca-639cad458d70",
  "date_created": "2026-03-02T18:02:27.563000Z",
  "date_modified": "2026-03-02T18:02:27.563000Z",
  "file_hash": "1260867eae06595df6f084f30971f1802f42fff4d567669425d4e644d52aea71",
  "private": false,
  "record": {
    "abstract": "An important and usual problem is to search all states we want from a\ndatabase with a large number of states. In such, recall is vital. Grover\u0027s\noriginal quantum search algorithm has been generalized to the case of multiple\nsolutions, but no one has calculated the query complexity in this case. We will\nuse a generalized algorithm with higher precision to solve such a search\nproblem that we should find all marked states and show that the practical query\ncomplexity increases with the number of marked states. In the end we will\nintroduce an algorithm for the problem on a ``duality computer\u0027\u0027 and show its\nadvantage over other algorithms.",
    "arxiv_id": "quant-ph/0604059",
    "authors": [
      "Bin Shang"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1088/0253-6102/48/2/013",
    "title": "Query complexity for searching multiple marked states from an unsorted   database",
    "url": "https://arxiv.org/abs/quant-ph/0604059"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f9baaf7a-6e07-436b-bbb2-7433e07869f0",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}