{
  "annotation_id": "35b64ee9-c20a-4159-a5f5-bd8815c0b0cd",
  "date_created": "2026-03-02T18:01:44.863000Z",
  "date_modified": "2026-03-02T18:01:44.863000Z",
  "file_hash": "522c4a0c3c69efc55857cc959a3b44bc0dc5a58b28fe992983c88f1ee3d19516",
  "private": false,
  "record": {
    "abstract": "We use an n-spin system with permutation symmetric zz-interaction for\nsimulating arbitrary pair-interaction Hamiltonians. The calculation of the\nrequired time overhead is mathematically equivalent to a separability problem\nof n-qubit density matrices. We derive lower and upper bounds in terms of\nchromatic index and the spectrum of the interaction graph. The complexity\nmeasure defined by such a computational model is related to gate complexity and\na continuous complexity measure introduced in a former paper. We use\nmajorization of graph spectra for classifying Hamiltonians with respect to\ntheir computational power.",
    "arxiv_id": "quant-ph/0106077",
    "authors": [
      "P. Wocjan",
      "D. Janzing",
      "Th. Beth"
    ],
    "categories": [
      "quant-ph"
    ],
    "title": "Simulating Arbitrary Pair-Interactions by a Given Hamiltonian:   Graph-Theoretical Bounds on the Time Complexity",
    "url": "https://arxiv.org/abs/quant-ph/0106077"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "b0a216f7-b0d8-4ac2-9b8f-d4ea7b30878c",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}