{
  "annotation_id": "ba17c40f-47be-4279-8295-ef4f0a261684",
  "date_created": "2026-03-02T18:01:49.026000Z",
  "date_modified": "2026-03-02T18:01:49.026000Z",
  "file_hash": "609d44cbea3826fa6438b8466829088d72a9fd27f785da4e3db8acac61a0edbd",
  "private": false,
  "record": {
    "abstract": "We study the properties of eigenstates of an operating quantum computer which\nsimulates the dynamical evolution in the regime of quantum chaos. Even if the\nquantum algorithm is polynomial in number of qubits $n_q$, it is shown that the\nideal eigenstates become mixed and strongly modified by static imperfections\nabove a certain threshold which drops exponentially with $n_q$. Above this\nthreshold the quantum eigenstate entropy grows linearly with $n_q$ but the\ncomputation remains reliable during a time scale which is polynomial in the\nimperfection strength and in $n_q$.",
    "arxiv_id": "quant-ph/0112132",
    "authors": [
      "Giuliano Benenti",
      "Giulio Casati",
      "Simone Montangero",
      "Dima L. Shepelyansky"
    ],
    "categories": [
      "quant-ph",
      "cond-mat",
      "nlin.CD"
    ],
    "doi": "10.1140/epjd/e2002-00127-x",
    "journal_ref": "Eur. Phys. J. D 20 (2002) 293",
    "title": "Eigenstates of Operating Quantum Computer: Hypersensitivity to Static   Imperfections",
    "url": "https://arxiv.org/abs/quant-ph/0112132"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "25fd16ac-ebf5-4c7e-8d57-23347cbc17aa",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}