{
  "annotation_id": "6c9ecd09-f7db-44c0-85b5-51ccb8ab92ae",
  "date_created": "2026-03-02T18:02:16.479000Z",
  "date_modified": "2026-03-02T18:02:16.479000Z",
  "file_hash": "7910c5a377de1b31b12659634ae62aa25858ab9e0a6373d061419d5f0e2f4288",
  "private": false,
  "record": {
    "abstract": "We examine the execution of general U(1) transformations on programmable\nquantum processors. We show that, with only the minimal assumption of\navailability of copies of the one-qubit program state, that the apparent\nadvantage of existing schemes proposed by G.Vidal it et al. [Phys. Rev. Lett.\n88, 047905 (2002)] and M.Hillery et al. [Phys. Rev. A. 65, 022301 (2003)] to\nexecute a general U(1) transformation with greater probability using complex\nprogram states appears not to hold.",
    "arxiv_id": "quant-ph/0505202",
    "authors": [
      "Adam Brazier",
      "Vladimir Buzek",
      "Peter L. Knight"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.71.032306",
    "journal_ref": "Physical Review A, vol. 71, p. 032306, 2005",
    "title": "Probabilistic programmable quantum processors with multiple copies of   program state",
    "url": "https://arxiv.org/abs/quant-ph/0505202"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "e5ea71be-00a9-4988-bb92-9b6b38bf1e3a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}