{
  "annotation_id": "50ba878d-b466-4d97-9f93-24cfd35f8e66",
  "date_created": "2026-03-02T18:02:27.550000Z",
  "date_modified": "2026-03-02T18:02:27.550000Z",
  "file_hash": "08184902dd19636b66874e7c5e9affb1e905b259aa4ec9303f1cab1c8b343ba5",
  "private": false,
  "record": {
    "abstract": "Any unitary operation in quantum information processing can be implemented\nvia a sequence of simpler steps - quantum gates. However, actual implementation\nof a quantum gate is always imperfect and takes a finite time. Therefore,\nseeking for a short sequence of gates - efficient quantum circuit for a given\noperation, is an important task. We contribute to this issue by proposing\noptimization of the well-known universal procedure proposed by Barenco et.al\n[1]. We also created a computer program which realizes both Barenco\u0027s\ndecomposition and the proposed optimization. Furthermore, our optimization can\nbe applied to any quantum circuit containing generalized Toffoli gates,\nincluding basic quantum gate circuits.",
    "arxiv_id": "quant-ph/0607123",
    "authors": [
      "Michal Sedlak",
      "Martin Plesch"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.2478/s11534-008-0039-8",
    "journal_ref": "Cent. Eur. J. Phys. vol. 6 no.1 p. 128-134 (2008)",
    "title": "Towards optimization of quantum circuits",
    "url": "https://arxiv.org/abs/quant-ph/0607123"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "f4ae304e-143a-4ab4-bf7a-119ba6fbfb32",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}