{
  "annotation_id": "c3003f48-653b-47e6-af8c-6ba0e5e64469",
  "date_created": "2026-03-02T18:02:20.651000Z",
  "date_modified": "2026-03-02T18:02:20.651000Z",
  "file_hash": "ebb4c06afcc63789216c2fd79fb5ca2c6debd7021681a610bd586b12eeb03931",
  "private": false,
  "record": {
    "abstract": "We show how to efficiently simulate a quantum many-body system with tree\nstructure when its entanglement is bounded for any bipartite split along an\nedge of the tree. This is achieved by expanding the {\\em time-evolving block\ndecimation} simulation algorithm for time evolution from a one dimensional\nlattice to a tree graph, while replacing a {\\em matrix product state} with a\n{\\em tree tensor network}. As an application, we show that any one-way quantum\ncomputation on a tree graph can be efficiently simulated with a classical\ncomputer.",
    "arxiv_id": "quant-ph/0511070",
    "authors": [
      "Yaoyun Shi",
      "Luming Duan",
      "Guifre Vidal"
    ],
    "categories": [
      "quant-ph",
      "cond-mat.str-el"
    ],
    "doi": "10.1103/PhysRevA.74.022320",
    "journal_ref": "Phys. Rev. A 74, 022320 (2006)",
    "title": "Classical simulation of quantum many-body systems with a tree tensor   network",
    "url": "https://arxiv.org/abs/quant-ph/0511070"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "5e6eb956-f195-4242-ac95-eb66162a0b9d",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}