{
  "annotation_id": "6fd9f418-5503-4047-8a87-f693c739070c",
  "date_created": "2026-03-02T18:01:38.869000Z",
  "date_modified": "2026-03-02T18:01:38.869000Z",
  "file_hash": "315852852f09e4f20d157e999992a2a2636c5d0313b975d44a43fbf93c901351",
  "private": false,
  "record": {
    "abstract": "We consider unitary dynamical evolutions on n qubits caused by time dependent\npair-interaction Hamiltonians and show that the running time of a parallelized\ntwo-qubit gate network simulating the evolution is given by the time integral\nover the chromatic index of the interaction graph. This defines a complexity\nmeasure of continuous and discrete quantum algorithms which are in exact\none-to-one correspondence. Furthermore we prove a lower bound on the growth of\nlarge-scale entanglement depending on the chromatic index.",
    "arxiv_id": "quant-ph/0009094",
    "authors": [
      "Dominik Janzing",
      "Thomas Beth"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.64.022301",
    "journal_ref": "Phys. Rev. A 64(2):022301, 2000",
    "title": "A Complexity Measure for Continuous Time Quantum Algorithms",
    "url": "https://arxiv.org/abs/quant-ph/0009094"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "cb6e4bf1-7f83-4bfb-8dbf-874d9197c150",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}