{
  "annotation_id": "ebaaea24-71dc-43c3-913a-471cd936746d",
  "date_created": "2026-03-02T18:01:56.258000Z",
  "date_modified": "2026-03-02T18:01:56.258000Z",
  "file_hash": "223f003bcb22dbe98477b47f630ae56c93e0663e30107ae26cc6a0e9a0400b5f",
  "private": false,
  "record": {
    "abstract": "We analyze three different quantum search algorithms, the traditional\nGrover\u0027s algorithm, its continuous-time analogue by Hamiltonian evolution, and\nfinally the quantum search by local adiabatic evolution. We show that they are\nclosely related algorithms in the sense that they all perform a rotation, at a\nconstant angular velocity, from a uniform superposition of all states to the\nsolution state. This make it possible to implement the last two algorithms by\nHamiltonian evolution on a conventional quantum circuit, while keeping the\nquadratic speedup of Grover\u0027s original algorithm.",
    "arxiv_id": "quant-ph/0302138",
    "authors": [
      "J. Roland",
      "N. J. Cerf"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.68.062311",
    "journal_ref": "Phys. Rev. A 68, 062311 (2003).",
    "title": "Quantum circuit implementation of the Hamiltonian versions of Grover\u0027s   algorithm",
    "url": "https://arxiv.org/abs/quant-ph/0302138"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "828ec92b-b195-4aeb-81f9-7e1ecd384fb6",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}