{
  "annotation_id": "ab26a0db-8dae-436d-8ab8-52a7160bdfcc",
  "date_created": "2026-03-02T18:02:03.427000Z",
  "date_modified": "2026-03-02T18:02:03.427000Z",
  "file_hash": "71572b13da50fe0cd77757aff34eb75fa98cb6d71bf5e6216371ca92a4024d1c",
  "private": false,
  "record": {
    "abstract": "Optimal implementation of quantum gates is crucial for designing a quantum\ncomputer. We consider the matrix representation of an arbitrary multiqubit\ngate. By ordering the basis vectors using the Gray code, we construct the\nquantum circuit which is optimal in the sense of fully controlled single-qubit\ngates and yet is equivalent with the multiqubit gate. In the second step of the\noptimization, superfluous control bits are eliminated, which eventually results\nin a smaller total number of the elementary gates. In our scheme the number of\ncontrolled NOT gates is $O(4^n)$ which coincides with the theoretical lower\nbound.",
    "arxiv_id": "quant-ph/0312218",
    "authors": [
      "Juha J. Vartiainen",
      "Mikko Mottonen",
      "Martti M. Salomaa"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevLett.92.177902",
    "journal_ref": "Phys. Rev. Lett. 92 177902 (2004)",
    "title": "Efficient decomposition of quantum gates",
    "url": "https://arxiv.org/abs/quant-ph/0312218"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "abf0c65a-e9aa-495e-9075-d71be139de94",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}