{
  "annotation_id": "54f5396c-99c4-4a5b-8059-8146353ec363",
  "date_created": "2026-03-02T18:02:06.815000Z",
  "date_modified": "2026-03-02T18:02:06.815000Z",
  "file_hash": "f463822d14bec69e75c68806d39afc3e4ecb964d879f2c6acc3be0c2c292b080",
  "private": false,
  "record": {
    "abstract": "Presented here is an algorithm for a type-II quantum computer which simulates\nthe Ising model in one and two dimensions. It is equivalent to the Metropolis\nMonte-Carlo method and takes advantage of quantum superposition for random\nnumber generation. This algorithm does not require the ensemble of states to be\nmeasured at the end of each iteration, as is required for other type-II\nalgorithms. Only the binary result is measured at each node which means this\nalgorithm could be implemented using a range of different quantum computing\narchitectures. The Ising model provides an example of how cellular automata\nrules can be formulated to be run on a type-II quantum computer.",
    "arxiv_id": "quant-ph/0404143",
    "authors": [
      "J. H. Cole",
      "L. C. L. Hollenberg",
      "S. Prawer"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1016/j.cpc.2004.04.003",
    "journal_ref": "Computer Physics Communications, Vol. 161 (1-2), pg 18-26, 2004",
    "title": "An algorithm for simulating the Ising model on a type-II quantum   computer",
    "url": "https://arxiv.org/abs/quant-ph/0404143"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "091b3581-f362-4942-9c20-f74126b3b2fb",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}