{
  "annotation_id": "4fe7aaca-9fab-4d43-a699-a8317ac495d5",
  "date_created": "2026-03-02T18:02:06.393000Z",
  "date_modified": "2026-03-02T18:02:06.393000Z",
  "file_hash": "54f2697f2a3ad55abb7f396b2f4ff0f765c432ea7ea08f77ee9be03154e6fcf2",
  "private": false,
  "record": {
    "abstract": "We investigate the exploitation of various combinatorial properties of graphs\nand set systems to study several issues in quantum information theory. We\ncharacterize the combinatorics of distributed EPR pairs for preparing\nmulti-partite entanglement in a real communication network. This combinatorics\nhelps in the study of various problems in multi-party case by just reducing to\nthe two-party case. Particularly, we use this combinatorics to (1) study\nvarious possible and impossible transformations of multi-partite states under\nLOCC, thus presenting an entirely new approach, not based on entropic\ncriterion, to study such state transformations. (2) present a protocol and\nproof of its unconditional security for quantum key distribution amongst\nseveral trusted parties. (3) propose an idea to combine the features of quantum\nkey distribution and quantum secret sharing. We investigate all the above\nissues in great detail and finally conclude briefly with some open research\ndirections based on our research.",
    "arxiv_id": "quant-ph/0405089",
    "authors": [
      "Sudhir Kumar Singh"
    ],
    "categories": [
      "quant-ph",
      "cs.CR",
      "math.CO"
    ],
    "title": "Combinatorial Approaches in Quantum Information Theory",
    "url": "https://arxiv.org/abs/quant-ph/0405089"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "a670378a-ac92-4d4a-90ae-b69f3173571a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}