{
  "annotation_id": "c7b8e69a-1ed4-4c40-b21a-59f5ff24e65c",
  "date_created": "2026-03-02T18:01:59.544000Z",
  "date_modified": "2026-03-02T18:01:59.544000Z",
  "file_hash": "06fe82d1c4e8710e185668931f405f463cfd4e642170f5db5caeb360333e4e7a",
  "private": false,
  "record": {
    "abstract": "Quantum algorithms are built enabling to find Poincar\\\u0027e recurrence times and\nperiodic orbits of classical dynamical systems. It is shown that exponential\ngain compared to classical algorithms can be reached for a restricted class of\nsystems. Quadratic gain can be achieved for a larger set of dynamical systems.\nThe simplest cases can be implemented with small number of qubits.",
    "arxiv_id": "quant-ph/0307233",
    "authors": [
      "B. Georgeot"
    ],
    "categories": [
      "quant-ph",
      "cond-mat",
      "nlin.CD"
    ],
    "doi": "10.1103/PhysRevA.69.032301",
    "journal_ref": "Physical Review A 69, 032301 (2004)",
    "title": "Quantum Computing of Poincare Recurrences and Periodic Orbits",
    "url": "https://arxiv.org/abs/quant-ph/0307233"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7844a3c3-8914-4c54-a906-5b6998202822",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}