{
  "annotation_id": "23440d2b-3c41-44fd-b4af-e137950e7c55",
  "date_created": "2026-03-02T18:02:20.417000Z",
  "date_modified": "2026-03-02T18:02:20.417000Z",
  "file_hash": "9832f922a06d235618c7c3b6289799009b379e9340cfbaa219e60ac385b8fc5b",
  "private": false,
  "record": {
    "abstract": "We present an efficient quantum algorithm for simulating the evolution of a\nsparse Hamiltonian H for a given time t in terms of a procedure for computing\nthe matrix entries of H. In particular, when H acts on n qubits, has at most a\nconstant number of nonzero entries in each row/column, and |H| is bounded by a\nconstant, we may select any positive integer $k$ such that the simulation\nrequires O((\\log^*n)t^{1+1/2k}) accesses to matrix entries of H. We show that\nthe temporal scaling cannot be significantly improved beyond this, because\nsublinear time scaling is not possible.",
    "arxiv_id": "quant-ph/0508139",
    "authors": [
      "Dominic W. Berry",
      "Graeme Ahokas",
      "Richard Cleve",
      "Barry C. Sanders"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1007/s00220-006-0150-x",
    "journal_ref": "Communications in Mathematical Physics 270, 359 (2007)",
    "title": "Efficient quantum algorithms for simulating sparse Hamiltonians",
    "url": "https://arxiv.org/abs/quant-ph/0508139"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "0aaddf8a-2d27-4163-9a90-2cae9fbbadc2",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}