{
  "annotation_id": "e20e7a22-e2d8-450c-9c51-a84b8472b3b2",
  "date_created": "2026-03-02T18:02:34.600000Z",
  "date_modified": "2026-03-02T18:02:34.600000Z",
  "file_hash": "70c835bb456faae603d77454f86f63159720fc0009b223ff07d72298ce72e388",
  "private": false,
  "record": {
    "abstract": "We analyze and compare the optimality of approximate and probabilistic\nuniversal programmable quantum processors. We define several characteristics\nhow to quantify the optimality and we study in detail performance of three\ntypes of programmable quantum processors based on (1) the C-NOT gate, (2) the\nSWAP operation, and (3) the model of the quantum information distributor - the\nQID processor. We show under which conditions the measurement assisted QID\nprocessor is optimal. We also investigate optimality of the so-called\nU-processors and we also compare the optimal approximative implementation of\nU(1) qubit rotations with the known probabilistic implementation as introduced\nby Vidal, Masanes and Cirac [ {\\em Phys. Rev. Lett.} {\\bf 88}, 047905 (2002)].",
    "arxiv_id": "quant-ph/0612218",
    "authors": [
      "Mario Ziman",
      "Vladimir Buzek"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1556/APH.26.2006.3-4.8",
    "journal_ref": "Acta Phys.Hung. B 26, 277-291 (2006)",
    "title": "Universality and optimality of programmable quantum processors",
    "url": "https://arxiv.org/abs/quant-ph/0612218"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0ff04240-32f7-405e-9e35-946b8c6b78b4",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}