{
  "annotation_id": "c1ad01d5-1558-4a55-b201-dc511a5bffb2",
  "date_created": "2026-03-02T18:02:20.537000Z",
  "date_modified": "2026-03-02T18:02:20.537000Z",
  "file_hash": "57adcc445b18877e9c81ee0fe466275ff9f194c5a35bae50bf161c6a8f35c4b3",
  "private": false,
  "record": {
    "abstract": "A quantum processor is a programmable quantum circuit in which both the data\nand the program, which specifies the operation that is carried out on the data,\nare quantum states. We study the situation in which we want to use such a\nprocessor to approximate a set of unitary operators to a specified level of\nprecision. We measure how well an operation is performed by the process\nfidelity between the desired operation and the operation produced by the\nprocessor. We show how to find the program for a given processor that produces\nthe best approximation of a particular unitary operation. We also place bounds\non the dimension of the program space that is necessary to approximate a set of\nunitary operators to a specified level of precision.",
    "arxiv_id": "quant-ph/0510161",
    "authors": [
      "Mark Hillery",
      "Mario Ziman",
      "Vladimir Buzek"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.73.022345",
    "title": "Approximate programmable quantum processors",
    "url": "https://arxiv.org/abs/quant-ph/0510161"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "217b59d6-59f5-4a06-bff9-03d7e05e523a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}