{
  "annotation_id": "456f6fea-51fd-4e78-a17d-00cf59828316",
  "date_created": "2026-03-02T18:01:46.205000Z",
  "date_modified": "2026-03-02T18:01:46.205000Z",
  "file_hash": "d3a792193c1b6679d41bdd62b6674e42cf230280554f7aef5fe50cbe33b2d200",
  "private": false,
  "record": {
    "abstract": "We consider stability of a general quantum algorithm with respect to a fixed\nbut unknown residual interaction between qubits, and show a surprising fact,\nnamely that the average fidelity of quantum computation increases by decreasing\naverage time correlation function of the perturbing operator in sequences of\nconsecutive quantum gates. Our thinking is applied to the quantum Fourier\ntransformation where an alternative \u0027less regular\u0027 quantum algorithm is devised\nwhich is qualitatively more robust against static random residual n-qubit\ninteraction.",
    "arxiv_id": "quant-ph/0106150",
    "authors": [
      "Tomaz Prosen",
      "Marko Znidaric"
    ],
    "categories": [
      "quant-ph",
      "nlin.CD"
    ],
    "doi": "10.1088/0305-4470/34/47/103",
    "journal_ref": "J.Phys.A 34, L681 (2001)",
    "title": "Can quantum chaos enhance stability of quantum computation?",
    "url": "https://arxiv.org/abs/quant-ph/0106150"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "4893cec2-1233-4e86-aba4-4abc857c2ea6",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}