{
  "annotation_id": "f87fb9af-a80d-4c80-b039-d9b1faf12461",
  "date_created": "2026-03-02T18:01:45.859000Z",
  "date_modified": "2026-03-02T18:01:45.859000Z",
  "file_hash": "6df4672ed22f65aa8f8d7b22daf6a4a6030a82cf1c887f03674a06352e0804c1",
  "private": false,
  "record": {
    "abstract": "We show that many well-known signal transforms allow highly efficient\nrealizations on a quantum computer. We explain some elementary quantum circuits\nand review the construction of the Quantum Fourier Transform. We derive quantum\ncircuits for the Discrete Cosine and Sine Transforms, and for the Discrete\nHartley transform. We show that at most O(log^2 N) elementary quantum gates are\nnecessary to implement any of those transforms for input sequences of length N.",
    "arxiv_id": "quant-ph/0111039",
    "authors": [
      "Andreas Klappenecker",
      "Martin Roetteler"
    ],
    "categories": [
      "quant-ph",
      "cs.ET"
    ],
    "journal_ref": "Proceedings of the First International Workshop on Spectral\n  Techniques and Logic Design (SPECLOG 2000), pp. 483-497, 2000",
    "title": "On the Irresistible Efficiency of Signal Processing Methods in Quantum   Computing",
    "url": "https://arxiv.org/abs/quant-ph/0111039"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "47d7a686-be85-4a3d-8b21-a75c9e75b42d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}