{
  "annotation_id": "c6551f6a-f0b6-4d4b-83bd-39ab3780e13d",
  "date_created": "2026-03-02T18:02:38.015000Z",
  "date_modified": "2026-03-02T18:02:38.015000Z",
  "file_hash": "af87081f5b97d8b9e7801f9c5df5d3df507443e41dec2e5cd029a97f9a4dc93f",
  "private": false,
  "record": {
    "abstract": "We consider a probabilistic quantum implementation of a variable of the\nPocklington-Lehmer $N-1$ primality test using Shor\u0027s algorithm. O($\\log^3 N\n\\log\\log N \\log\\log\\log N$) elementary q-bit operations are required to\ndetermine the primality of a number $N$, making it (asymptotically) the fastest\nknown primality test. Thus, the potential power of quantum mechanical computers\nis once again revealed.",
    "arxiv_id": "quant-ph/9508005",
    "authors": [
      "H. F. Chau",
      "H. -K. Lo"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Primality Test Via Quantum Factorization",
    "url": "https://arxiv.org/abs/quant-ph/9508005"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7bd0ce0a-dbf9-47a8-b939-6a3a95ab9b13",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}