{
  "annotation_id": "d6695f45-7109-4331-b246-9f195289f6af",
  "date_created": "2026-03-02T18:02:23.779000Z",
  "date_modified": "2026-03-02T18:02:23.779000Z",
  "file_hash": "3bff418d97fb14a96ff601e841b160153f7d3dae498a82b8403c76e0351ecf7a",
  "private": false,
  "record": {
    "abstract": "We investigate the generation of quantum states and unitary operations that\nare ``random\u0027\u0027 in certain respects. We show how to use such states to estimate\nthe average fidelity, an important measure in the study of implementations of\nquantum algorithms. We re-discover the result that the states of a maximal set\nof mutually-unbiased bases serve this purpose. An efficient circuit is\npresented that generates an arbitrary state out of such a set.\n  Later on, we consider unitary operations that can be used to turn any quantum\nchannel into a depolarizing channel. It was known before that the Clifford\ngroup serves this and a related purpose, and we show that these are actually\nthe same. We also show that a small subset of the Clifford group is already\nsufficient to accomplish this. We conclude with an efficient construction of\nthe elements of that subset.\n  This thesis is based on joint work with Richard Cleve, Joseph Emerson, and\nEtera Livine.",
    "arxiv_id": "quant-ph/0512217",
    "authors": [
      "Christoph Dankert"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Efficient Simulation of Random Quantum States and Operators",
    "url": "https://arxiv.org/abs/quant-ph/0512217"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b4ec2400-4a43-4644-bef7-fc307fd16a3c",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}