{
  "annotation_id": "38841390-ed8e-4aaa-95b3-7305b9382cdf",
  "date_created": "2026-03-02T18:02:12.915000Z",
  "date_modified": "2026-03-02T18:02:12.915000Z",
  "file_hash": "db9de5097aeaf96098fd2f045eb1ffe9eb8a479b01ac09c7104d4f845bde8e97",
  "private": false,
  "record": {
    "abstract": "In this note we construct a quantum Fourier transform circuit in a recursive\nway, by directly copying the \u0027divide and conquer\u0027 construction of the fast\nFourier transform algorithm, rather than using the explicit formula that is\ngiven in most introductory texts to quantum computation. We do not pretend this\npresentation to be original, nor claim for any anteriority. The aim of this\npaper is purely pedagogical.",
    "arxiv_id": "quant-ph/0411069",
    "authors": [
      "Gloria Paradisi",
      "Hugues Randriam"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A presentation of the quantum Fourier transform from a recursive   viewpoint",
    "url": "https://arxiv.org/abs/quant-ph/0411069"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "6d27e90f-3e01-4ca2-b4fe-0a21ff82ab27",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}