{
  "annotation_id": "6349250f-a127-41a4-8b2e-0a4d17af962c",
  "date_created": "2026-03-02T18:02:13.465000Z",
  "date_modified": "2026-03-02T18:02:13.465000Z",
  "file_hash": "9446a2b8948f0c958e9d4a39959d6e9c952c09780df50a2e335b80ab0c3a1e65",
  "private": false,
  "record": {
    "abstract": "Quantum adiabatic algorithm is a method of solving computational problems by\nevolving the ground state of a slowly varying Hamiltonian. The technique uses\nevolution of the ground state of a slowly varying Hamiltonian to reach the\nrequired output state. In some cases, such as the adiabatic versions of\nGrover\u0027s search algorithm and Deutsch-Jozsa algorithm, applying the global\nadiabatic evolution yields a complexity similar to their classical algorithms.\nHowever, using the local adiabatic evolution, the algorithms given by J. Roland\nand N. J. Cerf for Grover\u0027s search [ Phys. Rev. A. {\\bf 65} 042308(2002)] and\nby Saurya Das, Randy Kobes and Gabor Kunstatter for the Deutsch-Jozsa algorithm\n[Phys. Rev. A. {\\bf 65}, 062301 (2002)], yield a complexity of order $\\sqrt{N}$\n(where N=2$^{\\rm n}$ and n is the number of qubits). In this paper we report\nthe experimental implementation of these local adiabatic evolution algorithms\non a two qubit quantum information processor, by Nuclear Magnetic Resonance.",
    "arxiv_id": "quant-ph/0503060",
    "authors": [
      "Avik Mitra",
      "Arindam Ghosh",
      "Ranabir Das",
      "Apoorva Patel",
      "Anil Kumar"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1016/j.jmr.2005.08.004",
    "title": "Experimental implementation of local adiabatic evolution algorithms by   an NMR quantum information processor",
    "url": "https://arxiv.org/abs/quant-ph/0503060"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ad743b75-aa5a-4a7b-9c7a-c334c498e4ba",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}