{
  "annotation_id": "14b0698f-90bc-4eac-89ae-9beeca07a68f",
  "date_created": "2026-03-02T18:02:03.178000Z",
  "date_modified": "2026-03-02T18:02:03.178000Z",
  "file_hash": "b9667ebccabf9e5788d12c5b3deddb9a536805d2b4e555b6c931b38ff668eadb",
  "private": false,
  "record": {
    "abstract": "We present an efficient quantum algorithm to measure the average fidelity\ndecay of a quantum map under perturbation using a single bit of quantum\ninformation. Our algorithm scales only as the complexity of the map under\ninvestigation, so for those maps admitting an efficient gate decomposition, it\nprovides an exponential speed up over known classical procedures. Fidelity\ndecay is important in the study of complex dynamical systems, where it is\nconjectured to be a signature of quantum chaos. Our result also illustrates the\nrole of chaos in the process of decoherence.",
    "arxiv_id": "quant-ph/0310038",
    "authors": [
      "David Poulin",
      "Robin Blume-Kohout",
      "Raymond Laflamme",
      "Harold Ollivier"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.92.177906",
    "journal_ref": "Phys. Rev. Lett. 92, 177906 (2004)",
    "title": "Exponential speed-up with a single bit of quantum information: Testing   the quantum butterfly effect",
    "url": "https://arxiv.org/abs/quant-ph/0310038"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8cf72933-80f0-4b50-994d-1a0071fadd15",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}