{
  "annotation_id": "7f585674-c020-4f07-812e-d5db932a88c1",
  "date_created": "2026-03-02T18:01:42.263000Z",
  "date_modified": "2026-03-02T18:01:42.263000Z",
  "file_hash": "e31c1b928be6cefd328d0cc3a1dbcf88e5dd8b50c9026db03873f9e36db8da9f",
  "private": false,
  "record": {
    "abstract": "We show on the example of the Arnold cat map that classical chaotic systems\ncan be simulated with exponential efficiency on a quantum computer. Although\nclassical computer errors grow exponentially with time, the quantum algorithm\nwith moderate imperfections is able to simulate accurately the unstable chaotic\nclassical dynamics for long times. The algorithm can be easily implemented on\nsystems of a few qubits.",
    "arxiv_id": "quant-ph/0101004",
    "authors": [
      "B. Georgeot",
      "D. L. Shepelyansky"
    ],
    "categories": [
      "quant-ph",
      "cond-mat",
      "nlin.CD"
    ],
    "doi": "10.1103/PhysRevLett.86.5393",
    "journal_ref": "Phys. Rev. Lett. v.86 (2001) p.5393",
    "title": "Quantum Computing of Classical Chaos: Smile of the Arnold-Schrodinger   Cat",
    "url": "https://arxiv.org/abs/quant-ph/0101004"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "04f2f58b-6c22-4891-9e75-0d7fec72c91f",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}