{
  "annotation_id": "7a2329c5-4024-4dd4-8b29-415c12ec0d9c",
  "date_created": "2026-03-02T18:01:48.948000Z",
  "date_modified": "2026-03-02T18:01:48.948000Z",
  "file_hash": "62e874cb08c12131f77789f3e2b13b661beadf64aaee4e495ba101462ccdf21d",
  "private": false,
  "record": {
    "abstract": "We propose a quantum algorithm for solving combinatorial search problems that\nuses only a sequence of measurements. The algorithm is similar in spirit to\nquantum computation by adiabatic evolution, in that the goal is to remain in\nthe ground state of a time-varying Hamiltonian. Indeed, we show that the\nrunning times of the two algorithms are closely related. We also show how to\nachieve the quadratic speedup for Grover\u0027s unstructured search problem with\nonly two measurements. Finally, we discuss some similarities and differences\nbetween the adiabatic and measurement algorithms.",
    "arxiv_id": "quant-ph/0204013",
    "authors": [
      "Andrew M. Childs",
      "Enrico Deotto",
      "Edward Farhi",
      "Jeffrey Goldstone",
      "Sam Gutmann",
      "Andrew J. Landahl"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.66.032314",
    "journal_ref": "Phys. Rev. A 66, 032314 (2002)",
    "title": "Quantum search by measurement",
    "url": "https://arxiv.org/abs/quant-ph/0204013"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "4c0e0c6c-dd38-403e-8884-75a16d4eb6fb",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}