{
  "annotation_id": "813b35ac-d395-491f-9a85-7018ba23c257",
  "date_created": "2026-03-02T18:02:26.743000Z",
  "date_modified": "2026-03-02T18:02:26.743000Z",
  "file_hash": "fc2ba50741d87795cc59365108e39a5398e9a67db1eb5043e7f68a794d26a278",
  "private": false,
  "record": {
    "abstract": "We develop two analytic lower bounds on the probability of success p of\nidentifying a state picked from a known ensemble of pure states: a bound based\non the pairwise inner products of the states, and a bound based on the\neigenvalues of their Gram matrix. We use the latter to lower bound the\nasymptotic distinguishability of ensembles of n random quantum states in d\ndimensions, where n/d approaches a constant. In particular, for almost all\nensembles of n states in n dimensions, p\u003e0.72. An application to distinguishing\nBoolean functions (the \"oracle identification problem\") in quantum computation\nis given.",
    "arxiv_id": "quant-ph/0607011",
    "authors": [
      "Ashley Montanaro"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1007/s00220-007-0221-7",
    "journal_ref": "Comm. Math. Phys. 273(3), pp. 619-636, 2007",
    "title": "On the distinguishability of random quantum states",
    "url": "https://arxiv.org/abs/quant-ph/0607011"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "185db4fc-6cc6-4194-86b0-d59e6b09726b",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}