{
  "annotation_id": "ebe1d37b-42d5-48fe-bf05-19c365b5a4cd",
  "date_created": "2026-03-02T18:02:13.640000Z",
  "date_modified": "2026-03-02T18:02:13.640000Z",
  "file_hash": "cee1d579767966945ca23b131f1c8089eb2135da70de2a381ef8f26a17097ba1",
  "private": false,
  "record": {
    "abstract": "We present a continuous time quantum search algorithm analogous to Grover\u0027s.\nIn particular, the optimal search time for this algorithm is proportional to\n$\\sqrt{N}$, where $N$ is the database size. This search algorithm can be\nimplemented using any Hamiltonian with a discrete energy spectrum through\nexcitation of resonances between an initial and the searched state. This\nalgorithm is robust and, as in the case of Grover\u0027s, it allows for an error\n$O(1/\\sqrt{N})$ in the determination of the searched state. A discrete time\nversion of this continuous time search algorithm is built, and the connection\nbetween the search algorithms with discrete and continuous times is\nestablished.",
    "arxiv_id": "quant-ph/0502161",
    "authors": [
      "A. Romanelli",
      "A. Auyuanet",
      "R. Donangelo"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1016/j.physa.2005.05.101",
    "title": "Quantum search with resonances",
    "url": "https://arxiv.org/abs/quant-ph/0502161"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "31738479-4a25-460b-b493-16dcf3a3dbd6",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}