{
  "annotation_id": "a3e57e9b-cbb0-45f0-865b-143abf043166",
  "date_created": "2026-03-02T18:02:02.269000Z",
  "date_modified": "2026-03-02T18:02:02.269000Z",
  "file_hash": "446e3e7b5bdaa046574e1a488e911f785f377c6f688cc3ec36665e79e58736d2",
  "private": false,
  "record": {
    "abstract": "From a geometric approach, we derive the minimum number of applications\nneeded for an arbitrary Controlled-Unitary gate to construct a universal\nquantum circuit. A new analytic construction procedure is presented and shown\nto be either optimal or close to optimal. This result can be extended to\nimprove the efficiency of universal quantum circuit construction from any\nentangling gate. Specifically, for both the Controlled-NOT and Double-CNOT\ngates, we develop simple analytic ways to construct universal quantum circuits\nwith three applications, which is the least possible.",
    "arxiv_id": "quant-ph/0308167",
    "authors": [
      "Jun Zhang",
      "Jiri Vala",
      "Shankar Sastry",
      "K. Birgitta Whaley"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.69.042309",
    "journal_ref": "A revised version is published as Phys. Rev. A 69, 042309 (2003)",
    "title": "Optimal quantum circuit synthesis from Controlled-U gates",
    "url": "https://arxiv.org/abs/quant-ph/0308167"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "6c4c863f-9fcf-461c-86b7-9b8504184d80",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}