{
  "annotation_id": "70d7217d-c9e3-4455-93aa-d410d0f05006",
  "date_created": "2026-03-02T18:02:02.262000Z",
  "date_modified": "2026-03-02T18:02:02.262000Z",
  "file_hash": "27102a6e8db0b9806b92cdb9d778327c00128580c22111ed612167bb7cf43625",
  "private": false,
  "record": {
    "abstract": "We propose quantum devices that can realize probabilistically different\nprojective measurements on a qubit. The desired measurement basis is selected\nby the quantum state of a program register. First we analyze the\nphase-covariant multimeters for a large class of program states, then the\nuniversal multimeters for a special choice of program. In both cases we start\nwith deterministic but erroneous devices and then proceed to devices that never\nmake a mistake but from time to time they give an inconclusive result. These\nmultimeters are optimized (for a given type of a program) with respect to the\nminimum probability of inconclusive result. This concept is further generalized\nto the multimeters that minimize the error rate for a given probability of an\ninconclusive result (or vice versa). Finally, we propose a generalization for\nqudits.",
    "arxiv_id": "quant-ph/0308111",
    "authors": [
      "Jaromir Fiurasek",
      "Miloslav Dusek"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.69.032302",
    "journal_ref": "Phys. Rev. A 69, 032302 (2004).",
    "title": "Probabilistic quantum multimeters",
    "url": "https://arxiv.org/abs/quant-ph/0308111"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b1736d85-8fcb-4bf3-8488-1f2fd3117917",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}