{
  "annotation_id": "30a8e1d8-c0c3-4548-ba10-719e797e5883",
  "date_created": "2026-03-02T18:01:49.226000Z",
  "date_modified": "2026-03-02T18:01:49.226000Z",
  "file_hash": "a68603fbbe4571ba2263a8e2dbbc07cdfb0e6de161260d073161130e80c16b33",
  "private": false,
  "record": {
    "abstract": "A quantum computer directly manipulates information stored in the state of\nquantum mechanical systems. The available operations have many attractive\nfeatures but also underly severe restrictions, which complicate the design of\nquantum algorithms. We present a divide-and-conquer approach to the design of\nvarious quantum algorithms. The class of algorithm includes many transforms\nwhich are well-known in classical signal processing applications. We show how\nfast quantum algorithms can be derived for the discrete Fourier transform, the\nWalsh-Hadamard transform, the Slant transform, and the Hartley transform. All\nthese algorithms use at most O(log^2 N) operations to transform a state vector\nof a quantum computer of length N.",
    "arxiv_id": "quant-ph/0201120",
    "authors": [
      "Sos S. Agaian",
      "Andreas Klappenecker"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1117/12.467967",
    "title": "Quantum Computing and a Unified Approach to Fast Unitary Transforms",
    "url": "https://arxiv.org/abs/quant-ph/0201120"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "50709c6d-1dcf-4093-b483-3e6e41d806be",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}