{
  "annotation_id": "8a8c20f5-995f-45d7-8d36-563f0308599b",
  "date_created": "2026-03-02T18:02:34.194000Z",
  "date_modified": "2026-03-02T18:02:34.194000Z",
  "file_hash": "f0fc8593bdf3a08748da39514f0ecbc54b613fda4c5f38dc16c0450483490197",
  "private": false,
  "record": {
    "abstract": "We study the amount of interference in random quantum algorithms using a\nrecently derived quantitative measure of interference. To this end we introduce\ntwo random circuit ensembles composed of random sequences of quantum gates from\na universal set, mimicking quantum algorithms in the quantum circuit\nrepresentation. We show numerically that these ensembles converge to the\nwell--known circular unitary ensemble (CUE) for general complex quantum\nalgorithms, and to the Haar orthogonal ensemble (HOE) for real quantum\nalgorithms. We provide exact analytical formulas for the average and typical\ninterference in the circular ensembles, and show that for sufficiently large\nnumbers of qubits a random quantum algorithm uses with probability close to one\nan amount of interference approximately equal to the dimension of the Hilbert\nspace. As a by-product, we offer a new way of efficiently constructing random\noperators from the Haar measures of CUE or HOE in a high dimensional Hilbert\nspace using universal sets of quantum gates.",
    "arxiv_id": "quant-ph/0612168",
    "authors": [
      "Ludovic Arnaud",
      "Daniel Braun"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.75.062314",
    "journal_ref": "Phys. Rev. A 75, 062314 (2007)",
    "title": "Distribution of interference in random quantum algorithms",
    "url": "https://arxiv.org/abs/quant-ph/0612168"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "649663e1-566c-4f12-afb7-ebbcb2e4b161",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}