{
  "annotation_id": "323e1cbf-9d24-4ab1-8710-5a14543a32fe",
  "date_created": "2026-03-02T18:02:06.081000Z",
  "date_modified": "2026-03-02T18:02:06.081000Z",
  "file_hash": "734eed8def5cb3cca9ac181347465a1f2d7428631b76318707c6f10b5de0ba67",
  "private": false,
  "record": {
    "abstract": "We consider a generic elementary gate sequence which is needed to implement a\ngeneral quantum gate acting on n qubits -- a unitary transformation with 4^n\ndegrees of freedom. For synthesizing the gate sequence, a method based on the\nso-called cosine-sine matrix decomposition is presented. The result is optimal\nin the number of elementary one-qubit gates, 4^n, and scales more favorably\nthan the previously reported decompositions requiring 4^n-2^n+1 controlled NOT\ngates.",
    "arxiv_id": "quant-ph/0404089",
    "authors": [
      "Mikko Mottonen",
      "Juha J. Vartiainen",
      "Ville Bergholm",
      "Martti M. Salomaa"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.93.130502",
    "journal_ref": "Phys. Rev. Lett. 93, 130502 (2004)",
    "title": "Quantum Circuits for General Multiqubit Gates",
    "url": "https://arxiv.org/abs/quant-ph/0404089"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "3601749f-f0b6-4365-a34d-8eab54416e29",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}