{
  "annotation_id": "e2ca7e5c-6f58-4608-b43e-b2e175c3b2c8",
  "date_created": "2026-03-02T18:01:49.272000Z",
  "date_modified": "2026-03-02T18:01:49.272000Z",
  "file_hash": "78757f907ce813a74537e80ec4743af48bd52f692efddc19f3a00d352fe0c101",
  "private": false,
  "record": {
    "abstract": "In previous papers we have considered mutual simulation of n-partite\npair-interaction Hamiltonians. We have focussed on the running time overhead of\ngeneral simulations, while considering the required number of time steps only\nfor special cases (decoupling and time-reversal). These two complexity measures\ndiffer significantly. Here we derive lower bounds on the number of time steps\nfor general simulations. In particular, the simulation of interaction graphs\nwith irrational spectrum requires at least n steps. We discuss as examples\ngraphs that correspond to graph codes and nearest neighbor interactions in 1-\nand 2-dimensional lattices. In the latter case the lower bounds are almost\ntight.",
    "arxiv_id": "quant-ph/0203061",
    "authors": [
      "Dominik Janzing",
      "Pawel Wocjan",
      "Thomas Beth"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Bounds on the number of time steps for simulating arbitrary interaction   graphs",
    "url": "https://arxiv.org/abs/quant-ph/0203061"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "01966a13-125f-4cf5-b24b-d98282ea57cf",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}