{
  "annotation_id": "c2ea8900-9835-4e5e-8e32-3fed8c5ed23c",
  "date_created": "2026-03-02T18:01:45.413000Z",
  "date_modified": "2026-03-02T18:01:45.413000Z",
  "file_hash": "1f38add59b86621fc9f4f5e83c762c009c8850f34f11b2ec39640cab8da2d81a",
  "private": false,
  "record": {
    "abstract": "We address the problem of simulating pair-interaction Hamiltonians in n node\nquantum networks where the subsystems have arbitrary, possibly different,\ndimensions. We show that any pair-interaction can be used to simulate any other\nby applying sequences of appropriate local control sequences. Efficient schemes\nfor decoupling and time reversal can be constructed from orthogonal arrays.\nConditions on time optimal simulation are formulated in terms of spectral\nmajorization of matrices characterizing the coupling parameters. Moreover, we\nconsider a specific system of n harmonic oscillators with bilinear interaction.\nIn this case, decoupling can efficiently be achieved using the combinatorial\nconcept of difference schemes. For this type of interactions we present optimal\nschemes for inversion.",
    "arxiv_id": "quant-ph/0109088",
    "authors": [
      "Pawel Wocjan",
      "Martin Roetteler",
      "Dominik Janzing",
      "Thomas Beth"
    ],
    "categories": [
      "quant-ph",
      "cs.ET"
    ],
    "doi": "10.1103/PhysRevA.65.042309",
    "journal_ref": "Phys. Rev. A 65, 042309 (2002)",
    "title": "Simulating Hamiltonians in Quantum Networks: Efficient Schemes and   Complexity Bounds",
    "url": "https://arxiv.org/abs/quant-ph/0109088"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "2032e11f-2365-40e9-92e2-91b256973265",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}