{
  "annotation_id": "ff013271-04f3-4768-a17e-6414d26eac7a",
  "date_created": "2026-03-02T18:02:03.198000Z",
  "date_modified": "2026-03-02T18:02:03.198000Z",
  "file_hash": "5355a34503b152f25799f107d7aa3f2b5f61796cba6a0a72477e62d2fdf4d02b",
  "private": false,
  "record": {
    "abstract": "The design and optimization of quantum circuits is central to quantum\ncomputation. This paper presents new algorithms for compiling arbitrary 2^n x\n2^n unitary matrices into efficient circuits of (n-1)-controlled single-qubit\nand (n-1)-controlled-NOT gates. We first present a general algebraic\noptimization technique, which we call the Palindrome Transform, that can be\nused to minimize the number of self-inverting gates in quantum circuits\nconsisting of concatenations of palindromic subcircuits. For a fixed column\nordering of two-level decomposition, we then give an numerative algorithm for\nminimal (n-1)-controlled-NOT circuit construction, which we call the\nPalindromic Optimization Algorithm. Our work dramatically reduces the number of\ngates generated by the conventional two-level decomposition method for\nconstructing quantum circuits of (n-1)-controlled single-qubit and\n(n-1)-controlled-NOT gates.",
    "arxiv_id": "quant-ph/0311008",
    "authors": [
      "Alfred V. Aho",
      "Krysta M. Svore"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Compiling Quantum Circuits using the Palindrome Transform",
    "url": "https://arxiv.org/abs/quant-ph/0311008"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "1f42e4bb-048e-4a88-84a7-24c82de299da",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}