{
  "annotation_id": "03a46829-0292-4b9a-b581-003a4b782a2a",
  "date_created": "2026-03-02T18:02:44.848000Z",
  "date_modified": "2026-03-02T18:02:44.848000Z",
  "file_hash": "411517588948e99b328eb9f15da8206e0a5f84e0b73643e1ea7be34c7106011b",
  "private": false,
  "record": {
    "abstract": "We present a new algorithm for reducing an arbitrary unitary matrix U into a\nsequence of elementary operations (operations such as controlled-nots and qubit\nrotations). Such a sequence of operations can be used to manipulate an array of\nquantum bits (i.e., a quantum computer). Our algorithm applies recursively a\nmathematical technique called the CS Decomposition to build a binary tree of\nmatrices whose product, in some order, equals the original matrix U. We show\nthat the Fast Fourier Transform (FFT) algorithm is a special case of our\nalgorithm. We report on a C++ program called \"Qubiter\" that implements the\nideas of this paper. Qubiter(PATENT PENDING) source code is publicly available.",
    "arxiv_id": "quant-ph/9902062",
    "authors": [
      "Robert R. Tucci"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "A Rudimentary Quantum Compiler(2cnd Ed.)",
    "url": "https://arxiv.org/abs/quant-ph/9902062"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2972b571-075f-4654-af90-82188e971443",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}