{
  "annotation_id": "5aa4eeed-80d0-4bfa-b9c6-a7daadbad0f7",
  "date_created": "2026-03-02T18:02:12.905000Z",
  "date_modified": "2026-03-02T18:02:12.905000Z",
  "file_hash": "98130ae5e6021ace171cf902a67a0230d77f975308698229cefa608fbd94a118",
  "private": false,
  "record": {
    "abstract": "A quantum compiler is a software program for decomposing (\"compiling\") an\narbitrary unitary matrix into a sequence of elementary operations (SEO). The\nauthor of this paper is also the author of a quantum compiler called Qubiter.\nQubiter uses a matrix decomposition called the Cosine-Sine Decomposition (CSD)\nthat is well known in the field of Computational Linear Algebra. One way of\nmeasuring the efficiency of a quantum compiler is to measure the number of\nCNOTs it uses to express an unstructured unitary matrix (a unitary matrix with\nno special symmetries). We will henceforth refer to this number as $\\epsilon$.\nIn this paper, we show how to improve $\\epsilon$ for Qubiter so that it matches\nthe current world record for $\\epsilon$, which is held by another quantum\ncompiling algorithm based on CSD.",
    "arxiv_id": "quant-ph/0411027",
    "authors": [
      "Robert R. Tucci"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Qubiter Algorithm Modification, Expressing Unstructured Unitary Matrices   with Fewer CNOTs",
    "url": "https://arxiv.org/abs/quant-ph/0411027"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ef09c180-477a-4a36-b819-26fbf4a01f0a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}