{
  "annotation_id": "7bd7f236-91bc-413f-939a-e281b7dbc80e",
  "date_created": "2026-03-02T18:02:13.740000Z",
  "date_modified": "2026-03-02T18:02:13.740000Z",
  "file_hash": "80297492c4192fccb4e6a315fa34b1ef516b1c61db571e609b2cfe3eb7c8fccd",
  "private": false,
  "record": {
    "abstract": "We study the problem of discriminating between non-orthogonal quantum states\nwith least probability of error. We demonstrate that this problem can be\nsimplified if we solve for the error itself rather than solving directly for\nthe optimal measurement. This method enables us to derive solutions directly\nand thus make definite statements about the uniqueness of an optimal strategy.\nThis approach immediately leads us to a state-discrimination analogue of Davies\nTheorem.\n  In the course of this, a complete solution for distinguishing equally likely\npure qubit states is presented.",
    "arxiv_id": "quant-ph/0410228",
    "authors": [
      "Kieran Hunter"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1063/1.1834388",
    "title": "Results in Optimal Discrimination",
    "url": "https://arxiv.org/abs/quant-ph/0410228"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "13805a94-28db-403b-a28d-f4c109eaf0eb",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}