{
  "annotation_id": "05baacef-5aac-4934-ae85-b632e8914e17",
  "date_created": "2026-03-02T18:02:10.133000Z",
  "date_modified": "2026-03-02T18:02:10.133000Z",
  "file_hash": "a0e6d9072012046d299c39f4debe42b0455e7fb10ada6bcc6a65892d5b6078ed",
  "private": false,
  "record": {
    "abstract": "Pseudo-random operators consist of sets of operators that exhibit many of the\nimportant statistical features of uniformly distributed random operators. Such\npseudo-random sets of operators are most useful whey they may be parameterized\nand generated on a quantum processor in a way that requires exponentially fewer\nresources than direct implementation of the uniformly random set. Efficient\npseudo-random operators can overcome the exponential cost of random operators\nrequired for quantum communication tasks such as super-dense coding of quantum\nstates and approximately secure quantum data-hiding, and enable efficient\nstochastic methods for noise estimation on prototype quantum processors. This\npaper summarizes some recently published work demonstrating a random circuit\nmethod for the implementation of pseudo-random unitary operators on a quantum\nprocessor [Emerson et al., Science 302:2098 (Dec.~19, 2003)], and further\nelaborates the theory and applications of pseudo-random states and operators.",
    "arxiv_id": "quant-ph/0410087",
    "authors": [
      "Joseph Emerson"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1126/science.1090790",
    "journal_ref": "Science 302, 2098 (2003)",
    "title": "Random Quantum Circuits and Pseudo-Random Operators: Theory and   Applications",
    "url": "https://arxiv.org/abs/quant-ph/0410087"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7162a6fd-0f01-4bcc-8b1d-b744f621b3d4",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}