{
  "annotation_id": "85558159-c591-4d1a-8452-99978c23643b",
  "date_created": "2026-03-02T18:02:17.161000Z",
  "date_modified": "2026-03-02T18:02:17.161000Z",
  "file_hash": "368a6a5020c97b06054a3f911dcb2b938ae2eba772f9ee9430dd9217b0e8e6ea",
  "private": false,
  "record": {
    "abstract": "We study quantum maps displaying spectral statistics intermediate between\nPoisson and Wigner-Dyson. It is shown that they can be simulated on a quantum\ncomputer with a small number of gates, and efficiently yield information about\nfidelity decay or spectral statistics. We study their matrix elements and\nentanglement production, and show that they converge with time to distributions\nwhich differ from random matrix predictions. A randomized version of these maps\ncan be implemented even more economically, and yields pseudorandom operators\nwith original properties, enabling for example to produce fractal random\nvectors. These algorithms are within reach of present-day quantum computers.",
    "arxiv_id": "quant-ph/0504230",
    "authors": [
      "O. Giraud",
      "B. Georgeot"
    ],
    "categories": [
      "quant-ph",
      "cond-mat.mes-hall",
      "nlin.CD"
    ],
    "doi": "10.1103/PhysRevA.72.042312",
    "journal_ref": "Phys. Rev. A 72, 042312 (2005).",
    "title": "Intermediate quantum maps for quantum computation",
    "url": "https://arxiv.org/abs/quant-ph/0504230"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f162a133-94b2-4ab1-8edc-6dee23187365",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}