{
  "annotation_id": "c91a5ba3-9532-4a81-b131-0331eb8aad94",
  "date_created": "2026-03-02T18:01:59.534000Z",
  "date_modified": "2026-03-02T18:01:59.534000Z",
  "file_hash": "cdbcddbc341f200b618648e830c53454d3dc2a82c3b9723a841048862d8018ff",
  "private": false,
  "record": {
    "abstract": "We give a simple proof of a formula for the minimal time required to simulate\na two-qubit unitary operation using a fixed two-qubit Hamiltonian together with\nfast local unitaries. We also note that a related lower bound holds for\narbitrary n-qubit gates.",
    "arxiv_id": "quant-ph/0307190",
    "authors": [
      "Andrew M. Childs",
      "Henry L. Haselgrove",
      "Michael A. Nielsen"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.68.052311",
    "journal_ref": "Phys. Rev. A 68, 052311 (2003)",
    "title": "Lower bounds on the complexity of simulating quantum gates",
    "url": "https://arxiv.org/abs/quant-ph/0307190"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "8c92f6e7-4ebf-417d-9c2b-578cd2131b0a",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}