{
  "annotation_id": "5e645bdd-2104-47d3-954b-a7c13ff3c9c1",
  "date_created": "2026-03-02T18:01:45.523000Z",
  "date_modified": "2026-03-02T18:01:45.523000Z",
  "file_hash": "69c32224ff09a817ccfeecb2b050e5a0fa058ce519c205e5bbcc7e2e62095c4d",
  "private": false,
  "record": {
    "abstract": "We present a probabilistic quantum processor for qudits. The processor itself\nis represented by a fixed array of gates. The input of the processor consists\nof two registers. In the program register the set of instructions (program) is\nencoded. This program is applied to the data register. The processor can\nperform any operation on a single qudit of the dimension N with a certain\nprobability. If the operation is unitary, the probability is in general 1/N^2,\nbut for more restricted sets of operators the probability can be higher. In\nfact, this probability can be independent of the dimension of the qudit Hilbert\nspace of the qudit under some conditions.",
    "arxiv_id": "quant-ph/0106088",
    "authors": [
      "Mark Hillery",
      "Vladimir Buzek",
      "Mario Ziman"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.65.022301",
    "title": "Probabilistic implementation of universal quantum processors",
    "url": "https://arxiv.org/abs/quant-ph/0106088"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "733c7644-8a98-463b-977d-2d880e58a018",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}