{
  "annotation_id": "5893b381-78d9-4dfc-ae3b-e60c61dc2368",
  "date_created": "2026-03-02T18:02:34.481000Z",
  "date_modified": "2026-03-02T18:02:34.481000Z",
  "file_hash": "da24ccf397d80cd351bfe85cfe5a2b4c3b229cc794297becef6c8e1690856d86",
  "private": false,
  "record": {
    "abstract": "We present a method for classically simulating quantum circuits based on the\ntensor contraction model of Markov and Shi (quant-ph/0511069). Using this\nmethod we are able to classically simulate the approximate quantum Fourier\ntransform in polynomial time. Moreover, our approach allows us to formulate a\ncondition for the composability of simulable quantum circuits. We use this\ncondition to show that any circuit composed of a constant number of approximate\nquantum Fourier transform circuits and log-depth circuits with limited\ninteraction range can also be efficiently simulated.",
    "arxiv_id": "quant-ph/0611241",
    "authors": [
      "Nadav Yoran",
      "Anthony J. Short"
    ],
    "categories": [
      "quant-ph"
    ],
    "doi": "10.1103/PhysRevA.76.042321",
    "journal_ref": "Phys. Rev. A 76, 042321 (2007).",
    "title": "Efficient classical simulation of the approximate quantum Fourier   transform",
    "url": "https://arxiv.org/abs/quant-ph/0611241"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "7cc2fe4e-f21c-4efb-8b16-d3d1d7f1f7a2",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}