{
  "annotation_id": "a76e7cd8-4551-4b92-8efe-114cd6594d99",
  "date_created": "2026-03-02T18:01:59.280000Z",
  "date_modified": "2026-03-02T18:01:59.280000Z",
  "file_hash": "edf7a251b43c9a7e49c55bdfbdcbbf8c65bdb2356346c2950bb26603ea5de485",
  "private": false,
  "record": {
    "abstract": "In order to demonstrate non-trivial quantum computations experimentally, such\nas the synthesis of arbitrary entangled states, it will be useful to understand\nhow to decompose a desired quantum computation into the shortest possible\nsequence of one-qubit and two-qubit gates. We contribute to this effort by\nproviding a method to construct an optimal quantum circuit for a general\ntwo-qubit gate that requires at most 3 CNOT gates and 15 elementary one-qubit\ngates. Moreover, if the desired two-qubit gate corresponds to a purely real\nunitary transformation, we provide a construction that requires at most 2 CNOTs\nand 12 one-qubit gates. We then prove that these constructions are optimal with\nrespect to the family of CNOT, y-rotation, z-rotation, and phase gates.",
    "arxiv_id": "quant-ph/0308006",
    "authors": [
      "Farrokh Vatan",
      "Colin Williams"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.69.032315",
    "journal_ref": "Phys. Rev. A 69, 032315 (2004)",
    "title": "Optimal Quantum Circuits for General Two-Qubit Gates",
    "url": "https://arxiv.org/abs/quant-ph/0308006"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "03ec8483-d51a-43b6-92a1-319057a9e2a2",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}