{
  "annotation_id": "74bdcb8a-849a-4744-9d1a-1dc9120ff0dc",
  "date_created": "2026-03-02T18:02:06.280000Z",
  "date_modified": "2026-03-02T18:02:06.280000Z",
  "file_hash": "37daa0f6ed3378bca6b371f05852ef14e0a67c5a06082e11775e81a27b38cc3e",
  "private": false,
  "record": {
    "abstract": "We present a distributed implementation of Shor\u0027s quantum factoring algorithm\non a distributed quantum network model. This model provides a means for small\ncapacity quantum computers to work together in such a way as to simulate a\nlarge capacity quantum computer. In this paper, entanglement is used as a\nresource for implementing non-local operations between two or more quantum\ncomputers. These non-local operations are used to implement a distributed\nfactoring circuit with polynomially many gates. This distributed version of\nShor\u0027s algorithm requires an additional overhead of O((log N)^2) communication\ncomplexity, where N denotes the integer to be factored.",
    "arxiv_id": "quant-ph/0403146",
    "authors": [
      "Anocha Yimsiriwattana",
      "Samuel J. Lomonaco Jr"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1117/12.546504",
    "title": "Distributed quantum computing: A distributed Shor algorithm",
    "url": "https://arxiv.org/abs/quant-ph/0403146"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "c3bfb921-1121-4c11-8f31-cc9558754ff9",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}