{
  "annotation_id": "2f7c097d-f0d3-4982-a64f-3d80dd55269f",
  "date_created": "2026-03-02T18:01:59.972000Z",
  "date_modified": "2026-03-02T18:01:59.972000Z",
  "file_hash": "be2ef76a1c90cf3c431e3277c59fd1af5f25a230efe34aaf621c972974aa2c01",
  "private": false,
  "record": {
    "abstract": "We discuss the communication complexity of establishing a shared reference\nframe, in particular examining the case of aligning spatial axes via the\nexchange of spin-1/2 particles. Unlike previous work we allow for multiple\nrounds of communication, and we give several simple examples demonstrating that\nnontrivial tradeoffs between the number of rounds and the type of communication\nrequired exist. We then give an explicit protocol for aligning spatial axes via\nthe exchange of spin-1/2 particles which makes no use of either exchanged\nentangled states or of joint measurements. Rather it works by performing a\nsimple type of distributed quantum computation. To facilitate comparison with\nprevious work, we show that this protocol achieves a worst case fidelity for\nthe much studied problem of \"direction finding\" that is asymptotically\nequivalent (up to polylog factors) to the optimal average case fidelity\nachievable via a single forward communication of entangled states.",
    "arxiv_id": "quant-ph/0306017",
    "authors": [
      "Terry Rudolph",
      "Lov Grover"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.91.217905",
    "journal_ref": "Phys. Rev. Lett. 91, 217905 (2003).",
    "title": "On the communication complexity of establishing a shared reference frame",
    "url": "https://arxiv.org/abs/quant-ph/0306017"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "14404d48-669b-4829-9008-5fd818bc01af",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}