{
  "annotation_id": "38b83d35-a838-4dfb-8e5a-eb275e8e95c4",
  "date_created": "2026-03-02T18:02:34.365000Z",
  "date_modified": "2026-03-02T18:02:34.365000Z",
  "file_hash": "efa70a4b149c978a346533a180db9ee2ef84e716e641ea40e29b7cf3e55572a2",
  "private": false,
  "record": {
    "abstract": "Recently, Harrow et al. [Phys. Rev. Lett. 92, 187901 (2004)] gave a method\nfor preparing an arbitrary quantum state with high success probability by\nphysically transmitting some qubits, and by consuming a maximally entangled\nstate, together with exhausting some shared random bits. In this paper, we\ndiscover that some states are impossible to be perfectly prepared by Alice and\nBob initially sharing those entangled states that are superposed by the ground\nstates, as the states to be prepared. In particular, we present a sufficient\nand necessary condition for the states being enabled to be exactly prepared\nwith probability one, in terms of the initial entangled states (maybe\nnonmaximally) superposed by the ground states. In contrast, if the initially\nshared entanglement is maximal, then the probabilities for preparing these\nquantum states are smaller than one. Furthermore, the lower bound on the\nprobability for preparing some states are derived.",
    "arxiv_id": "quant-ph/0612149",
    "authors": [
      "Daowen Qiu"
    ],
    "categories": [
      "quant-ph"
    ],
    "journal_ref": "International Journal of Quantum Information, 2008, 6: 1115-1125.",
    "title": "A sufficient and necessary condition for superdense coding of quantum   states",
    "url": "https://arxiv.org/abs/quant-ph/0612149"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "99e2f103-6d2c-453b-b42f-1c5e0fbc31d0",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}