{
  "annotation_id": "a5fcf749-c94a-4700-9799-ef4a466634ce",
  "date_created": "2026-03-02T18:02:41.370000Z",
  "date_modified": "2026-03-02T18:02:41.370000Z",
  "file_hash": "3aff0878ea05532ed5f15a8a7a7a3951bf04942738271d67965f99b86d3416a9",
  "private": false,
  "record": {
    "abstract": "The quantum algorithms of Deutsch, Simon and Shor are described in a way\nwhich highlights their dependence on the Fourier transform. The general\nconstruction of the Fourier transform on an Abelian group is outlined and this\nprovides a unified way of understanding the efficacy of these algorithms.\nFinally we describe an efficient quantum factoring algorithm based on a general\nformalism of Kitaev and contrast its structure to the ingredients of Shor\u0027s\nalgorithm.",
    "arxiv_id": "quant-ph/9707033",
    "authors": [
      "Richard Jozsa"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1098/rspa.1998.0163",
    "title": "Quantum Algorithms and the Fourier Transform",
    "url": "https://arxiv.org/abs/quant-ph/9707033"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8f19ca5a-fac1-4f73-9911-9c18492af505",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}