{
  "annotation_id": "30e0e022-510a-4082-9bc2-d090c18dfb52",
  "date_created": "2026-03-02T18:01:56.274000Z",
  "date_modified": "2026-03-02T18:01:56.274000Z",
  "file_hash": "0a9f9e84a00cf274f07102eb863c88e573c7c2e59223f83fca0d41932a9d8233",
  "private": false,
  "record": {
    "abstract": "We show that deterministic quantum computing with a single bit (DQC1) can\ndetermine whether the classical limit of a quantum system is chaotic or\nintegrable using O(N) physical resources, where $N$ is the dimension of the\nHilbert space of the system under study. This is a square root improvement over\nall known classical procedures. Our study relies strictly on the random matrix\nconjecture. We also present numerical results for the nonlinear kicked top.",
    "arxiv_id": "quant-ph/0303042",
    "authors": [
      "David Poulin",
      "Raymond Laflamme",
      "G. J. Milburn",
      "Juan Pablo Paz"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.68.022302",
    "journal_ref": "Phys. Rev. A 68, 22302 (2003)",
    "title": "Testing integrability with a single bit of quantum information",
    "url": "https://arxiv.org/abs/quant-ph/0303042"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e22d9eed-901d-4d1b-8ef0-0c99e1c1795a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}