{
  "annotation_id": "9bc807df-c36d-4c9f-95b7-60dadd5ab5a1",
  "date_created": "2026-03-02T18:02:44.282000Z",
  "date_modified": "2026-03-02T18:02:44.282000Z",
  "file_hash": "08e3d7100666f71650877c630a27d2dd4525f3fb62fb90b54bf2cd4e7c253482",
  "private": false,
  "record": {
    "abstract": "To efficiently implement many-qubit gates for use in quantum simulations on\nquantum computers we develop and present methods reexpressing exp[-i (H_1 + H_2\n+ ...) \\Delta t] as a product of factors exp[-i H_1 \\Delta t], exp[-i H_2\n\\Delta t], ... which is accurate to 3rd or 4th order in \\Delta t. The methods\nwe derive are an extended form of symplectic method and can also be used for\nthe integration of classical Hamiltonians on classical computers. We derive\nboth integral and irrational methods, and find the most efficient methods in\nboth cases.",
    "arxiv_id": "quant-ph/9903055",
    "authors": [
      "A. T. Sornborger",
      "E. D. Stewart"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.60.1956",
    "journal_ref": "Phys.Rev. A60 (1999) 1956",
    "title": "Higher Order Methods for Simulations on Quantum Computers",
    "url": "https://arxiv.org/abs/quant-ph/9903055"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "ff58afe6-dbfe-4fe9-a51a-6790e0025d87",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}