{
  "annotation_id": "3931e61e-63f4-416e-b018-4959eb821f74",
  "date_created": "2026-03-02T18:02:02.597000Z",
  "date_modified": "2026-03-02T18:02:02.597000Z",
  "file_hash": "16480b22983774d4afe87764ff3037bd04037f63fe014fa42292a2e3c1b78433",
  "private": false,
  "record": {
    "abstract": "We present a systematic analysis how one can improve performance of\nprobabilistic programmable quantum processors. We generalize a simple\nVidal-Masanes-Cirac processor that realizes U(1) rotations on a qubit with the\nphase of the rotation encoded in a state of the program register. We show how\nthe probability of success of the probabilistic processor can be enhanced by\nusing the processor in loops. In addition we show that the same strategy can be\nutilized for a probabilistic implementation of non-unitary transformations on\nqubits. In addtion, we show that an arbitrary SU(2) transformations of qubits\ncan be encoded in program state of a universal programmable probabilistic\nquantum processor. The probability of success of this processor can be enhanced\nby a systematic correction of errors via conditional loops. Finally, we show\nthat all our results can be generalized also for qudits. In particular, we show\nhow to implement SU (N) rotations of qudits via programmable quantum processor\nand how the performance of the processor can be enhanced when it is used in\nloops.",
    "arxiv_id": "quant-ph/0311170",
    "authors": [
      "Mark Hillery",
      "Mario Ziman",
      "Vladimir Buzek"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.69.042311",
    "journal_ref": "Phys.Rev.A 69, 042311 (2004)",
    "title": "Improving performance of probabilistic programmable quantum processors",
    "url": "https://arxiv.org/abs/quant-ph/0311170"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "4362bb1c-ee18-4e7f-a7fa-3e93d5418f11",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}