{
  "annotation_id": "38e8a759-f7a1-4942-b341-cbc6dacb4639",
  "date_created": "2026-03-02T18:02:27.173000Z",
  "date_modified": "2026-03-02T18:02:27.173000Z",
  "file_hash": "3570cee356e2bbbad231ea305e57f21a5232a4d46f1d531db76331fa41f164ad",
  "private": false,
  "record": {
    "abstract": "We give algorithms to factorize large integers in the duality computer. We\nprovide three duality algorithms for factorization based on a naive\nfactorization method, the Shor algorithm in quantum computing, and the Fermat\u0027s\nmethod in classical computing. All these algorithms are polynomial in the input\nsize.",
    "arxiv_id": "quant-ph/0607026",
    "authors": [
      "Wan-Ying Wang",
      "Bin Shang",
      "Chuan Wang",
      "Gui Lu Long"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1088/0253-6102/47/3/019",
    "title": "Prime Factorization in the Duality Computer",
    "url": "https://arxiv.org/abs/quant-ph/0607026"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "3cb2bae4-0ae8-4060-9831-686ce7a6861e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}