{
  "annotation_id": "d5b15b3f-5951-4d73-b5cd-7189ad8e32db",
  "date_created": "2026-03-02T18:02:13.329000Z",
  "date_modified": "2026-03-02T18:02:13.329000Z",
  "file_hash": "2b0289f1e1aec5c820ce9e50e3dc2485766b65f74d67100a4c189022452131c0",
  "private": false,
  "record": {
    "abstract": "A quantum compiling algorithm is an algorithm for decomposing (\"compiling\")\nan arbitrary unitary matrix into a sequence of elementary operations (SEO).\nSuppose $U_{in}$ is an $\\nb$-bit unstructured unitary matrix (a unitary matrix\nwith no special symmetries) that we wish to compile. For $\\nb\u003e10$, expressing\n$U_{in}$ as a SEO requires more than a million CNOTs. This calls for a method\nfor finding a unitary matrix that: (1)approximates $U_{in}$ well, and (2) is\nexpressible with fewer CNOTs than $U_{in}$. The purpose of this paper is to\npropose one such approximation method. Various quantum compiling algorithms\nhave been proposed in the literature that decompose an arbitrary unitary matrix\ninto a sequence of U(2)-multiplexors, each of which is then decomposed into a\nSEO. Our strategy for approximating $U_{in}$ is to approximate these\nintermediate U(2)-multiplexors. In this paper, we will show how one can\napproximate a U(2)-multiplexor by another U(2)-multiplexor that is expressible\nwith fewer CNOTs.",
    "arxiv_id": "quant-ph/0412072",
    "authors": [
      "Robert R. Tucci"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Quantum Compiling with Approximation of Multiplexors",
    "url": "https://arxiv.org/abs/quant-ph/0412072"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "12feb131-5fa5-4fe4-915f-cb9f6d62a9e3",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}