{
  "annotation_id": "4e95bd2e-f3ec-4675-853d-627dede70a3e",
  "date_created": "2026-03-02T18:02:03.314000Z",
  "date_modified": "2026-03-02T18:02:03.314000Z",
  "file_hash": "ea2ff2a5f1b6f83efdddc148b6db76d133e6a1663675993cf2dab0233fe7331d",
  "private": false,
  "record": {
    "abstract": "The design of efficient quantum circuits is an important issue in quantum\ncomputing. It is in general a formidable task to find a highly optimized\nquantum circuit for a given unitary matrix. We propose a quantum circuit design\nmethod that has the following unique feature: It allows to construct efficient\nquantum circuits in a systematic way by reusing and combining a set of highly\noptimized quantum circuits. Specifically, the method realizes a quantum circuit\nfor a given unitary matrix by implementing a linear combination of representing\nmatrices of a group, which have known fast quantum circuits. We motivate and\nillustrate this method by deriving extremely efficient quantum circuits for the\ndiscrete Hartley transform and for the fractional Fourier transforms. The sound\nmathematical basis of this design method allows to give meaningful and natural\ninterpretations of the resulting circuits. We demonstrate this aspect by giving\na natural interpretation of known teleportation circuits.",
    "arxiv_id": "quant-ph/0309121",
    "authors": [
      "Andreas Klappenecker",
      "Martin Roetteler"
    ],
    "categories": [
      "quant-ph",
      "cs.ET"
    ],
    "journal_ref": "International Journal on Foundations of Computer Science, 14(5),\n  pages 777-796, 2003",
    "title": "Quantum Software Reusability",
    "url": "https://arxiv.org/abs/quant-ph/0309121"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "d5e2c710-8aac-4d6f-830f-5817141fd21e",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}