{
  "annotation_id": "28524fa3-4808-454e-885a-df1a0de1c634",
  "date_created": "2026-03-02T18:01:55.391000Z",
  "date_modified": "2026-03-02T18:01:55.391000Z",
  "file_hash": "3330f85b894c3f22ad82d1d4f79e2d1222adddd79dd16f9d866c22358b1af584",
  "private": false,
  "record": {
    "abstract": "The problem of unambiguous state discrimination consists of determining which\nof a set of known quantum states a particular system is in. One is allowed to\nfail, but not to make a mistake. The optimal procedure is the one with the\nlowest failure probability. This procedure has been extended to bipartite\nstates where the two parties, Alice and Bob, are allowed to manipulate their\nparticles locally and communicate classically in order to determine which of\ntwo possible two-particle states they have been given. The failure probability\nof this local procedure has been shown to be the same as if the particles were\ntogether in the same location. Here we examine the effect of restricting the\nclassical communication between the parties, either allowing none or\neliminating the possibility that one party\u0027s measurement depends on the result\nof the other party\u0027s. These issues are studied for two-qubit states, and\noptimal procedures are found. In some cases the restrictions cause increases in\nthe failure probability, but in other cases they do not. Applications of these\nprocedures, in particular to secret sharing, are discussed.",
    "arxiv_id": "quant-ph/0210179",
    "authors": [
      "Mark Hillery",
      "Jihane Mimih"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.67.042304",
    "title": "Distinguishing two-qubit states using local measurements and restricted   classical communication",
    "url": "https://arxiv.org/abs/quant-ph/0210179"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "320b9d83-1eec-4cc1-b9b2-00cb5f103da9",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}