{
  "annotation_id": "dc2d607d-98ea-480a-b289-473a98e363f6",
  "date_created": "2026-03-02T18:01:42.075000Z",
  "date_modified": "2026-03-02T18:01:42.075000Z",
  "file_hash": "55c17c48b80c1d2501e9a50f77211ae0cd4a1ac6c81902edad0fdd56d4840bcb",
  "private": false,
  "record": {
    "abstract": "We show that certain computational algorithms can be simulated on a quantum\ncomputer with exponential efficiency and be insensitive to phase errors. Our\nexplicit algorithm simulates accurately the classical chaotic dynamics for\nexponentially many orbits even when the quantum fidelity drops to zero. Such\nphase-insensitive algorithms open new possibilities for computation on\nrealistic quantum computers.",
    "arxiv_id": "quant-ph/0102082",
    "authors": [
      "B. Georgeot",
      "D. L. Shepelyansky"
    ],
    "categories": [
      "quant-ph",
      "cond-mat",
      "nlin.CD"
    ],
    "title": "Efficient quantum computing insensitive to phase errors",
    "url": "https://arxiv.org/abs/quant-ph/0102082"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "385f4d8c-58d4-49b9-b23a-daf961c4d9e6",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}