{
  "annotation_id": "48d80ba5-0855-4082-9caf-3f8321f88c19",
  "date_created": "2026-03-02T18:02:05.879000Z",
  "date_modified": "2026-03-02T18:02:05.879000Z",
  "file_hash": "3a861a695d7410efb029fb689d628b866d77483827ea7b74ef6d86eda0796f09",
  "private": false,
  "record": {
    "abstract": "We study effects of static inter-qubit interactions on the stability of the\nGrover quantum search algorithm. Our numerical and analytical results show\nexistence of regular and chaotic phases depending on the imperfection strength\n$\\epsilon$. The critical border $\\epsilon_c$ between two phases drops\npolynomially with the number of qubits $n_q$ as $\\epsilon_c \\sim n_q^{-3/2}$.\nIn the regular phase $(\\epsilon \u003c \\epsilon_c)$ the algorithm remains robust\nagainst imperfections showing the efficiency gain $\\epsilon_c / \\epsilon$ for\n$\\epsilon \\gtrsim 2^{-n_q/2}$. In the chaotic phase $(\\epsilon \u003e \\epsilon_c)$\nthe algorithm is completely destroyed.",
    "arxiv_id": "quant-ph/0403138",
    "authors": [
      "A. A. Pomeransky",
      "O. V. Zhirov",
      "D. L. Shepelyansky"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1140/epjd/e2004-00113-4",
    "journal_ref": "Eur. Phys. J. D 31, 131-135 (2004)",
    "title": "Phase diagram for the Grover algorithm with static imperfections",
    "url": "https://arxiv.org/abs/quant-ph/0403138"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e6b9a3e5-d1a3-4de9-b9b6-285f4fcc0cbc",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}