{
  "annotation_id": "7eac953a-02e4-4a99-838b-af38d5b3b506",
  "date_created": "2026-03-02T18:02:30.800000Z",
  "date_modified": "2026-03-02T18:02:30.800000Z",
  "file_hash": "2daaa0ee98eca7a0b4ee1b93835a006f69830da69ef774a3ecdf3f46270b0a93",
  "private": false,
  "record": {
    "abstract": "We present a modification of the standard single-item quantum search\nprocedure that acquires robustness from spontaneous decay of the qubits. This\ndamps the usual oscillation of populations, driving the system to a steady\nstate with a strongly enhanced population of the solution. Numerical evaluation\nof the steady state was performed for up to 36 qubits. The huge size of the\nstate space in our analysis is dealt with by exploiting a symmetry in the\nmaster equation that reduces the scaling of computer resources from exponential\nto polynomial. Based on these results we estimate that an error-free solution\ncan be retrieved from the steady state after O(log log N) repetitions, with\nnear-unit probability. This brings the overall scaling to O(sqrt{N} log log N),\nonly slightly worse than for the ideal quantum case.",
    "arxiv_id": "quant-ph/0609047",
    "authors": [
      "Robert J. C. Spreeuw",
      "Tom W. Hijmans"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.76.022306",
    "journal_ref": "Phys. Rev. A 76, 022306 (2007)",
    "title": "Robust quantum searching with spontaneously decaying qubits",
    "url": "https://arxiv.org/abs/quant-ph/0609047"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "efa7a134-b8ea-45d1-98a3-fff681a67c62",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}