{
  "annotation_id": "829fc7a0-462e-4d85-81e6-3f5e7e157f21",
  "date_created": "2026-03-02T18:02:30.797000Z",
  "date_modified": "2026-03-02T18:02:30.797000Z",
  "file_hash": "18ab6efb790709c54afcda78d4797ebb8515527eea2915d709711bea80be2c18",
  "private": false,
  "record": {
    "abstract": "Several protocols for controlled teleportation were suggested by Yang, Chu,\nand Han [PRA 70, 022329 (2004)]. In these protocols, Alice teleports qubits (in\nan unknown state) to Bob iff a controller allows it. We view this problem in\nthe perspective of secure multi-party quantum computation. We show that the\nsuggested entanglement-efficient protocols for $m$-qubit controlled\nteleportation are open to cheating; Alice and Bob may teleport $(m-1)$-qubits\nof quantum information, out of the controllers\u0027 control. We conjecture that the\nstraightforward protocol for controlled teleportation, which requires each\ncontroller to hold $m$ entangled qubits, is optimal. We prove this conjecture\nfor a limited, but interesting, subset of protocols.",
    "arxiv_id": "quant-ph/0609028",
    "authors": [
      "Dan Kenigsberg",
      "Tal Mor"
    ],
    "categories": [
      "quant-ph",
      "cs.CR"
    ],
    "title": "Secure Controlled Teleportation",
    "url": "https://arxiv.org/abs/quant-ph/0609028"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "352bb693-9b9f-48ea-af48-b6f34419d00e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}