{
  "annotation_id": "2794d4fc-31a5-437c-a368-a1bfc5b72fb6",
  "date_created": "2026-03-02T18:01:45.193000Z",
  "date_modified": "2026-03-02T18:01:45.193000Z",
  "file_hash": "e586ff13d9b1397f07fa2e8e15881c70edbde617f41b807e916d293105f4f3d0",
  "private": false,
  "record": {
    "abstract": "It was recently shown (quant-ph/9909074) that parasitic random interactions\nbetween the qubits in a quantum computer can induce quantum chaos and put into\nquestion the operability of a quantum computer. In this work I investigate\nwhether already the interactions between the qubits introduced with the\nintention to operate the quantum computer may lead to quantum chaos. The\nanalysis focuses on two well--known quantum algorithms, namely Grover\u0027s search\nalgorithm and the quantum Fourier transform. I show that in both cases the same\nvery unusual combination of signatures from chaotic and from integrable\ndynamics arises.",
    "arxiv_id": "quant-ph/0110037",
    "authors": [
      "Daniel Braun"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.65.042317",
    "journal_ref": "Phys. Rev. A 65, 042317-1 (2002)",
    "title": "Quantum Chaos and Quantum Algorithms",
    "url": "https://arxiv.org/abs/quant-ph/0110037"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "172920a4-fbc7-4606-b667-360b29f448ac",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}