{
  "annotation_id": "ad32e44d-2086-4e32-86fb-2f8132ccbc67",
  "date_created": "2026-03-02T18:01:39.208000Z",
  "date_modified": "2026-03-02T18:01:39.208000Z",
  "file_hash": "b6f60a88cf6b261236f7d9ab5fc5919591984743bac98a70739b3e77bfe56311",
  "private": false,
  "record": {
    "abstract": "The clock synchronization problem is to determine the time difference\n$\\Delta$ between two spatially separated clocks. When message delivery times\nbetween the two clocks are uncertain, $O(2^{2n})$ classical messages must be\nexchanged between the clocks to determine $n$ digits of $\\Delta$. On the other\nhand, as we show, there exists a quantum algorithm to obtain $n$ digits of\n$\\Delta$ while communicating only O(n) quantum messages.",
    "arxiv_id": "quant-ph/0005092",
    "authors": [
      "Isaac Chuang"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.85.2006",
    "title": "Quantum algorithm for distributed clock synchronization",
    "url": "https://arxiv.org/abs/quant-ph/0005092"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d145fae7-b226-490c-9795-18c168f7636e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}