Home
File Metadata
quant-ph_9806084.txt
Annotation: dorsal/arxiv

dorsal/arxiv

Added by Arxiv Bot | Added: 2026-03-02 18:02 | Views: 1 | Source: arXiv Dataset IDs (Model)

Fast versions of Shor's quantum factoring algorithm

Authors	Christof Zalka
Categories	quant-ph
ArXiv ID	quant-ph/9806084
URL	https://arxiv.org/abs/quant-ph/9806084

Abstract

We present fast and highly parallelized versions of Shor's algorithm. With a sizable quantum computer it would then be possible to factor numbers with millions of digits. The main algorithm presented here uses FFT-based fast integer multiplication. The quick reader can just read the introduction and the ``Results'' section.

{
  "annotation_id": "3f153cf5-c27f-45d9-ae6b-d5262b799e6f",
  "date_created": "2026-03-02T18:02:45.249000Z",
  "date_modified": "2026-03-02T18:02:45.249000Z",
  "file_hash": "5d5c4194c3406613a89ad505b18319605446f272d4506a747ffe5e6969947334",
  "private": false,
  "record": {
    "abstract": "We present fast and highly parallelized versions of Shor\u0027s algorithm. With a\nsizable quantum computer it would then be possible to factor numbers with\nmillions of digits. The main algorithm presented here uses FFT-based fast\ninteger multiplication. The quick reader can just read the introduction and the\n``Results\u0027\u0027 section.",
    "arxiv_id": "quant-ph/9806084",
    "authors": [
      "Christof Zalka"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Fast versions of Shor\u0027s quantum factoring algorithm",
    "url": "https://arxiv.org/abs/quant-ph/9806084"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "98a9118a-51dc-40a6-9ede-f94935abae1a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}